/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe014_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 02:15:21,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 02:15:21,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 02:15:21,794 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 02:15:21,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 02:15:21,796 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 02:15:21,804 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 02:15:21,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 02:15:21,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 02:15:21,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 02:15:21,811 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 02:15:21,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 02:15:21,816 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 02:15:21,817 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 02:15:21,821 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 02:15:21,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 02:15:21,823 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 02:15:21,827 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 02:15:21,831 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 02:15:21,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 02:15:21,836 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 02:15:21,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 02:15:21,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 02:15:21,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 02:15:21,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 02:15:21,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 02:15:21,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 02:15:21,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 02:15:21,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 02:15:21,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 02:15:21,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 02:15:21,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 02:15:21,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 02:15:21,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 02:15:21,859 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 02:15:21,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 02:15:21,860 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 02:15:21,860 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 02:15:21,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 02:15:21,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 02:15:21,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 02:15:21,865 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf [2020-10-22 02:15:21,888 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 02:15:21,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 02:15:21,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 02:15:21,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 02:15:21,893 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 02:15:21,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 02:15:21,894 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 02:15:21,894 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 02:15:21,894 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 02:15:21,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 02:15:21,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 02:15:21,895 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 02:15:21,895 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 02:15:21,895 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 02:15:21,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 02:15:21,896 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 02:15:21,896 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 02:15:21,896 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 02:15:21,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 02:15:21,897 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 02:15:21,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 02:15:21,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 02:15:21,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 02:15:21,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 02:15:21,899 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 02:15:21,899 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 02:15:21,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 02:15:21,899 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 02:15:21,900 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 02:15:21,900 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 02:15:21,901 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 02:15:22,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 02:15:22,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 02:15:22,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 02:15:22,274 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 02:15:22,274 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 02:15:22,278 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe014_rmo.oepc.i [2020-10-22 02:15:22,335 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76227acad/7ffc6e70a60449ed8a9fddfb403c87d0/FLAGd4a8ad20a [2020-10-22 02:15:22,940 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 02:15:22,941 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_rmo.oepc.i [2020-10-22 02:15:22,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76227acad/7ffc6e70a60449ed8a9fddfb403c87d0/FLAGd4a8ad20a [2020-10-22 02:15:23,230 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76227acad/7ffc6e70a60449ed8a9fddfb403c87d0 [2020-10-22 02:15:23,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 02:15:23,247 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 02:15:23,248 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 02:15:23,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 02:15:23,252 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 02:15:23,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:15:23" (1/1) ... [2020-10-22 02:15:23,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fba72e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:15:23, skipping insertion in model container [2020-10-22 02:15:23,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:15:23" (1/1) ... [2020-10-22 02:15:23,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 02:15:23,314 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 02:15:23,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:15:23,778 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 02:15:23,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:15:23,925 INFO L208 MainTranslator]: Completed translation [2020-10-22 02:15:23,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:15:23 WrapperNode [2020-10-22 02:15:23,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 02:15:23,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 02:15:23,927 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 02:15:23,927 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 02:15:23,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:15:23" (1/1) ... [2020-10-22 02:15:23,957 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:15:23" (1/1) ... [2020-10-22 02:15:23,999 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 02:15:24,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 02:15:24,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 02:15:24,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 02:15:24,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:15:23" (1/1) ... [2020-10-22 02:15:24,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:15:23" (1/1) ... [2020-10-22 02:15:24,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:15:23" (1/1) ... [2020-10-22 02:15:24,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:15:23" (1/1) ... [2020-10-22 02:15:24,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:15:23" (1/1) ... [2020-10-22 02:15:24,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:15:23" (1/1) ... [2020-10-22 02:15:24,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:15:23" (1/1) ... [2020-10-22 02:15:24,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 02:15:24,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 02:15:24,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 02:15:24,043 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 02:15:24,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:15:23" (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 [2020-10-22 02:15:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-22 02:15:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 02:15:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 02:15:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 02:15:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 02:15:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 02:15:24,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 02:15:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 02:15:24,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 02:15:24,121 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 02:15:24,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 02:15:24,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 02:15:24,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 02:15:24,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 02:15:24,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 02:15:24,126 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 02:15:26,097 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 02:15:26,097 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-22 02:15:26,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:15:26 BoogieIcfgContainer [2020-10-22 02:15:26,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 02:15:26,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 02:15:26,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 02:15:26,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 02:15:26,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 02:15:23" (1/3) ... [2020-10-22 02:15:26,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@734d889b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:15:26, skipping insertion in model container [2020-10-22 02:15:26,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:15:23" (2/3) ... [2020-10-22 02:15:26,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@734d889b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:15:26, skipping insertion in model container [2020-10-22 02:15:26,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:15:26" (3/3) ... [2020-10-22 02:15:26,110 INFO L111 eAbstractionObserver]: Analyzing ICFG safe014_rmo.oepc.i [2020-10-22 02:15:26,122 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 02:15:26,122 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 02:15:26,130 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-22 02:15:26,131 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 02:15:26,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,164 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,165 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,176 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,177 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,178 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,178 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,181 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,181 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,185 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,185 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,191 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,191 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,195 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,196 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,197 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:15:26,203 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 02:15:26,217 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-10-22 02:15:26,240 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 02:15:26,240 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 02:15:26,240 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 02:15:26,241 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 02:15:26,241 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 02:15:26,241 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 02:15:26,241 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 02:15:26,241 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 02:15:26,258 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 02:15:26,259 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 117 transitions, 249 flow [2020-10-22 02:15:26,262 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 117 transitions, 249 flow [2020-10-22 02:15:26,265 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 124 places, 117 transitions, 249 flow [2020-10-22 02:15:26,328 INFO L129 PetriNetUnfolder]: 3/114 cut-off events. [2020-10-22 02:15:26,329 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 02:15:26,334 INFO L80 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 3/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-10-22 02:15:26,338 INFO L116 LiptonReduction]: Number of co-enabled transitions 1562 [2020-10-22 02:15:26,858 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2020-10-22 02:15:26,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-22 02:15:26,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 02:15:26,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-22 02:15:26,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 02:15:27,002 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-22 02:15:28,465 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 238 DAG size of output: 198 [2020-10-22 02:15:28,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-22 02:15:28,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 02:15:29,092 WARN L193 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 111 [2020-10-22 02:15:30,485 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2020-10-22 02:15:30,683 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2020-10-22 02:15:31,554 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 [2020-10-22 02:15:31,711 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-10-22 02:15:31,911 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2020-10-22 02:15:32,760 WARN L193 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 159 [2020-10-22 02:15:33,085 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2020-10-22 02:15:33,098 INFO L131 LiptonReduction]: Checked pairs total: 4119 [2020-10-22 02:15:33,098 INFO L133 LiptonReduction]: Total number of compositions: 110 [2020-10-22 02:15:33,105 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 23 transitions, 61 flow [2020-10-22 02:15:33,141 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 442 states. [2020-10-22 02:15:33,143 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states. [2020-10-22 02:15:33,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 02:15:33,152 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:15:33,153 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:15:33,153 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:15:33,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:15:33,159 INFO L82 PathProgramCache]: Analyzing trace with hash -5966585, now seen corresponding path program 1 times [2020-10-22 02:15:33,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:15:33,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50019084] [2020-10-22 02:15:33,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:15:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:15:33,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:15:33,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50019084] [2020-10-22 02:15:33,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:15:33,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:15:33,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1129634217] [2020-10-22 02:15:33,451 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:15:33,454 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:15:33,471 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 02:15:33,471 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:15:33,475 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:15:33,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:15:33,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:15:33,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:15:33,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:15:33,494 INFO L87 Difference]: Start difference. First operand 442 states. Second operand 3 states. [2020-10-22 02:15:33,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:15:33,545 INFO L93 Difference]: Finished difference Result 422 states and 1265 transitions. [2020-10-22 02:15:33,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:15:33,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-22 02:15:33,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:15:33,565 INFO L225 Difference]: With dead ends: 422 [2020-10-22 02:15:33,565 INFO L226 Difference]: Without dead ends: 342 [2020-10-22 02:15:33,567 INFO L677 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 [2020-10-22 02:15:33,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2020-10-22 02:15:33,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2020-10-22 02:15:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2020-10-22 02:15:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1001 transitions. [2020-10-22 02:15:33,646 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1001 transitions. Word has length 9 [2020-10-22 02:15:33,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:15:33,647 INFO L481 AbstractCegarLoop]: Abstraction has 342 states and 1001 transitions. [2020-10-22 02:15:33,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:15:33,647 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1001 transitions. [2020-10-22 02:15:33,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 02:15:33,649 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:15:33,649 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:15:33,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 02:15:33,650 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:15:33,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:15:33,650 INFO L82 PathProgramCache]: Analyzing trace with hash -840443752, now seen corresponding path program 1 times [2020-10-22 02:15:33,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:15:33,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96894388] [2020-10-22 02:15:33,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:15:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:15:33,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:15:33,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96894388] [2020-10-22 02:15:33,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:15:33,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:15:33,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [344642992] [2020-10-22 02:15:33,786 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:15:33,788 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:15:33,793 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-10-22 02:15:33,793 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:15:33,823 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:15:33,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:15:33,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:15:33,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:15:33,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:15:33,825 INFO L87 Difference]: Start difference. First operand 342 states and 1001 transitions. Second operand 3 states. [2020-10-22 02:15:33,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:15:33,848 INFO L93 Difference]: Finished difference Result 322 states and 930 transitions. [2020-10-22 02:15:33,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:15:33,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-22 02:15:33,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:15:33,852 INFO L225 Difference]: With dead ends: 322 [2020-10-22 02:15:33,853 INFO L226 Difference]: Without dead ends: 322 [2020-10-22 02:15:33,854 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:15:33,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-10-22 02:15:33,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2020-10-22 02:15:33,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2020-10-22 02:15:33,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 930 transitions. [2020-10-22 02:15:33,881 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 930 transitions. Word has length 10 [2020-10-22 02:15:33,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:15:33,882 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 930 transitions. [2020-10-22 02:15:33,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:15:33,882 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 930 transitions. [2020-10-22 02:15:33,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 02:15:33,886 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:15:33,886 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:15:33,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 02:15:33,886 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:15:33,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:15:33,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1723673536, now seen corresponding path program 1 times [2020-10-22 02:15:33,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:15:33,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912255908] [2020-10-22 02:15:33,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:15:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:15:33,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:15:33,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912255908] [2020-10-22 02:15:33,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:15:33,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:15:33,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1653551614] [2020-10-22 02:15:33,989 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:15:33,991 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:15:33,993 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 27 transitions. [2020-10-22 02:15:33,993 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:15:34,106 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:15:34,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:15:34,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:15:34,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:15:34,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:15:34,107 INFO L87 Difference]: Start difference. First operand 322 states and 930 transitions. Second operand 3 states. [2020-10-22 02:15:34,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:15:34,115 INFO L93 Difference]: Finished difference Result 314 states and 904 transitions. [2020-10-22 02:15:34,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:15:34,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-22 02:15:34,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:15:34,119 INFO L225 Difference]: With dead ends: 314 [2020-10-22 02:15:34,119 INFO L226 Difference]: Without dead ends: 314 [2020-10-22 02:15:34,120 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:15:34,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-10-22 02:15:34,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2020-10-22 02:15:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2020-10-22 02:15:34,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 904 transitions. [2020-10-22 02:15:34,137 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 904 transitions. Word has length 11 [2020-10-22 02:15:34,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:15:34,137 INFO L481 AbstractCegarLoop]: Abstraction has 314 states and 904 transitions. [2020-10-22 02:15:34,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:15:34,137 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 904 transitions. [2020-10-22 02:15:34,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 02:15:34,139 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:15:34,139 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:15:34,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 02:15:34,140 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:15:34,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:15:34,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1892913434, now seen corresponding path program 1 times [2020-10-22 02:15:34,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:15:34,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890562432] [2020-10-22 02:15:34,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:15:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:15:34,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:15:34,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890562432] [2020-10-22 02:15:34,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:15:34,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:15:34,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1656921283] [2020-10-22 02:15:34,210 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:15:34,211 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:15:34,215 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 32 transitions. [2020-10-22 02:15:34,215 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:15:34,402 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:15:34,402 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:15:34,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:15:34,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:15:34,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:15:34,403 INFO L87 Difference]: Start difference. First operand 314 states and 904 transitions. Second operand 3 states. [2020-10-22 02:15:34,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:15:34,426 INFO L93 Difference]: Finished difference Result 306 states and 878 transitions. [2020-10-22 02:15:34,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:15:34,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-22 02:15:34,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:15:34,429 INFO L225 Difference]: With dead ends: 306 [2020-10-22 02:15:34,429 INFO L226 Difference]: Without dead ends: 306 [2020-10-22 02:15:34,430 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:15:34,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-10-22 02:15:34,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2020-10-22 02:15:34,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2020-10-22 02:15:34,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 878 transitions. [2020-10-22 02:15:34,452 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 878 transitions. Word has length 12 [2020-10-22 02:15:34,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:15:34,453 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 878 transitions. [2020-10-22 02:15:34,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:15:34,453 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 878 transitions. [2020-10-22 02:15:34,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 02:15:34,459 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:15:34,459 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:15:34,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 02:15:34,461 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:15:34,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:15:34,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1450673693, now seen corresponding path program 1 times [2020-10-22 02:15:34,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:15:34,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104773169] [2020-10-22 02:15:34,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:15:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:15:34,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:15:34,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104773169] [2020-10-22 02:15:34,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:15:34,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:15:34,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [240089419] [2020-10-22 02:15:34,853 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:15:34,857 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:15:34,870 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 58 transitions. [2020-10-22 02:15:34,871 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:15:35,255 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:15:35,261 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:15:35,262 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:15:35,270 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 3, 3, 2, 2, 1] term [2020-10-22 02:15:35,271 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:15:35,272 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 3, 2, 1] term [2020-10-22 02:15:35,272 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:15:35,273 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 3, 2, 1] term [2020-10-22 02:15:35,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:15:35,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:15:35,304 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:15:35,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:15:35,329 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:15:35,338 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:15:35,361 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:15:35,380 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:15:35,385 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 02:15:35,387 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:15:35,388 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:15:35,388 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 02:15:35,395 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:15:35,397 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 02:15:35,401 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:15:35,404 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 02:15:35,406 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:15:35,407 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:15:35,424 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:15:35,428 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:15:35,431 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:15:35,460 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:15:35,468 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:15:35,469 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:15:35,470 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:15:35,472 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 02:15:35,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:15:35,483 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:15:35,499 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:15:35,500 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:15:35,503 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:15:35,506 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 02:15:35,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:15:35,514 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 02:15:35,517 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:15:35,520 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:15:35,738 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 27 [2020-10-22 02:15:36,370 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [4962#(and (= ~y$r_buff1_thd0~0 0) (or (and (not (= (mod ~y$r_buff0_thd1~0 256) 0)) (= ~y$w_buff0~0 (select (select |#memory_int| |~#y~0.base|) |~#y~0.offset|))) (and (= (mod ~y$r_buff1_thd1~0 256) 0) (= (mod ~y$r_buff0_thd1~0 256) 0))) (not (= (select (select |#memory_int| |~#y~0.base|) |~#y~0.offset|) 1)) (= ~y$r_buff0_thd0~0 0))] [2020-10-22 02:15:36,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 02:15:36,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:15:36,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 02:15:36,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:15:36,372 INFO L87 Difference]: Start difference. First operand 306 states and 878 transitions. Second operand 8 states. [2020-10-22 02:15:36,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:15:36,522 INFO L93 Difference]: Finished difference Result 300 states and 859 transitions. [2020-10-22 02:15:36,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:15:36,522 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-10-22 02:15:36,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:15:36,526 INFO L225 Difference]: With dead ends: 300 [2020-10-22 02:15:36,526 INFO L226 Difference]: Without dead ends: 300 [2020-10-22 02:15:36,527 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-22 02:15:36,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2020-10-22 02:15:36,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2020-10-22 02:15:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2020-10-22 02:15:36,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 859 transitions. [2020-10-22 02:15:36,539 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 859 transitions. Word has length 13 [2020-10-22 02:15:36,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:15:36,539 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 859 transitions. [2020-10-22 02:15:36,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 02:15:36,540 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 859 transitions. [2020-10-22 02:15:36,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 02:15:36,541 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:15:36,541 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:15:36,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 02:15:36,541 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:15:36,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:15:36,542 INFO L82 PathProgramCache]: Analyzing trace with hash -2064217971, now seen corresponding path program 1 times [2020-10-22 02:15:36,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:15:36,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981346226] [2020-10-22 02:15:36,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:15:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:15:36,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:15:36,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981346226] [2020-10-22 02:15:36,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:15:36,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:15:36,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1099075431] [2020-10-22 02:15:36,626 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:15:36,628 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:15:36,633 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 32 transitions. [2020-10-22 02:15:36,633 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:15:36,727 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:15:36,728 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:15:36,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:15:36,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:15:36,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:15:36,729 INFO L87 Difference]: Start difference. First operand 300 states and 859 transitions. Second operand 4 states. [2020-10-22 02:15:36,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:15:36,768 INFO L93 Difference]: Finished difference Result 304 states and 775 transitions. [2020-10-22 02:15:36,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:15:36,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-22 02:15:36,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:15:36,773 INFO L225 Difference]: With dead ends: 304 [2020-10-22 02:15:36,773 INFO L226 Difference]: Without dead ends: 224 [2020-10-22 02:15:36,774 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:15:36,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-10-22 02:15:36,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2020-10-22 02:15:36,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2020-10-22 02:15:36,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 555 transitions. [2020-10-22 02:15:36,788 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 555 transitions. Word has length 14 [2020-10-22 02:15:36,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:15:36,789 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 555 transitions. [2020-10-22 02:15:36,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:15:36,792 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 555 transitions. [2020-10-22 02:15:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 02:15:36,793 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:15:36,793 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:15:36,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 02:15:36,793 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:15:36,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:15:36,794 INFO L82 PathProgramCache]: Analyzing trace with hash 446157151, now seen corresponding path program 1 times [2020-10-22 02:15:36,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:15:36,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487289859] [2020-10-22 02:15:36,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:15:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:15:36,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:15:36,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487289859] [2020-10-22 02:15:36,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:15:36,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:15:36,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1079749720] [2020-10-22 02:15:36,911 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:15:36,916 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:15:36,921 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 39 transitions. [2020-10-22 02:15:36,921 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:15:37,071 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [6628#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 02:15:37,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:15:37,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:15:37,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:15:37,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:15:37,073 INFO L87 Difference]: Start difference. First operand 224 states and 555 transitions. Second operand 6 states. [2020-10-22 02:15:37,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:15:37,137 INFO L93 Difference]: Finished difference Result 194 states and 442 transitions. [2020-10-22 02:15:37,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:15:37,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-22 02:15:37,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:15:37,145 INFO L225 Difference]: With dead ends: 194 [2020-10-22 02:15:37,145 INFO L226 Difference]: Without dead ends: 150 [2020-10-22 02:15:37,146 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:15:37,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-10-22 02:15:37,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2020-10-22 02:15:37,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-10-22 02:15:37,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 333 transitions. [2020-10-22 02:15:37,151 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 333 transitions. Word has length 15 [2020-10-22 02:15:37,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:15:37,152 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 333 transitions. [2020-10-22 02:15:37,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:15:37,152 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 333 transitions. [2020-10-22 02:15:37,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-22 02:15:37,152 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:15:37,152 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:15:37,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 02:15:37,153 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:15:37,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:15:37,153 INFO L82 PathProgramCache]: Analyzing trace with hash -765055018, now seen corresponding path program 1 times [2020-10-22 02:15:37,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:15:37,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307084881] [2020-10-22 02:15:37,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:15:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:15:37,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:15:37,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307084881] [2020-10-22 02:15:37,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:15:37,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:15:37,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1883915454] [2020-10-22 02:15:37,336 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:15:37,340 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:15:37,348 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 31 transitions. [2020-10-22 02:15:37,349 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:15:37,438 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [7131#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 02:15:37,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 02:15:37,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:15:37,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 02:15:37,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:15:37,440 INFO L87 Difference]: Start difference. First operand 150 states and 333 transitions. Second operand 7 states. [2020-10-22 02:15:37,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:15:37,507 INFO L93 Difference]: Finished difference Result 136 states and 303 transitions. [2020-10-22 02:15:37,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:15:37,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-22 02:15:37,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:15:37,510 INFO L225 Difference]: With dead ends: 136 [2020-10-22 02:15:37,510 INFO L226 Difference]: Without dead ends: 125 [2020-10-22 02:15:37,511 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:15:37,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-10-22 02:15:37,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-10-22 02:15:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-10-22 02:15:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 283 transitions. [2020-10-22 02:15:37,515 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 283 transitions. Word has length 17 [2020-10-22 02:15:37,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:15:37,516 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 283 transitions. [2020-10-22 02:15:37,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 02:15:37,516 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 283 transitions. [2020-10-22 02:15:37,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 02:15:37,517 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:15:37,517 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:15:37,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 02:15:37,517 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:15:37,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:15:37,517 INFO L82 PathProgramCache]: Analyzing trace with hash -876428581, now seen corresponding path program 1 times [2020-10-22 02:15:37,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:15:37,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014124049] [2020-10-22 02:15:37,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:15:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:15:37,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:15:37,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014124049] [2020-10-22 02:15:37,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:15:37,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:15:37,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [679895324] [2020-10-22 02:15:37,568 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:15:37,571 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:15:37,579 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 35 transitions. [2020-10-22 02:15:37,579 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:15:37,623 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:15:37,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:15:37,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:15:37,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:15:37,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:15:37,624 INFO L87 Difference]: Start difference. First operand 125 states and 283 transitions. Second operand 4 states. [2020-10-22 02:15:37,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:15:37,652 INFO L93 Difference]: Finished difference Result 155 states and 337 transitions. [2020-10-22 02:15:37,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:15:37,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-22 02:15:37,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:15:37,653 INFO L225 Difference]: With dead ends: 155 [2020-10-22 02:15:37,654 INFO L226 Difference]: Without dead ends: 97 [2020-10-22 02:15:37,654 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:15:37,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-22 02:15:37,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-10-22 02:15:37,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-22 02:15:37,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 203 transitions. [2020-10-22 02:15:37,657 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 203 transitions. Word has length 19 [2020-10-22 02:15:37,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:15:37,658 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 203 transitions. [2020-10-22 02:15:37,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:15:37,658 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 203 transitions. [2020-10-22 02:15:37,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 02:15:37,659 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:15:37,659 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:15:37,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 02:15:37,659 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:15:37,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:15:37,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1448721829, now seen corresponding path program 2 times [2020-10-22 02:15:37,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:15:37,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474590142] [2020-10-22 02:15:37,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:15:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:15:37,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:15:37,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474590142] [2020-10-22 02:15:37,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:15:37,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:15:37,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2064825553] [2020-10-22 02:15:37,703 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:15:37,706 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:15:37,775 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 29 transitions. [2020-10-22 02:15:37,775 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:15:37,810 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:15:37,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:15:37,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:15:37,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:15:37,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:15:37,812 INFO L87 Difference]: Start difference. First operand 97 states and 203 transitions. Second operand 4 states. [2020-10-22 02:15:37,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:15:37,835 INFO L93 Difference]: Finished difference Result 141 states and 290 transitions. [2020-10-22 02:15:37,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:15:37,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-22 02:15:37,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:15:37,837 INFO L225 Difference]: With dead ends: 141 [2020-10-22 02:15:37,837 INFO L226 Difference]: Without dead ends: 83 [2020-10-22 02:15:37,837 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:15:37,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-10-22 02:15:37,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2020-10-22 02:15:37,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-10-22 02:15:37,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 163 transitions. [2020-10-22 02:15:37,840 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 163 transitions. Word has length 19 [2020-10-22 02:15:37,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:15:37,841 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 163 transitions. [2020-10-22 02:15:37,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:15:37,841 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 163 transitions. [2020-10-22 02:15:37,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 02:15:37,842 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:15:37,842 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:15:37,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 02:15:37,842 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:15:37,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:15:37,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1185057517, now seen corresponding path program 3 times [2020-10-22 02:15:37,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:15:37,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707243595] [2020-10-22 02:15:37,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:15:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:15:37,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:15:37,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707243595] [2020-10-22 02:15:37,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:15:37,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:15:37,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1748692967] [2020-10-22 02:15:37,891 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:15:37,894 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:15:37,901 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 27 transitions. [2020-10-22 02:15:37,901 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:15:37,944 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:15:37,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:15:37,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:15:37,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:15:37,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:15:37,945 INFO L87 Difference]: Start difference. First operand 83 states and 163 transitions. Second operand 4 states. [2020-10-22 02:15:37,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:15:37,964 INFO L93 Difference]: Finished difference Result 109 states and 211 transitions. [2020-10-22 02:15:37,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:15:37,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-22 02:15:37,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:15:37,966 INFO L225 Difference]: With dead ends: 109 [2020-10-22 02:15:37,966 INFO L226 Difference]: Without dead ends: 67 [2020-10-22 02:15:37,967 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:15:37,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-10-22 02:15:37,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-10-22 02:15:37,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-22 02:15:37,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 127 transitions. [2020-10-22 02:15:37,969 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 127 transitions. Word has length 19 [2020-10-22 02:15:37,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:15:37,970 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 127 transitions. [2020-10-22 02:15:37,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:15:37,970 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 127 transitions. [2020-10-22 02:15:37,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 02:15:37,970 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:15:37,970 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:15:37,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 02:15:37,971 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:15:37,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:15:37,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1537435615, now seen corresponding path program 4 times [2020-10-22 02:15:37,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:15:37,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717592526] [2020-10-22 02:15:37,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:15:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:15:38,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:15:38,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717592526] [2020-10-22 02:15:38,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:15:38,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:15:38,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1097378008] [2020-10-22 02:15:38,014 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:15:38,017 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:15:38,024 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 31 transitions. [2020-10-22 02:15:38,025 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:15:38,062 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:15:38,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:15:38,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:15:38,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:15:38,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:15:38,063 INFO L87 Difference]: Start difference. First operand 67 states and 127 transitions. Second operand 4 states. [2020-10-22 02:15:38,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:15:38,083 INFO L93 Difference]: Finished difference Result 85 states and 157 transitions. [2020-10-22 02:15:38,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:15:38,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-22 02:15:38,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:15:38,085 INFO L225 Difference]: With dead ends: 85 [2020-10-22 02:15:38,085 INFO L226 Difference]: Without dead ends: 59 [2020-10-22 02:15:38,085 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:15:38,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-22 02:15:38,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-10-22 02:15:38,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-22 02:15:38,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 107 transitions. [2020-10-22 02:15:38,088 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 107 transitions. Word has length 19 [2020-10-22 02:15:38,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:15:38,088 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 107 transitions. [2020-10-22 02:15:38,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:15:38,088 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 107 transitions. [2020-10-22 02:15:38,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 02:15:38,089 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:15:38,089 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:15:38,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 02:15:38,089 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:15:38,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:15:38,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1419457171, now seen corresponding path program 5 times [2020-10-22 02:15:38,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:15:38,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815887493] [2020-10-22 02:15:38,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:15:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:15:38,134 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:15:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:15:38,170 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:15:38,207 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 02:15:38,207 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 02:15:38,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-22 02:15:38,208 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 02:15:38,224 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L4-->L850: Formula: (let ((.cse8 (= (mod ~y$w_buff1_used~0_In1999527486 256) 0)) (.cse7 (= 0 (mod ~y$r_buff1_thd0~0_In1999527486 256))) (.cse9 (= (mod ~y$r_buff0_thd0~0_In1999527486 256) 0)) (.cse10 (= (mod ~y$w_buff0_used~0_In1999527486 256) 0))) (let ((.cse1 (not .cse10)) (.cse2 (not .cse9)) (.cse6 (or .cse9 .cse10)) (.cse3 (not .cse7)) (.cse4 (not .cse8)) (.cse5 (or .cse7 .cse8))) (and (= ~y$r_buff0_thd0~0_Out1999527486 ~y$r_buff0_thd0~0_In1999527486) (= ~y$r_buff1_thd0~0_Out1999527486 ~y$r_buff1_thd0~0_In1999527486) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In1999527486 0)) (let ((.cse0 (select |#memory_int_In1999527486| |~#y~0.base_In1999527486|))) (or (and (= |#memory_int_Out1999527486| (store |#memory_int_In1999527486| |~#y~0.base_In1999527486| (store .cse0 |~#y~0.offset_In1999527486| ~y$w_buff0~0_In1999527486))) .cse1 .cse2) (and (or (and (= |#memory_int_Out1999527486| (store |#memory_int_In1999527486| |~#y~0.base_In1999527486| (store .cse0 |~#y~0.offset_In1999527486| ~y$w_buff1~0_In1999527486))) .cse3 .cse4) (and .cse5 (= |#memory_int_Out1999527486| (store |#memory_int_In1999527486| |~#y~0.base_In1999527486| (store .cse0 |~#y~0.offset_In1999527486| (select .cse0 |~#y~0.offset_In1999527486|)))))) .cse6))) (or (and .cse1 (= ~y$w_buff0_used~0_Out1999527486 0) .cse2) (and (= ~y$w_buff0_used~0_In1999527486 ~y$w_buff0_used~0_Out1999527486) .cse6)) (or (and (= ~y$w_buff1_used~0_Out1999527486 0) .cse3 .cse4) (and .cse5 (= ~y$w_buff1_used~0_Out1999527486 ~y$w_buff1_used~0_In1999527486)))))) InVars {~#y~0.offset=|~#y~0.offset_In1999527486|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1999527486, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1999527486, ~y$w_buff1~0=~y$w_buff1~0_In1999527486, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1999527486, ~y$w_buff0~0=~y$w_buff0~0_In1999527486, #memory_int=|#memory_int_In1999527486|, ~#y~0.base=|~#y~0.base_In1999527486|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1999527486, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1999527486} OutVars{~#y~0.offset=|~#y~0.offset_In1999527486|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out1999527486, ULTIMATE.start_main_#t~mem42=|ULTIMATE.start_main_#t~mem42_Out1999527486|, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1999527486|, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1999527486|, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1999527486|, ~#y~0.base=|~#y~0.base_In1999527486|, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1999527486|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1999527486|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1999527486|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1999527486, ~y$w_buff1~0=~y$w_buff1~0_In1999527486, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out1999527486, ~y$w_buff0~0=~y$w_buff0~0_In1999527486, #memory_int=|#memory_int_Out1999527486|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1999527486, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1999527486} AuxVars[] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem42, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, #memory_int, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-22 02:15:38,232 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:15:38,232 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:15:38,232 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:15:38,232 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:15:38,233 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:15:38,233 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:15:38,233 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:15:38,233 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:15:38,233 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:15:38,234 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:15:38,234 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:15:38,234 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:15:38,234 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:15:38,234 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:15:38,235 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:15:38,235 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:15:38,235 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:15:38,235 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:15:38,235 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:15:38,235 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:15:38,236 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:15:38,236 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:15:38,236 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:15:38,236 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:15:38,237 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:15:38,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:15:38,238 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:15:38,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:15:38,238 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:15:38,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:15:38,239 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:15:38,239 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:15:38,239 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:15:38,239 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:15:38,239 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:15:38,239 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:15:38,241 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:15:38,241 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:15:38,241 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:15:38,241 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:15:38,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 02:15:38 BasicIcfg [2020-10-22 02:15:38,317 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 02:15:38,319 INFO L168 Benchmark]: Toolchain (without parser) took 15077.96 ms. Allocated memory was 146.8 MB in the beginning and 414.7 MB in the end (delta: 267.9 MB). Free memory was 101.1 MB in the beginning and 253.2 MB in the end (delta: -152.1 MB). Peak memory consumption was 115.8 MB. Max. memory is 7.1 GB. [2020-10-22 02:15:38,320 INFO L168 Benchmark]: CDTParser took 1.60 ms. Allocated memory is still 146.8 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-22 02:15:38,320 INFO L168 Benchmark]: CACSL2BoogieTranslator took 678.11 ms. Allocated memory was 146.8 MB in the beginning and 202.9 MB in the end (delta: 56.1 MB). Free memory was 100.2 MB in the beginning and 153.1 MB in the end (delta: -52.9 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2020-10-22 02:15:38,321 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.84 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 150.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-22 02:15:38,322 INFO L168 Benchmark]: Boogie Preprocessor took 43.13 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 148.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-22 02:15:38,322 INFO L168 Benchmark]: RCFGBuilder took 2057.34 ms. Allocated memory was 202.9 MB in the beginning and 247.5 MB in the end (delta: 44.6 MB). Free memory was 148.4 MB in the beginning and 187.6 MB in the end (delta: -39.2 MB). Peak memory consumption was 101.3 MB. Max. memory is 7.1 GB. [2020-10-22 02:15:38,323 INFO L168 Benchmark]: TraceAbstraction took 12215.77 ms. Allocated memory was 247.5 MB in the beginning and 414.7 MB in the end (delta: 167.2 MB). Free memory was 185.8 MB in the beginning and 253.2 MB in the end (delta: -67.4 MB). Peak memory consumption was 99.9 MB. Max. memory is 7.1 GB. [2020-10-22 02:15:38,327 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.60 ms. Allocated memory is still 146.8 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 678.11 ms. Allocated memory was 146.8 MB in the beginning and 202.9 MB in the end (delta: 56.1 MB). Free memory was 100.2 MB in the beginning and 153.1 MB in the end (delta: -52.9 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.84 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 150.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.13 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 148.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2057.34 ms. Allocated memory was 202.9 MB in the beginning and 247.5 MB in the end (delta: 44.6 MB). Free memory was 148.4 MB in the beginning and 187.6 MB in the end (delta: -39.2 MB). Peak memory consumption was 101.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12215.77 ms. Allocated memory was 247.5 MB in the beginning and 414.7 MB in the end (delta: 167.2 MB). Free memory was 185.8 MB in the beginning and 253.2 MB in the end (delta: -67.4 MB). Peak memory consumption was 99.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 837 VarBasedMoverChecksPositive, 38 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 56 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.8s, 124 PlacesBefore, 33 PlacesAfterwards, 117 TransitionsBefore, 23 TransitionsAfterwards, 1562 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 110 TotalNumberOfCompositions, 4119 MoverChecksTotal - CounterExampleResult [Line: 18]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L834] 0 pthread_t t2109; [L835] FCALL, FORK 0 pthread_create(&t2109, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={6: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L836] 0 pthread_t t2110; [L837] FCALL, FORK 0 pthread_create(&t2110, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={6: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L838] 0 pthread_t t2111; [L839] FCALL, FORK 0 pthread_create(&t2111, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={6: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1 [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L770] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L770] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L771] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L771] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0 [L771] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L771] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y={6: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y={6: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L791] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={6: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L794] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=2, y={6: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L806] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=2, y={6: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L809] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=2, y={6: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L816] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L853] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L853] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L853] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L853] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) [L19] COND TRUE 0 !expression [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe014_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x=2, y={6: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.9s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 273 SDtfs, 182 SDslu, 373 SDs, 0 SdLazy, 181 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=442occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 196 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 10643 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...