/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 23:01:29,893 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 23:01:29,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 23:01:29,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 23:01:29,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 23:01:29,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 23:01:29,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 23:01:29,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 23:01:29,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 23:01:29,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 23:01:29,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 23:01:29,929 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 23:01:29,929 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 23:01:29,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 23:01:29,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 23:01:29,932 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 23:01:29,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 23:01:29,934 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 23:01:29,936 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 23:01:29,938 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 23:01:29,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 23:01:29,941 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 23:01:29,942 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 23:01:29,943 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 23:01:29,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 23:01:29,946 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 23:01:29,946 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 23:01:29,947 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 23:01:29,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 23:01:29,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 23:01:29,949 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 23:01:29,950 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 23:01:29,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 23:01:29,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 23:01:29,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 23:01:29,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 23:01:29,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 23:01:29,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 23:01:29,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 23:01:29,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 23:01:29,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 23:01:29,957 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.epf [2020-10-21 23:01:29,980 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 23:01:29,981 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 23:01:29,982 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 23:01:29,982 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 23:01:29,983 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 23:01:29,983 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 23:01:29,983 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 23:01:29,983 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 23:01:29,983 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 23:01:29,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 23:01:29,984 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 23:01:29,984 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 23:01:29,984 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 23:01:29,984 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 23:01:29,984 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 23:01:29,985 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 23:01:29,985 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 23:01:29,985 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 23:01:29,985 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 23:01:29,986 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 23:01:29,986 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 23:01:29,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:01:29,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 23:01:29,986 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 23:01:29,987 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 23:01:29,987 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 23:01:29,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 23:01:29,987 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 23:01:29,987 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 23:01:30,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 23:01:30,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 23:01:30,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 23:01:30,298 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 23:01:30,298 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 23:01:30,299 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i [2020-10-21 23:01:30,365 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f3c32081/37320ff90bc64870a87c7845e29c81da/FLAG8d116b5df [2020-10-21 23:01:30,877 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 23:01:30,878 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i [2020-10-21 23:01:30,906 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f3c32081/37320ff90bc64870a87c7845e29c81da/FLAG8d116b5df [2020-10-21 23:01:31,206 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f3c32081/37320ff90bc64870a87c7845e29c81da [2020-10-21 23:01:31,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 23:01:31,223 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 23:01:31,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 23:01:31,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 23:01:31,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 23:01:31,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:01:31" (1/1) ... [2020-10-21 23:01:31,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11d64f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:31, skipping insertion in model container [2020-10-21 23:01:31,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:01:31" (1/1) ... [2020-10-21 23:01:31,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 23:01:31,314 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 23:01:31,925 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:01:31,940 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 23:01:32,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:01:32,154 INFO L208 MainTranslator]: Completed translation [2020-10-21 23:01:32,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:32 WrapperNode [2020-10-21 23:01:32,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 23:01:32,156 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 23:01:32,156 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 23:01:32,157 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 23:01:32,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:32" (1/1) ... [2020-10-21 23:01:32,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:32" (1/1) ... [2020-10-21 23:01:32,234 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 23:01:32,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 23:01:32,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 23:01:32,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 23:01:32,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:32" (1/1) ... [2020-10-21 23:01:32,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:32" (1/1) ... [2020-10-21 23:01:32,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:32" (1/1) ... [2020-10-21 23:01:32,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:32" (1/1) ... [2020-10-21 23:01:32,264 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:32" (1/1) ... [2020-10-21 23:01:32,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:32" (1/1) ... [2020-10-21 23:01:32,272 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:32" (1/1) ... [2020-10-21 23:01:32,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 23:01:32,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 23:01:32,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 23:01:32,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 23:01:32,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:32" (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-21 23:01:32,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 23:01:32,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 23:01:32,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 23:01:32,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 23:01:32,369 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 23:01:32,370 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 23:01:32,370 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 23:01:32,370 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 23:01:32,370 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 23:01:32,371 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 23:01:32,371 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-21 23:01:32,371 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-21 23:01:32,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 23:01:32,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 23:01:32,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 23:01:32,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 23:01:32,375 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 23:01:34,276 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 23:01:34,277 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 23:01:34,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:01:34 BoogieIcfgContainer [2020-10-21 23:01:34,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 23:01:34,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 23:01:34,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 23:01:34,288 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 23:01:34,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 11:01:31" (1/3) ... [2020-10-21 23:01:34,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a78bcb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:01:34, skipping insertion in model container [2020-10-21 23:01:34,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:32" (2/3) ... [2020-10-21 23:01:34,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a78bcb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:01:34, skipping insertion in model container [2020-10-21 23:01:34,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:01:34" (3/3) ... [2020-10-21 23:01:34,292 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_tso.opt.i [2020-10-21 23:01:34,304 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 23:01:34,304 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 23:01:34,313 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 23:01:34,314 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 23:01:34,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,360 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,361 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,362 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,362 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,363 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,363 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,371 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,372 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,372 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,375 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,377 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,377 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,377 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,378 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,378 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,383 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,383 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,383 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,383 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,384 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,384 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,384 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,384 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,384 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,385 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,385 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,385 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,385 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,385 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,390 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,390 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,393 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,393 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,394 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,394 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,397 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,398 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:34,400 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 23:01:34,415 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-21 23:01:34,439 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 23:01:34,440 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 23:01:34,440 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 23:01:34,441 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 23:01:34,441 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 23:01:34,441 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 23:01:34,441 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 23:01:34,441 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 23:01:34,462 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 23:01:34,463 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 117 transitions, 254 flow [2020-10-21 23:01:34,467 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 117 transitions, 254 flow [2020-10-21 23:01:34,469 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 127 places, 117 transitions, 254 flow [2020-10-21 23:01:34,526 INFO L129 PetriNetUnfolder]: 3/113 cut-off events. [2020-10-21 23:01:34,527 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 23:01:34,532 INFO L80 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 3/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2020-10-21 23:01:34,537 INFO L116 LiptonReduction]: Number of co-enabled transitions 2622 [2020-10-21 23:01:36,074 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-21 23:01:36,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-21 23:01:36,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:01:36,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 23:01:36,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:01:36,981 WARN L193 SmtUtils]: Spent 836.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-21 23:01:37,857 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-21 23:01:39,526 WARN L193 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-21 23:01:39,798 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-21 23:01:40,389 WARN L193 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 108 [2020-10-21 23:01:40,671 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-21 23:01:42,485 WARN L193 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 144 DAG size of output: 135 [2020-10-21 23:01:43,089 WARN L193 SmtUtils]: Spent 601.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-10-21 23:01:43,527 WARN L193 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-10-21 23:01:43,753 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-10-21 23:01:43,807 INFO L131 LiptonReduction]: Checked pairs total: 6769 [2020-10-21 23:01:43,808 INFO L133 LiptonReduction]: Total number of compositions: 105 [2020-10-21 23:01:43,814 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2020-10-21 23:01:43,975 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2602 states. [2020-10-21 23:01:43,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states. [2020-10-21 23:01:43,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 23:01:43,987 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:43,988 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:43,989 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:43,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:43,995 INFO L82 PathProgramCache]: Analyzing trace with hash 172921797, now seen corresponding path program 1 times [2020-10-21 23:01:44,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:44,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279328779] [2020-10-21 23:01:44,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:44,423 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-21 23:01:44,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279328779] [2020-10-21 23:01:44,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:44,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:01:44,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273570769] [2020-10-21 23:01:44,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:01:44,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:44,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:01:44,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:01:44,449 INFO L87 Difference]: Start difference. First operand 2602 states. Second operand 3 states. [2020-10-21 23:01:44,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:44,576 INFO L93 Difference]: Finished difference Result 2202 states and 8424 transitions. [2020-10-21 23:01:44,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:01:44,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-21 23:01:44,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:44,618 INFO L225 Difference]: With dead ends: 2202 [2020-10-21 23:01:44,618 INFO L226 Difference]: Without dead ends: 1802 [2020-10-21 23:01:44,620 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-21 23:01:44,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-10-21 23:01:44,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2020-10-21 23:01:44,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-10-21 23:01:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2020-10-21 23:01:44,804 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2020-10-21 23:01:44,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:44,806 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2020-10-21 23:01:44,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:01:44,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2020-10-21 23:01:44,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 23:01:44,809 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:44,809 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:44,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:01:44,810 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:44,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:44,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1325818042, now seen corresponding path program 1 times [2020-10-21 23:01:44,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:44,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843921409] [2020-10-21 23:01:44,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:44,969 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-21 23:01:44,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843921409] [2020-10-21 23:01:44,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:44,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:01:44,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367138365] [2020-10-21 23:01:44,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:01:44,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:44,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:01:44,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:01:44,974 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand 3 states. [2020-10-21 23:01:45,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:45,026 INFO L93 Difference]: Finished difference Result 1792 states and 6736 transitions. [2020-10-21 23:01:45,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:01:45,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-21 23:01:45,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:45,043 INFO L225 Difference]: With dead ends: 1792 [2020-10-21 23:01:45,044 INFO L226 Difference]: Without dead ends: 1792 [2020-10-21 23:01:45,045 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-21 23:01:45,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2020-10-21 23:01:45,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1792. [2020-10-21 23:01:45,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1792 states. [2020-10-21 23:01:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 6736 transitions. [2020-10-21 23:01:45,197 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 6736 transitions. Word has length 11 [2020-10-21 23:01:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:45,198 INFO L481 AbstractCegarLoop]: Abstraction has 1792 states and 6736 transitions. [2020-10-21 23:01:45,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:01:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 6736 transitions. [2020-10-21 23:01:45,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 23:01:45,201 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:45,201 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:45,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:01:45,202 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:45,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:45,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1861488477, now seen corresponding path program 1 times [2020-10-21 23:01:45,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:45,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187430567] [2020-10-21 23:01:45,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:45,319 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-21 23:01:45,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187430567] [2020-10-21 23:01:45,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:45,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:01:45,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729560716] [2020-10-21 23:01:45,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:01:45,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:45,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:01:45,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:01:45,322 INFO L87 Difference]: Start difference. First operand 1792 states and 6736 transitions. Second operand 4 states. [2020-10-21 23:01:45,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:45,386 INFO L93 Difference]: Finished difference Result 1764 states and 6612 transitions. [2020-10-21 23:01:45,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:01:45,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-21 23:01:45,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:45,403 INFO L225 Difference]: With dead ends: 1764 [2020-10-21 23:01:45,404 INFO L226 Difference]: Without dead ends: 1764 [2020-10-21 23:01:45,404 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:01:45,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2020-10-21 23:01:45,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1764. [2020-10-21 23:01:45,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1764 states. [2020-10-21 23:01:45,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 6612 transitions. [2020-10-21 23:01:45,475 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 6612 transitions. Word has length 12 [2020-10-21 23:01:45,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:45,475 INFO L481 AbstractCegarLoop]: Abstraction has 1764 states and 6612 transitions. [2020-10-21 23:01:45,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:01:45,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 6612 transitions. [2020-10-21 23:01:45,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 23:01:45,477 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:45,478 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:45,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:01:45,478 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:45,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:45,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1849246298, now seen corresponding path program 1 times [2020-10-21 23:01:45,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:45,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899355446] [2020-10-21 23:01:45,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:45,565 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-21 23:01:45,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899355446] [2020-10-21 23:01:45,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:45,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:01:45,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872088786] [2020-10-21 23:01:45,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:01:45,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:45,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:01:45,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:01:45,568 INFO L87 Difference]: Start difference. First operand 1764 states and 6612 transitions. Second operand 5 states. [2020-10-21 23:01:45,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:45,700 INFO L93 Difference]: Finished difference Result 1820 states and 6850 transitions. [2020-10-21 23:01:45,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:01:45,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-21 23:01:45,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:45,716 INFO L225 Difference]: With dead ends: 1820 [2020-10-21 23:01:45,716 INFO L226 Difference]: Without dead ends: 1820 [2020-10-21 23:01:45,717 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:01:45,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2020-10-21 23:01:45,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1788. [2020-10-21 23:01:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1788 states. [2020-10-21 23:01:45,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 6702 transitions. [2020-10-21 23:01:45,786 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 6702 transitions. Word has length 12 [2020-10-21 23:01:45,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:45,786 INFO L481 AbstractCegarLoop]: Abstraction has 1788 states and 6702 transitions. [2020-10-21 23:01:45,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:01:45,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 6702 transitions. [2020-10-21 23:01:45,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 23:01:45,788 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:45,788 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:45,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:01:45,788 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:45,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:45,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1849312328, now seen corresponding path program 2 times [2020-10-21 23:01:45,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:45,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959800030] [2020-10-21 23:01:45,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:45,837 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-21 23:01:45,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959800030] [2020-10-21 23:01:45,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:45,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:01:45,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122235614] [2020-10-21 23:01:45,838 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:01:45,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:45,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:01:45,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:01:45,839 INFO L87 Difference]: Start difference. First operand 1788 states and 6702 transitions. Second operand 3 states. [2020-10-21 23:01:45,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:45,871 INFO L93 Difference]: Finished difference Result 1748 states and 6520 transitions. [2020-10-21 23:01:45,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:01:45,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-21 23:01:45,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:45,891 INFO L225 Difference]: With dead ends: 1748 [2020-10-21 23:01:45,892 INFO L226 Difference]: Without dead ends: 1748 [2020-10-21 23:01:45,892 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-21 23:01:45,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2020-10-21 23:01:45,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1748. [2020-10-21 23:01:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1748 states. [2020-10-21 23:01:45,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 6520 transitions. [2020-10-21 23:01:45,969 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 6520 transitions. Word has length 12 [2020-10-21 23:01:45,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:45,970 INFO L481 AbstractCegarLoop]: Abstraction has 1748 states and 6520 transitions. [2020-10-21 23:01:45,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:01:45,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 6520 transitions. [2020-10-21 23:01:45,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:01:45,972 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:45,972 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:45,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:01:45,972 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:45,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:45,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1871500579, now seen corresponding path program 1 times [2020-10-21 23:01:45,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:45,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180871883] [2020-10-21 23:01:45,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:46,066 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-21 23:01:46,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180871883] [2020-10-21 23:01:46,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:46,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:01:46,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551355286] [2020-10-21 23:01:46,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:01:46,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:46,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:01:46,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:01:46,068 INFO L87 Difference]: Start difference. First operand 1748 states and 6520 transitions. Second operand 5 states. [2020-10-21 23:01:46,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:46,163 INFO L93 Difference]: Finished difference Result 1692 states and 6272 transitions. [2020-10-21 23:01:46,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:01:46,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-21 23:01:46,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:46,179 INFO L225 Difference]: With dead ends: 1692 [2020-10-21 23:01:46,180 INFO L226 Difference]: Without dead ends: 1692 [2020-10-21 23:01:46,180 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:01:46,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2020-10-21 23:01:46,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1684. [2020-10-21 23:01:46,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1684 states. [2020-10-21 23:01:46,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 6244 transitions. [2020-10-21 23:01:46,248 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 6244 transitions. Word has length 13 [2020-10-21 23:01:46,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:46,248 INFO L481 AbstractCegarLoop]: Abstraction has 1684 states and 6244 transitions. [2020-10-21 23:01:46,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:01:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 6244 transitions. [2020-10-21 23:01:46,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:01:46,252 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:46,252 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:46,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:01:46,253 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:46,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:46,253 INFO L82 PathProgramCache]: Analyzing trace with hash -2110987523, now seen corresponding path program 1 times [2020-10-21 23:01:46,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:46,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71802196] [2020-10-21 23:01:46,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:46,316 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-21 23:01:46,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71802196] [2020-10-21 23:01:46,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:46,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:01:46,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849265510] [2020-10-21 23:01:46,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:01:46,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:46,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:01:46,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:01:46,319 INFO L87 Difference]: Start difference. First operand 1684 states and 6244 transitions. Second operand 4 states. [2020-10-21 23:01:46,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:46,468 INFO L93 Difference]: Finished difference Result 1700 states and 6300 transitions. [2020-10-21 23:01:46,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:01:46,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-21 23:01:46,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:46,485 INFO L225 Difference]: With dead ends: 1700 [2020-10-21 23:01:46,485 INFO L226 Difference]: Without dead ends: 1700 [2020-10-21 23:01:46,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:01:46,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2020-10-21 23:01:46,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1700. [2020-10-21 23:01:46,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2020-10-21 23:01:46,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 6300 transitions. [2020-10-21 23:01:46,551 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 6300 transitions. Word has length 14 [2020-10-21 23:01:46,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:46,551 INFO L481 AbstractCegarLoop]: Abstraction has 1700 states and 6300 transitions. [2020-10-21 23:01:46,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:01:46,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 6300 transitions. [2020-10-21 23:01:46,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:01:46,554 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:46,554 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:46,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:01:46,555 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:46,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:46,555 INFO L82 PathProgramCache]: Analyzing trace with hash -2113368323, now seen corresponding path program 2 times [2020-10-21 23:01:46,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:46,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987004597] [2020-10-21 23:01:46,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:46,644 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-21 23:01:46,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987004597] [2020-10-21 23:01:46,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:46,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:01:46,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966702196] [2020-10-21 23:01:46,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:01:46,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:46,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:01:46,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:01:46,647 INFO L87 Difference]: Start difference. First operand 1700 states and 6300 transitions. Second operand 5 states. [2020-10-21 23:01:46,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:46,720 INFO L93 Difference]: Finished difference Result 1658 states and 6128 transitions. [2020-10-21 23:01:46,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:01:46,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-21 23:01:46,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:46,733 INFO L225 Difference]: With dead ends: 1658 [2020-10-21 23:01:46,733 INFO L226 Difference]: Without dead ends: 1658 [2020-10-21 23:01:46,734 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:01:46,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2020-10-21 23:01:46,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1642. [2020-10-21 23:01:46,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1642 states. [2020-10-21 23:01:46,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 6072 transitions. [2020-10-21 23:01:46,799 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 6072 transitions. Word has length 14 [2020-10-21 23:01:46,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:46,800 INFO L481 AbstractCegarLoop]: Abstraction has 1642 states and 6072 transitions. [2020-10-21 23:01:46,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:01:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 6072 transitions. [2020-10-21 23:01:46,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:01:46,803 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:46,803 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:46,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:01:46,803 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:46,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:46,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1082379228, now seen corresponding path program 1 times [2020-10-21 23:01:46,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:46,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821010067] [2020-10-21 23:01:46,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:46,913 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-21 23:01:46,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821010067] [2020-10-21 23:01:46,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:46,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:01:46,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316959918] [2020-10-21 23:01:46,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:01:46,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:46,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:01:46,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:01:46,916 INFO L87 Difference]: Start difference. First operand 1642 states and 6072 transitions. Second operand 4 states. [2020-10-21 23:01:46,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:46,979 INFO L93 Difference]: Finished difference Result 1682 states and 5674 transitions. [2020-10-21 23:01:46,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:01:46,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-21 23:01:46,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:46,999 INFO L225 Difference]: With dead ends: 1682 [2020-10-21 23:01:46,999 INFO L226 Difference]: Without dead ends: 1282 [2020-10-21 23:01:46,999 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:01:47,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2020-10-21 23:01:47,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1282. [2020-10-21 23:01:47,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2020-10-21 23:01:47,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 4290 transitions. [2020-10-21 23:01:47,046 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 4290 transitions. Word has length 15 [2020-10-21 23:01:47,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:47,047 INFO L481 AbstractCegarLoop]: Abstraction has 1282 states and 4290 transitions. [2020-10-21 23:01:47,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:01:47,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 4290 transitions. [2020-10-21 23:01:47,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:01:47,050 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:47,050 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:47,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 23:01:47,050 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:47,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:47,051 INFO L82 PathProgramCache]: Analyzing trace with hash -75162851, now seen corresponding path program 1 times [2020-10-21 23:01:47,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:47,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431530694] [2020-10-21 23:01:47,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:47,132 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-21 23:01:47,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431530694] [2020-10-21 23:01:47,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:47,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:01:47,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373523730] [2020-10-21 23:01:47,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:01:47,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:47,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:01:47,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:01:47,135 INFO L87 Difference]: Start difference. First operand 1282 states and 4290 transitions. Second operand 5 states. [2020-10-21 23:01:47,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:47,202 INFO L93 Difference]: Finished difference Result 1105 states and 3390 transitions. [2020-10-21 23:01:47,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:01:47,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-21 23:01:47,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:47,207 INFO L225 Difference]: With dead ends: 1105 [2020-10-21 23:01:47,208 INFO L226 Difference]: Without dead ends: 849 [2020-10-21 23:01:47,208 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:01:47,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2020-10-21 23:01:47,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2020-10-21 23:01:47,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2020-10-21 23:01:47,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2558 transitions. [2020-10-21 23:01:47,238 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2558 transitions. Word has length 16 [2020-10-21 23:01:47,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:47,239 INFO L481 AbstractCegarLoop]: Abstraction has 849 states and 2558 transitions. [2020-10-21 23:01:47,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:01:47,239 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2558 transitions. [2020-10-21 23:01:47,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 23:01:47,241 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:47,242 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:47,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 23:01:47,242 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:47,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:47,243 INFO L82 PathProgramCache]: Analyzing trace with hash 679643642, now seen corresponding path program 1 times [2020-10-21 23:01:47,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:47,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428093936] [2020-10-21 23:01:47,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:47,293 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-21 23:01:47,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428093936] [2020-10-21 23:01:47,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:47,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:01:47,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699144546] [2020-10-21 23:01:47,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:01:47,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:47,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:01:47,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:01:47,295 INFO L87 Difference]: Start difference. First operand 849 states and 2558 transitions. Second operand 4 states. [2020-10-21 23:01:47,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:47,330 INFO L93 Difference]: Finished difference Result 1165 states and 3424 transitions. [2020-10-21 23:01:47,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:01:47,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-10-21 23:01:47,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:47,336 INFO L225 Difference]: With dead ends: 1165 [2020-10-21 23:01:47,336 INFO L226 Difference]: Without dead ends: 873 [2020-10-21 23:01:47,337 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:01:47,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2020-10-21 23:01:47,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 849. [2020-10-21 23:01:47,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2020-10-21 23:01:47,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2478 transitions. [2020-10-21 23:01:47,365 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2478 transitions. Word has length 18 [2020-10-21 23:01:47,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:47,366 INFO L481 AbstractCegarLoop]: Abstraction has 849 states and 2478 transitions. [2020-10-21 23:01:47,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:01:47,366 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2478 transitions. [2020-10-21 23:01:47,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 23:01:47,369 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:47,369 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:47,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 23:01:47,369 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:47,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:47,370 INFO L82 PathProgramCache]: Analyzing trace with hash -555388612, now seen corresponding path program 1 times [2020-10-21 23:01:47,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:47,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991250407] [2020-10-21 23:01:47,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:47,475 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-21 23:01:47,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991250407] [2020-10-21 23:01:47,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:47,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:01:47,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408428247] [2020-10-21 23:01:47,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:01:47,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:47,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:01:47,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:01:47,477 INFO L87 Difference]: Start difference. First operand 849 states and 2478 transitions. Second operand 6 states. [2020-10-21 23:01:47,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:47,556 INFO L93 Difference]: Finished difference Result 734 states and 2110 transitions. [2020-10-21 23:01:47,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:01:47,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-21 23:01:47,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:47,560 INFO L225 Difference]: With dead ends: 734 [2020-10-21 23:01:47,561 INFO L226 Difference]: Without dead ends: 646 [2020-10-21 23:01:47,561 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:01:47,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-10-21 23:01:47,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2020-10-21 23:01:47,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2020-10-21 23:01:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1887 transitions. [2020-10-21 23:01:47,583 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1887 transitions. Word has length 18 [2020-10-21 23:01:47,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:47,583 INFO L481 AbstractCegarLoop]: Abstraction has 646 states and 1887 transitions. [2020-10-21 23:01:47,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:01:47,583 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1887 transitions. [2020-10-21 23:01:47,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 23:01:47,586 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:47,586 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:47,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 23:01:47,587 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:47,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:47,587 INFO L82 PathProgramCache]: Analyzing trace with hash 934914416, now seen corresponding path program 1 times [2020-10-21 23:01:47,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:47,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992061482] [2020-10-21 23:01:47,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:47,710 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-21 23:01:47,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992061482] [2020-10-21 23:01:47,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:47,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:01:47,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746628562] [2020-10-21 23:01:47,719 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:01:47,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:47,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:01:47,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:01:47,720 INFO L87 Difference]: Start difference. First operand 646 states and 1887 transitions. Second operand 4 states. [2020-10-21 23:01:47,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:47,773 INFO L93 Difference]: Finished difference Result 893 states and 2519 transitions. [2020-10-21 23:01:47,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:01:47,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-21 23:01:47,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:47,777 INFO L225 Difference]: With dead ends: 893 [2020-10-21 23:01:47,778 INFO L226 Difference]: Without dead ends: 581 [2020-10-21 23:01:47,779 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:01:47,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-10-21 23:01:47,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 579. [2020-10-21 23:01:47,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2020-10-21 23:01:47,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1541 transitions. [2020-10-21 23:01:47,797 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1541 transitions. Word has length 21 [2020-10-21 23:01:47,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:47,798 INFO L481 AbstractCegarLoop]: Abstraction has 579 states and 1541 transitions. [2020-10-21 23:01:47,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:01:47,798 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1541 transitions. [2020-10-21 23:01:47,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 23:01:47,800 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:47,800 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:47,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 23:01:47,800 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:47,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:47,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1821973568, now seen corresponding path program 2 times [2020-10-21 23:01:47,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:47,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191769896] [2020-10-21 23:01:47,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:48,017 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-21 23:01:48,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191769896] [2020-10-21 23:01:48,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:48,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:01:48,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704087259] [2020-10-21 23:01:48,019 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:01:48,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:48,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:01:48,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:01:48,020 INFO L87 Difference]: Start difference. First operand 579 states and 1541 transitions. Second operand 7 states. [2020-10-21 23:01:48,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:48,099 INFO L93 Difference]: Finished difference Result 554 states and 1491 transitions. [2020-10-21 23:01:48,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:01:48,100 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-21 23:01:48,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:48,101 INFO L225 Difference]: With dead ends: 554 [2020-10-21 23:01:48,101 INFO L226 Difference]: Without dead ends: 179 [2020-10-21 23:01:48,101 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:01:48,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-10-21 23:01:48,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2020-10-21 23:01:48,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-10-21 23:01:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 445 transitions. [2020-10-21 23:01:48,107 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 445 transitions. Word has length 21 [2020-10-21 23:01:48,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:48,107 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 445 transitions. [2020-10-21 23:01:48,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:01:48,107 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 445 transitions. [2020-10-21 23:01:48,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-21 23:01:48,108 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:48,108 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:48,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 23:01:48,109 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:48,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:48,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1627508946, now seen corresponding path program 1 times [2020-10-21 23:01:48,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:48,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572052473] [2020-10-21 23:01:48,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:48,394 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-21 23:01:48,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572052473] [2020-10-21 23:01:48,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:48,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:01:48,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352386461] [2020-10-21 23:01:48,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:01:48,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:48,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:01:48,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:01:48,396 INFO L87 Difference]: Start difference. First operand 179 states and 445 transitions. Second operand 8 states. [2020-10-21 23:01:48,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:48,593 INFO L93 Difference]: Finished difference Result 241 states and 589 transitions. [2020-10-21 23:01:48,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:01:48,594 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2020-10-21 23:01:48,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:48,595 INFO L225 Difference]: With dead ends: 241 [2020-10-21 23:01:48,595 INFO L226 Difference]: Without dead ends: 139 [2020-10-21 23:01:48,595 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:01:48,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-10-21 23:01:48,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2020-10-21 23:01:48,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-10-21 23:01:48,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 317 transitions. [2020-10-21 23:01:48,600 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 317 transitions. Word has length 25 [2020-10-21 23:01:48,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:48,601 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 317 transitions. [2020-10-21 23:01:48,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:01:48,601 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 317 transitions. [2020-10-21 23:01:48,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-21 23:01:48,602 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:48,602 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:48,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-21 23:01:48,602 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:48,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:48,603 INFO L82 PathProgramCache]: Analyzing trace with hash 91777140, now seen corresponding path program 2 times [2020-10-21 23:01:48,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:48,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795227495] [2020-10-21 23:01:48,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:01:48,640 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:01:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:01:48,675 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:01:48,714 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 23:01:48,714 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 23:01:48,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-21 23:01:48,716 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 23:01:48,737 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L847-->L854: Formula: (let ((.cse6 (= (mod ~z$r_buff0_thd0~0_In-516218185 256) 0)) (.cse7 (= (mod ~z$w_buff0_used~0_In-516218185 256) 0)) (.cse9 (= (mod ~z$r_buff1_thd0~0_In-516218185 256) 0)) (.cse8 (= (mod ~z$w_buff1_used~0_In-516218185 256) 0))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (or (and .cse0 (= ~z$w_buff1_used~0_Out-516218185 ~z$w_buff1_used~0_In-516218185)) (and .cse1 (= ~z$w_buff1_used~0_Out-516218185 0) .cse2)) (= ~z$r_buff1_thd0~0_In-516218185 ~z$r_buff1_thd0~0_Out-516218185) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-516218185 0)) (or (and .cse3 (or (and (= ~z$w_buff1~0_In-516218185 ~z~0_Out-516218185) .cse1 .cse2) (and .cse0 (= ~z~0_In-516218185 ~z~0_Out-516218185)))) (and .cse4 .cse5 (= ~z$w_buff0~0_In-516218185 ~z~0_Out-516218185))) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-516218185 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-516218185|) (= ~z$r_buff0_thd0~0_Out-516218185 ~z$r_buff0_thd0~0_In-516218185) (or (and .cse3 (= ~z$w_buff0_used~0_In-516218185 ~z$w_buff0_used~0_Out-516218185)) (and (= ~z$w_buff0_used~0_Out-516218185 0) .cse4 .cse5))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-516218185|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-516218185, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-516218185, ~z$w_buff0~0=~z$w_buff0~0_In-516218185, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-516218185, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-516218185, ~z$w_buff1~0=~z$w_buff1~0_In-516218185, ~z~0=~z~0_In-516218185} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-516218185, ~z$w_buff0~0=~z$w_buff0~0_In-516218185, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-516218185, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-516218185|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-516218185|, ~z$w_buff1~0=~z$w_buff1~0_In-516218185, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-516218185|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-516218185|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-516218185|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-516218185|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-516218185|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-516218185, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-516218185, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-516218185, ~z~0=~z~0_Out-516218185} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ~z~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-21 23:01:48,744 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-21 23:01:48,745 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [797] [2020-10-21 23:01:48,747 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-21 23:01:48,748 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:48,748 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-21 23:01:48,748 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:48,748 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-21 23:01:48,748 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:48,749 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-21 23:01:48,749 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:48,749 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-21 23:01:48,749 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:48,750 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-21 23:01:48,750 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:48,750 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-21 23:01:48,750 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:48,751 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-21 23:01:48,751 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:48,751 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-21 23:01:48,751 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:48,751 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-21 23:01:48,751 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:48,752 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-21 23:01:48,752 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:48,753 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-21 23:01:48,753 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:48,753 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-21 23:01:48,753 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:48,753 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-21 23:01:48,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:48,754 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-21 23:01:48,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:48,754 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-21 23:01:48,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:48,754 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-21 23:01:48,755 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:48,755 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-21 23:01:48,755 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:48,755 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-21 23:01:48,755 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:48,756 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-21 23:01:48,756 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:48,756 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-21 23:01:48,756 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:48,756 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-21 23:01:48,757 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:48,757 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-21 23:01:48,757 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:48,757 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-21 23:01:48,757 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:48,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 11:01:48 BasicIcfg [2020-10-21 23:01:48,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 23:01:48,840 INFO L168 Benchmark]: Toolchain (without parser) took 17623.00 ms. Allocated memory was 137.9 MB in the beginning and 392.7 MB in the end (delta: 254.8 MB). Free memory was 98.5 MB in the beginning and 195.2 MB in the end (delta: -96.6 MB). Peak memory consumption was 158.2 MB. Max. memory is 7.1 GB. [2020-10-21 23:01:48,841 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-21 23:01:48,841 INFO L168 Benchmark]: CACSL2BoogieTranslator took 931.62 ms. Allocated memory was 137.9 MB in the beginning and 204.5 MB in the end (delta: 66.6 MB). Free memory was 97.5 MB in the beginning and 154.8 MB in the end (delta: -57.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2020-10-21 23:01:48,842 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.90 ms. Allocated memory is still 204.5 MB. Free memory was 154.1 MB in the beginning and 151.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-21 23:01:48,843 INFO L168 Benchmark]: Boogie Preprocessor took 44.15 ms. Allocated memory is still 204.5 MB. Free memory was 151.3 MB in the beginning and 148.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-21 23:01:48,843 INFO L168 Benchmark]: RCFGBuilder took 2002.19 ms. Allocated memory was 204.5 MB in the beginning and 249.6 MB in the end (delta: 45.1 MB). Free memory was 148.5 MB in the beginning and 184.5 MB in the end (delta: -36.0 MB). Peak memory consumption was 100.9 MB. Max. memory is 7.1 GB. [2020-10-21 23:01:48,844 INFO L168 Benchmark]: TraceAbstraction took 14555.00 ms. Allocated memory was 249.6 MB in the beginning and 392.7 MB in the end (delta: 143.1 MB). Free memory was 184.5 MB in the beginning and 195.2 MB in the end (delta: -10.7 MB). Peak memory consumption was 132.5 MB. Max. memory is 7.1 GB. [2020-10-21 23:01:48,847 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 931.62 ms. Allocated memory was 137.9 MB in the beginning and 204.5 MB in the end (delta: 66.6 MB). Free memory was 97.5 MB in the beginning and 154.8 MB in the end (delta: -57.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.90 ms. Allocated memory is still 204.5 MB. Free memory was 154.1 MB in the beginning and 151.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.15 ms. Allocated memory is still 204.5 MB. Free memory was 151.3 MB in the beginning and 148.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2002.19 ms. Allocated memory was 204.5 MB in the beginning and 249.6 MB in the end (delta: 45.1 MB). Free memory was 148.5 MB in the beginning and 184.5 MB in the end (delta: -36.0 MB). Peak memory consumption was 100.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14555.00 ms. Allocated memory was 249.6 MB in the beginning and 392.7 MB in the end (delta: 143.1 MB). Free memory was 184.5 MB in the beginning and 195.2 MB in the end (delta: -10.7 MB). Peak memory consumption was 132.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1410 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 119 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.3s, 127 PlacesBefore, 44 PlacesAfterwards, 117 TransitionsBefore, 31 TransitionsAfterwards, 2622 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 105 TotalNumberOfCompositions, 6769 MoverChecksTotal - CounterExampleResult [Line: 17]: 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_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1485; [L837] FCALL, FORK 0 pthread_create(&t1485, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1486; [L839] FCALL, FORK 0 pthread_create(&t1486, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1487; [L841] FCALL, FORK 0 pthread_create(&t1487, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t1488; [L843] FCALL, FORK 0 pthread_create(&t1488, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L778] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L814] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L816] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L818] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 4 return 0; [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L860] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0 [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L861] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L865] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L865] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L866] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L866] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L866] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix055_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=50, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 115 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.2s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.5s, HoareTripleCheckerStatistics: 457 SDtfs, 466 SDslu, 757 SDs, 0 SdLazy, 344 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2602occurred 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.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 82 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 25173 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...