/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:56:18,827 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:56:18,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:56:18,848 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:56:18,848 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:56:18,850 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:56:18,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:56:18,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:56:18,862 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:56:18,863 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:56:18,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:56:18,865 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:56:18,865 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:56:18,866 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:56:18,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:56:18,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:56:18,869 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:56:18,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:56:18,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:56:18,874 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:56:18,875 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:56:18,876 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:56:18,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:56:18,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:56:18,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:56:18,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:56:18,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:56:18,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:56:18,884 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:56:18,885 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:56:18,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:56:18,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:56:18,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:56:18,890 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:56:18,893 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:56:18,893 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:56:18,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:56:18,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:56:18,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:56:18,896 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:56:18,897 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:56:18,898 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 20:56:18,925 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:56:18,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:56:18,926 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:56:18,926 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:56:18,927 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:56:18,927 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:56:18,927 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:56:18,927 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:56:18,927 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:56:18,927 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:56:18,929 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:56:18,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:56:18,929 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:56:18,929 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:56:18,929 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:56:18,931 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:56:18,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:56:18,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:56:18,931 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:56:18,932 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:56:18,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:56:18,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:56:18,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:56:18,932 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:56:18,932 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:56:18,934 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:56:18,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:56:18,934 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:56:18,934 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:56:18,935 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:56:18,935 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:56:18,935 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:56:19,249 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:56:19,267 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:56:19,270 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:56:19,272 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:56:19,272 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:56:19,273 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_pso.oepc.i [2019-12-27 20:56:19,350 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ce9c659/3f2b75d00bd7420ab9f6c5cbd16ab8f6/FLAGd63a6be60 [2019-12-27 20:56:19,822 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:56:19,822 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_pso.oepc.i [2019-12-27 20:56:19,846 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ce9c659/3f2b75d00bd7420ab9f6c5cbd16ab8f6/FLAGd63a6be60 [2019-12-27 20:56:20,175 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ce9c659/3f2b75d00bd7420ab9f6c5cbd16ab8f6 [2019-12-27 20:56:20,183 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:56:20,185 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:56:20,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:56:20,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:56:20,189 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:56:20,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:56:20" (1/1) ... [2019-12-27 20:56:20,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c1335d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:20, skipping insertion in model container [2019-12-27 20:56:20,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:56:20" (1/1) ... [2019-12-27 20:56:20,202 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:56:20,266 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:56:20,743 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:56:20,756 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:56:20,856 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:56:20,963 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:56:20,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:20 WrapperNode [2019-12-27 20:56:20,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:56:20,964 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:56:20,965 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:56:20,965 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:56:20,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:20" (1/1) ... [2019-12-27 20:56:20,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:20" (1/1) ... [2019-12-27 20:56:21,031 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:56:21,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:56:21,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:56:21,036 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:56:21,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:20" (1/1) ... [2019-12-27 20:56:21,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:20" (1/1) ... [2019-12-27 20:56:21,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:20" (1/1) ... [2019-12-27 20:56:21,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:20" (1/1) ... [2019-12-27 20:56:21,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:20" (1/1) ... [2019-12-27 20:56:21,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:20" (1/1) ... [2019-12-27 20:56:21,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:20" (1/1) ... [2019-12-27 20:56:21,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:56:21,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:56:21,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:56:21,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:56:21,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:56:21,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:56:21,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:56:21,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:56:21,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:56:21,189 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:56:21,189 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:56:21,190 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:56:21,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:56:21,191 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:56:21,191 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:56:21,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:56:21,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:56:21,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:56:21,193 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 20:56:22,025 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:56:22,025 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:56:22,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:56:22 BoogieIcfgContainer [2019-12-27 20:56:22,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:56:22,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:56:22,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:56:22,031 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:56:22,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:56:20" (1/3) ... [2019-12-27 20:56:22,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d10f371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:56:22, skipping insertion in model container [2019-12-27 20:56:22,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:20" (2/3) ... [2019-12-27 20:56:22,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d10f371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:56:22, skipping insertion in model container [2019-12-27 20:56:22,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:56:22" (3/3) ... [2019-12-27 20:56:22,035 INFO L109 eAbstractionObserver]: Analyzing ICFG mix033_pso.oepc.i [2019-12-27 20:56:22,046 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:56:22,046 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:56:22,055 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:56:22,056 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:56:22,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,100 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,115 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,116 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,117 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,117 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,124 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,124 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,132 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,132 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,159 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,161 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,169 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,169 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,170 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,175 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,175 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:22,197 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:56:22,217 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:56:22,217 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:56:22,217 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:56:22,217 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:56:22,217 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:56:22,218 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:56:22,218 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:56:22,218 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:56:22,235 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-27 20:56:22,238 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 20:56:22,341 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 20:56:22,342 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:56:22,359 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:56:22,388 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 20:56:22,443 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 20:56:22,443 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:56:22,452 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:56:22,474 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 20:56:22,475 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:56:26,080 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 20:56:26,219 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 20:56:26,305 INFO L206 etLargeBlockEncoding]: Checked pairs total: 81109 [2019-12-27 20:56:26,305 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-27 20:56:26,309 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 20:56:42,726 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 109594 states. [2019-12-27 20:56:42,728 INFO L276 IsEmpty]: Start isEmpty. Operand 109594 states. [2019-12-27 20:56:42,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:56:42,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:42,739 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:56:42,740 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:56:42,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:42,746 INFO L82 PathProgramCache]: Analyzing trace with hash 924702, now seen corresponding path program 1 times [2019-12-27 20:56:42,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:42,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228782677] [2019-12-27 20:56:42,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:43,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:56:43,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228782677] [2019-12-27 20:56:43,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:43,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:56:43,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [882240165] [2019-12-27 20:56:43,181 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:43,185 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:43,197 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:56:43,198 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:43,203 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:56:43,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:56:43,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:43,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:56:43,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:56:43,221 INFO L87 Difference]: Start difference. First operand 109594 states. Second operand 3 states. [2019-12-27 20:56:44,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:44,512 INFO L93 Difference]: Finished difference Result 108584 states and 463030 transitions. [2019-12-27 20:56:44,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:56:44,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:56:44,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:48,161 INFO L225 Difference]: With dead ends: 108584 [2019-12-27 20:56:48,162 INFO L226 Difference]: Without dead ends: 102344 [2019-12-27 20:56:48,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:56:52,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102344 states. [2019-12-27 20:56:54,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102344 to 102344. [2019-12-27 20:56:54,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102344 states. [2019-12-27 20:56:58,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102344 states to 102344 states and 435834 transitions. [2019-12-27 20:56:58,230 INFO L78 Accepts]: Start accepts. Automaton has 102344 states and 435834 transitions. Word has length 3 [2019-12-27 20:56:58,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:58,230 INFO L462 AbstractCegarLoop]: Abstraction has 102344 states and 435834 transitions. [2019-12-27 20:56:58,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:56:58,230 INFO L276 IsEmpty]: Start isEmpty. Operand 102344 states and 435834 transitions. [2019-12-27 20:56:58,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:56:58,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:58,233 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:56:58,234 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:56:58,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:58,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2092139601, now seen corresponding path program 1 times [2019-12-27 20:56:58,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:58,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327660732] [2019-12-27 20:56:58,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:56:58,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327660732] [2019-12-27 20:56:58,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:58,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:56:58,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [563136306] [2019-12-27 20:56:58,373 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:58,374 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:58,378 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:56:58,378 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:58,378 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:56:58,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:56:58,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:58,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:56:58,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:56:58,381 INFO L87 Difference]: Start difference. First operand 102344 states and 435834 transitions. Second operand 4 states. [2019-12-27 20:57:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:03,620 INFO L93 Difference]: Finished difference Result 162816 states and 664963 transitions. [2019-12-27 20:57:03,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:57:03,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 20:57:03,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:04,246 INFO L225 Difference]: With dead ends: 162816 [2019-12-27 20:57:04,246 INFO L226 Difference]: Without dead ends: 162767 [2019-12-27 20:57:04,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:57:09,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162767 states. [2019-12-27 20:57:12,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162767 to 148375. [2019-12-27 20:57:12,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148375 states. [2019-12-27 20:57:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148375 states to 148375 states and 613985 transitions. [2019-12-27 20:57:13,104 INFO L78 Accepts]: Start accepts. Automaton has 148375 states and 613985 transitions. Word has length 11 [2019-12-27 20:57:13,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:13,104 INFO L462 AbstractCegarLoop]: Abstraction has 148375 states and 613985 transitions. [2019-12-27 20:57:13,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:57:13,104 INFO L276 IsEmpty]: Start isEmpty. Operand 148375 states and 613985 transitions. [2019-12-27 20:57:13,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:57:13,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:13,112 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:13,112 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:13,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:13,112 INFO L82 PathProgramCache]: Analyzing trace with hash -2022218579, now seen corresponding path program 1 times [2019-12-27 20:57:13,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:13,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477841164] [2019-12-27 20:57:13,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:13,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:57:13,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477841164] [2019-12-27 20:57:13,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:13,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:57:13,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [622485673] [2019-12-27 20:57:13,233 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:13,234 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:13,236 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:57:13,236 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:13,236 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:57:13,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:57:13,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:13,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:57:13,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:57:13,237 INFO L87 Difference]: Start difference. First operand 148375 states and 613985 transitions. Second operand 4 states. [2019-12-27 20:57:13,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:13,458 INFO L93 Difference]: Finished difference Result 43572 states and 149282 transitions. [2019-12-27 20:57:13,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:57:13,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 20:57:13,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:13,551 INFO L225 Difference]: With dead ends: 43572 [2019-12-27 20:57:13,552 INFO L226 Difference]: Without dead ends: 33443 [2019-12-27 20:57:13,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:57:18,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33443 states. [2019-12-27 20:57:18,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33443 to 33355. [2019-12-27 20:57:18,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33355 states. [2019-12-27 20:57:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33355 states to 33355 states and 108544 transitions. [2019-12-27 20:57:18,953 INFO L78 Accepts]: Start accepts. Automaton has 33355 states and 108544 transitions. Word has length 13 [2019-12-27 20:57:18,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:18,954 INFO L462 AbstractCegarLoop]: Abstraction has 33355 states and 108544 transitions. [2019-12-27 20:57:18,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:57:18,954 INFO L276 IsEmpty]: Start isEmpty. Operand 33355 states and 108544 transitions. [2019-12-27 20:57:18,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:57:18,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:18,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:18,957 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:18,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:18,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1339747598, now seen corresponding path program 1 times [2019-12-27 20:57:18,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:18,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085656182] [2019-12-27 20:57:18,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:57:19,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085656182] [2019-12-27 20:57:19,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:19,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:57:19,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [370904658] [2019-12-27 20:57:19,017 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:19,019 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:19,021 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 20:57:19,021 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:19,022 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:57:19,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:57:19,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:19,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:57:19,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:57:19,023 INFO L87 Difference]: Start difference. First operand 33355 states and 108544 transitions. Second operand 3 states. [2019-12-27 20:57:19,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:19,229 INFO L93 Difference]: Finished difference Result 51737 states and 165591 transitions. [2019-12-27 20:57:19,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:57:19,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 20:57:19,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:19,323 INFO L225 Difference]: With dead ends: 51737 [2019-12-27 20:57:19,324 INFO L226 Difference]: Without dead ends: 51737 [2019-12-27 20:57:19,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:57:19,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51737 states. [2019-12-27 20:57:20,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51737 to 36950. [2019-12-27 20:57:20,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36950 states. [2019-12-27 20:57:20,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36950 states to 36950 states and 119471 transitions. [2019-12-27 20:57:20,320 INFO L78 Accepts]: Start accepts. Automaton has 36950 states and 119471 transitions. Word has length 16 [2019-12-27 20:57:20,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:20,320 INFO L462 AbstractCegarLoop]: Abstraction has 36950 states and 119471 transitions. [2019-12-27 20:57:20,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:57:20,321 INFO L276 IsEmpty]: Start isEmpty. Operand 36950 states and 119471 transitions. [2019-12-27 20:57:20,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:57:20,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:20,324 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:20,324 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:20,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:20,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1474909365, now seen corresponding path program 1 times [2019-12-27 20:57:20,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:20,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874284636] [2019-12-27 20:57:20,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:20,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:57:20,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874284636] [2019-12-27 20:57:20,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:20,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:57:20,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [687798657] [2019-12-27 20:57:20,406 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:20,407 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:20,409 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 20:57:20,409 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:20,410 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:57:20,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:57:20,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:20,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:57:20,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:57:20,411 INFO L87 Difference]: Start difference. First operand 36950 states and 119471 transitions. Second operand 4 states. [2019-12-27 20:57:20,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:20,842 INFO L93 Difference]: Finished difference Result 43903 states and 140292 transitions. [2019-12-27 20:57:20,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:57:20,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 20:57:20,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:20,924 INFO L225 Difference]: With dead ends: 43903 [2019-12-27 20:57:20,924 INFO L226 Difference]: Without dead ends: 43903 [2019-12-27 20:57:20,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:57:21,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43903 states. [2019-12-27 20:57:21,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43903 to 40323. [2019-12-27 20:57:21,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40323 states. [2019-12-27 20:57:22,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40323 states to 40323 states and 129667 transitions. [2019-12-27 20:57:22,119 INFO L78 Accepts]: Start accepts. Automaton has 40323 states and 129667 transitions. Word has length 16 [2019-12-27 20:57:22,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:22,119 INFO L462 AbstractCegarLoop]: Abstraction has 40323 states and 129667 transitions. [2019-12-27 20:57:22,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:57:22,119 INFO L276 IsEmpty]: Start isEmpty. Operand 40323 states and 129667 transitions. [2019-12-27 20:57:22,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:57:22,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:22,123 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:22,123 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:22,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:22,123 INFO L82 PathProgramCache]: Analyzing trace with hash 477780194, now seen corresponding path program 1 times [2019-12-27 20:57:22,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:22,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413604527] [2019-12-27 20:57:22,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:22,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:57:22,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413604527] [2019-12-27 20:57:22,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:22,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:57:22,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1718223543] [2019-12-27 20:57:22,227 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:22,229 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:22,232 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 20:57:22,232 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:22,232 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:57:22,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:57:22,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:22,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:57:22,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:57:22,234 INFO L87 Difference]: Start difference. First operand 40323 states and 129667 transitions. Second operand 4 states. [2019-12-27 20:57:22,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:22,607 INFO L93 Difference]: Finished difference Result 47198 states and 150559 transitions. [2019-12-27 20:57:22,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:57:22,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 20:57:22,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:22,679 INFO L225 Difference]: With dead ends: 47198 [2019-12-27 20:57:22,679 INFO L226 Difference]: Without dead ends: 47198 [2019-12-27 20:57:22,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:57:22,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47198 states. [2019-12-27 20:57:23,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47198 to 41372. [2019-12-27 20:57:23,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41372 states. [2019-12-27 20:57:23,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41372 states to 41372 states and 132846 transitions. [2019-12-27 20:57:23,369 INFO L78 Accepts]: Start accepts. Automaton has 41372 states and 132846 transitions. Word has length 16 [2019-12-27 20:57:23,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:23,369 INFO L462 AbstractCegarLoop]: Abstraction has 41372 states and 132846 transitions. [2019-12-27 20:57:23,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:57:23,369 INFO L276 IsEmpty]: Start isEmpty. Operand 41372 states and 132846 transitions. [2019-12-27 20:57:23,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:57:23,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:23,377 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:23,377 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:23,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:23,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1115521539, now seen corresponding path program 1 times [2019-12-27 20:57:23,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:23,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183345443] [2019-12-27 20:57:23,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:23,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:57:23,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183345443] [2019-12-27 20:57:23,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:23,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:57:23,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1703901743] [2019-12-27 20:57:23,471 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:23,474 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:23,481 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 66 transitions. [2019-12-27 20:57:23,481 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:23,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:57:23,524 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:57:23,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:57:23,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:23,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:57:23,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:57:23,526 INFO L87 Difference]: Start difference. First operand 41372 states and 132846 transitions. Second operand 8 states. [2019-12-27 20:57:25,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:25,545 INFO L93 Difference]: Finished difference Result 87314 states and 277765 transitions. [2019-12-27 20:57:25,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 20:57:25,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-27 20:57:25,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:25,692 INFO L225 Difference]: With dead ends: 87314 [2019-12-27 20:57:25,692 INFO L226 Difference]: Without dead ends: 87258 [2019-12-27 20:57:25,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-12-27 20:57:25,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87258 states. [2019-12-27 20:57:27,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87258 to 50078. [2019-12-27 20:57:27,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50078 states. [2019-12-27 20:57:27,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50078 states to 50078 states and 163358 transitions. [2019-12-27 20:57:27,336 INFO L78 Accepts]: Start accepts. Automaton has 50078 states and 163358 transitions. Word has length 22 [2019-12-27 20:57:27,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:27,337 INFO L462 AbstractCegarLoop]: Abstraction has 50078 states and 163358 transitions. [2019-12-27 20:57:27,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:57:27,337 INFO L276 IsEmpty]: Start isEmpty. Operand 50078 states and 163358 transitions. [2019-12-27 20:57:27,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:57:27,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:27,348 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:27,348 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:27,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:27,348 INFO L82 PathProgramCache]: Analyzing trace with hash -715535694, now seen corresponding path program 1 times [2019-12-27 20:57:27,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:27,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20807585] [2019-12-27 20:57:27,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:57:27,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20807585] [2019-12-27 20:57:27,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:27,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:57:27,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1278336533] [2019-12-27 20:57:27,433 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:27,436 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:27,444 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 58 transitions. [2019-12-27 20:57:27,444 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:27,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:57:27,460 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:57:27,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:57:27,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:27,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:57:27,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:57:27,461 INFO L87 Difference]: Start difference. First operand 50078 states and 163358 transitions. Second operand 7 states. [2019-12-27 20:57:28,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:28,765 INFO L93 Difference]: Finished difference Result 69317 states and 220653 transitions. [2019-12-27 20:57:28,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:57:28,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 20:57:28,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:28,877 INFO L225 Difference]: With dead ends: 69317 [2019-12-27 20:57:28,877 INFO L226 Difference]: Without dead ends: 69261 [2019-12-27 20:57:28,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:57:29,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69261 states. [2019-12-27 20:57:30,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69261 to 48389. [2019-12-27 20:57:30,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48389 states. [2019-12-27 20:57:30,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48389 states to 48389 states and 157860 transitions. [2019-12-27 20:57:30,326 INFO L78 Accepts]: Start accepts. Automaton has 48389 states and 157860 transitions. Word has length 22 [2019-12-27 20:57:30,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:30,326 INFO L462 AbstractCegarLoop]: Abstraction has 48389 states and 157860 transitions. [2019-12-27 20:57:30,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:57:30,327 INFO L276 IsEmpty]: Start isEmpty. Operand 48389 states and 157860 transitions. [2019-12-27 20:57:30,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:57:30,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:30,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:30,339 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:30,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:30,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1999797124, now seen corresponding path program 1 times [2019-12-27 20:57:30,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:30,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341144756] [2019-12-27 20:57:30,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:30,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:57:30,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341144756] [2019-12-27 20:57:30,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:30,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:57:30,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2024709278] [2019-12-27 20:57:30,413 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:30,417 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:30,429 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 20:57:30,430 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:30,470 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:57:30,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:57:30,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:30,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:57:30,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:57:30,472 INFO L87 Difference]: Start difference. First operand 48389 states and 157860 transitions. Second operand 6 states. [2019-12-27 20:57:30,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:30,609 INFO L93 Difference]: Finished difference Result 21931 states and 67920 transitions. [2019-12-27 20:57:30,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:57:30,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 20:57:30,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:30,636 INFO L225 Difference]: With dead ends: 21931 [2019-12-27 20:57:30,637 INFO L226 Difference]: Without dead ends: 19223 [2019-12-27 20:57:30,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:57:30,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19223 states. [2019-12-27 20:57:30,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19223 to 18792. [2019-12-27 20:57:30,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18792 states. [2019-12-27 20:57:30,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18792 states to 18792 states and 58219 transitions. [2019-12-27 20:57:30,903 INFO L78 Accepts]: Start accepts. Automaton has 18792 states and 58219 transitions. Word has length 25 [2019-12-27 20:57:30,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:30,904 INFO L462 AbstractCegarLoop]: Abstraction has 18792 states and 58219 transitions. [2019-12-27 20:57:30,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:57:30,904 INFO L276 IsEmpty]: Start isEmpty. Operand 18792 states and 58219 transitions. [2019-12-27 20:57:30,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:57:30,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:30,920 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:30,920 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:30,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:30,920 INFO L82 PathProgramCache]: Analyzing trace with hash 618087589, now seen corresponding path program 1 times [2019-12-27 20:57:30,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:30,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933049995] [2019-12-27 20:57:30,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:31,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:57:31,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933049995] [2019-12-27 20:57:31,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:31,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:57:31,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [404238086] [2019-12-27 20:57:31,019 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:31,024 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:31,029 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 20:57:31,029 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:31,030 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:57:31,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:57:31,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:31,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:57:31,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:57:31,031 INFO L87 Difference]: Start difference. First operand 18792 states and 58219 transitions. Second operand 5 states. [2019-12-27 20:57:31,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:31,428 INFO L93 Difference]: Finished difference Result 23338 states and 70899 transitions. [2019-12-27 20:57:31,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:57:31,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 20:57:31,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:31,479 INFO L225 Difference]: With dead ends: 23338 [2019-12-27 20:57:31,480 INFO L226 Difference]: Without dead ends: 23183 [2019-12-27 20:57:31,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:57:31,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23183 states. [2019-12-27 20:57:31,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23183 to 21909. [2019-12-27 20:57:31,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21909 states. [2019-12-27 20:57:31,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21909 states to 21909 states and 67276 transitions. [2019-12-27 20:57:31,824 INFO L78 Accepts]: Start accepts. Automaton has 21909 states and 67276 transitions. Word has length 27 [2019-12-27 20:57:31,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:31,824 INFO L462 AbstractCegarLoop]: Abstraction has 21909 states and 67276 transitions. [2019-12-27 20:57:31,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:57:31,825 INFO L276 IsEmpty]: Start isEmpty. Operand 21909 states and 67276 transitions. [2019-12-27 20:57:31,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:57:31,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:31,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:31,841 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:31,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:31,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1155661138, now seen corresponding path program 1 times [2019-12-27 20:57:31,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:31,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84740904] [2019-12-27 20:57:31,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:31,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:57:31,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84740904] [2019-12-27 20:57:31,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:31,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:57:31,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [846168264] [2019-12-27 20:57:31,878 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:31,882 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:31,888 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 20:57:31,888 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:31,889 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:57:31,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:57:31,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:31,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:57:31,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:57:31,891 INFO L87 Difference]: Start difference. First operand 21909 states and 67276 transitions. Second operand 3 states. [2019-12-27 20:57:32,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:32,010 INFO L93 Difference]: Finished difference Result 26678 states and 79334 transitions. [2019-12-27 20:57:32,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:57:32,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 20:57:32,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:32,046 INFO L225 Difference]: With dead ends: 26678 [2019-12-27 20:57:32,046 INFO L226 Difference]: Without dead ends: 26678 [2019-12-27 20:57:32,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:57:32,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26678 states. [2019-12-27 20:57:32,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26678 to 19881. [2019-12-27 20:57:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19881 states. [2019-12-27 20:57:32,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19881 states to 19881 states and 59110 transitions. [2019-12-27 20:57:32,615 INFO L78 Accepts]: Start accepts. Automaton has 19881 states and 59110 transitions. Word has length 27 [2019-12-27 20:57:32,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:32,615 INFO L462 AbstractCegarLoop]: Abstraction has 19881 states and 59110 transitions. [2019-12-27 20:57:32,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:57:32,615 INFO L276 IsEmpty]: Start isEmpty. Operand 19881 states and 59110 transitions. [2019-12-27 20:57:32,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:57:32,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:32,630 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:32,630 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:32,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:32,631 INFO L82 PathProgramCache]: Analyzing trace with hash 176992031, now seen corresponding path program 1 times [2019-12-27 20:57:32,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:32,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577572584] [2019-12-27 20:57:32,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:32,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:57:32,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577572584] [2019-12-27 20:57:32,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:32,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:57:32,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [519559451] [2019-12-27 20:57:32,717 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:32,722 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:32,730 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 20:57:32,730 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:32,730 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:57:32,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:57:32,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:32,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:57:32,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:57:32,731 INFO L87 Difference]: Start difference. First operand 19881 states and 59110 transitions. Second operand 5 states. [2019-12-27 20:57:33,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:33,080 INFO L93 Difference]: Finished difference Result 23231 states and 68087 transitions. [2019-12-27 20:57:33,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:57:33,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 20:57:33,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:33,111 INFO L225 Difference]: With dead ends: 23231 [2019-12-27 20:57:33,111 INFO L226 Difference]: Without dead ends: 23069 [2019-12-27 20:57:33,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:57:33,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23069 states. [2019-12-27 20:57:33,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23069 to 19413. [2019-12-27 20:57:33,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19413 states. [2019-12-27 20:57:33,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19413 states to 19413 states and 57493 transitions. [2019-12-27 20:57:33,396 INFO L78 Accepts]: Start accepts. Automaton has 19413 states and 57493 transitions. Word has length 28 [2019-12-27 20:57:33,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:33,396 INFO L462 AbstractCegarLoop]: Abstraction has 19413 states and 57493 transitions. [2019-12-27 20:57:33,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:57:33,397 INFO L276 IsEmpty]: Start isEmpty. Operand 19413 states and 57493 transitions. [2019-12-27 20:57:33,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 20:57:33,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:33,418 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:33,418 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:33,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:33,418 INFO L82 PathProgramCache]: Analyzing trace with hash -154136683, now seen corresponding path program 1 times [2019-12-27 20:57:33,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:33,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388178483] [2019-12-27 20:57:33,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:33,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:57:33,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388178483] [2019-12-27 20:57:33,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:33,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:57:33,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1090865364] [2019-12-27 20:57:33,524 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:33,530 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:33,545 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 74 transitions. [2019-12-27 20:57:33,545 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:33,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:57:33,578 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 20:57:33,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:57:33,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:33,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:57:33,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:57:33,579 INFO L87 Difference]: Start difference. First operand 19413 states and 57493 transitions. Second operand 7 states. [2019-12-27 20:57:34,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:34,311 INFO L93 Difference]: Finished difference Result 24650 states and 72073 transitions. [2019-12-27 20:57:34,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:57:34,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 20:57:34,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:34,344 INFO L225 Difference]: With dead ends: 24650 [2019-12-27 20:57:34,344 INFO L226 Difference]: Without dead ends: 24472 [2019-12-27 20:57:34,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:57:34,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24472 states. [2019-12-27 20:57:34,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24472 to 20077. [2019-12-27 20:57:34,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20077 states. [2019-12-27 20:57:34,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20077 states to 20077 states and 59472 transitions. [2019-12-27 20:57:34,643 INFO L78 Accepts]: Start accepts. Automaton has 20077 states and 59472 transitions. Word has length 33 [2019-12-27 20:57:34,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:34,643 INFO L462 AbstractCegarLoop]: Abstraction has 20077 states and 59472 transitions. [2019-12-27 20:57:34,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:57:34,643 INFO L276 IsEmpty]: Start isEmpty. Operand 20077 states and 59472 transitions. [2019-12-27 20:57:34,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 20:57:34,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:34,661 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:34,661 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:34,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:34,661 INFO L82 PathProgramCache]: Analyzing trace with hash 565784243, now seen corresponding path program 2 times [2019-12-27 20:57:34,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:34,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638570262] [2019-12-27 20:57:34,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:34,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:57:34,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638570262] [2019-12-27 20:57:34,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:34,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:57:34,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2085627512] [2019-12-27 20:57:34,823 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:34,828 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:34,842 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 56 states and 77 transitions. [2019-12-27 20:57:34,842 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:34,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:57:34,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:57:34,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:57:34,893 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:57:34,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:57:34,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:34,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:57:34,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:57:34,894 INFO L87 Difference]: Start difference. First operand 20077 states and 59472 transitions. Second operand 9 states. [2019-12-27 20:57:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:37,146 INFO L93 Difference]: Finished difference Result 32876 states and 97128 transitions. [2019-12-27 20:57:37,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 20:57:37,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 20:57:37,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:37,190 INFO L225 Difference]: With dead ends: 32876 [2019-12-27 20:57:37,190 INFO L226 Difference]: Without dead ends: 32566 [2019-12-27 20:57:37,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2019-12-27 20:57:37,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32566 states. [2019-12-27 20:57:37,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32566 to 20527. [2019-12-27 20:57:37,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20527 states. [2019-12-27 20:57:37,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20527 states to 20527 states and 60851 transitions. [2019-12-27 20:57:37,552 INFO L78 Accepts]: Start accepts. Automaton has 20527 states and 60851 transitions. Word has length 33 [2019-12-27 20:57:37,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:37,553 INFO L462 AbstractCegarLoop]: Abstraction has 20527 states and 60851 transitions. [2019-12-27 20:57:37,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:57:37,553 INFO L276 IsEmpty]: Start isEmpty. Operand 20527 states and 60851 transitions. [2019-12-27 20:57:37,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 20:57:37,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:37,575 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:37,575 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:37,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:37,575 INFO L82 PathProgramCache]: Analyzing trace with hash 222292207, now seen corresponding path program 1 times [2019-12-27 20:57:37,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:37,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530170206] [2019-12-27 20:57:37,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:37,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:57:37,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530170206] [2019-12-27 20:57:37,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:37,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:57:37,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [612851986] [2019-12-27 20:57:37,685 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:37,692 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:37,707 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 70 transitions. [2019-12-27 20:57:37,708 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:37,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:57:37,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:57:37,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:57:37,734 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:57:37,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:57:37,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:37,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:57:37,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:57:37,735 INFO L87 Difference]: Start difference. First operand 20527 states and 60851 transitions. Second operand 8 states. [2019-12-27 20:57:39,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:39,427 INFO L93 Difference]: Finished difference Result 25736 states and 75295 transitions. [2019-12-27 20:57:39,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 20:57:39,428 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 20:57:39,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:39,462 INFO L225 Difference]: With dead ends: 25736 [2019-12-27 20:57:39,462 INFO L226 Difference]: Without dead ends: 25361 [2019-12-27 20:57:39,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 20:57:39,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25361 states. [2019-12-27 20:57:39,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25361 to 17194. [2019-12-27 20:57:39,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17194 states. [2019-12-27 20:57:39,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17194 states to 17194 states and 51115 transitions. [2019-12-27 20:57:39,743 INFO L78 Accepts]: Start accepts. Automaton has 17194 states and 51115 transitions. Word has length 34 [2019-12-27 20:57:39,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:39,743 INFO L462 AbstractCegarLoop]: Abstraction has 17194 states and 51115 transitions. [2019-12-27 20:57:39,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:57:39,743 INFO L276 IsEmpty]: Start isEmpty. Operand 17194 states and 51115 transitions. [2019-12-27 20:57:39,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:57:39,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:39,965 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:39,965 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:39,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:39,965 INFO L82 PathProgramCache]: Analyzing trace with hash 237559959, now seen corresponding path program 1 times [2019-12-27 20:57:39,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:39,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783352604] [2019-12-27 20:57:39,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:40,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:57:40,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783352604] [2019-12-27 20:57:40,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:40,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:57:40,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1106878624] [2019-12-27 20:57:40,021 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:40,031 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:40,097 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 375 transitions. [2019-12-27 20:57:40,097 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:40,100 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:57:40,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:57:40,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:40,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:57:40,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:57:40,101 INFO L87 Difference]: Start difference. First operand 17194 states and 51115 transitions. Second operand 3 states. [2019-12-27 20:57:40,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:40,221 INFO L93 Difference]: Finished difference Result 31612 states and 93911 transitions. [2019-12-27 20:57:40,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:57:40,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 20:57:40,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:40,252 INFO L225 Difference]: With dead ends: 31612 [2019-12-27 20:57:40,252 INFO L226 Difference]: Without dead ends: 17204 [2019-12-27 20:57:40,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:57:40,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17204 states. [2019-12-27 20:57:40,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17204 to 17115. [2019-12-27 20:57:40,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17115 states. [2019-12-27 20:57:40,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17115 states to 17115 states and 49716 transitions. [2019-12-27 20:57:40,609 INFO L78 Accepts]: Start accepts. Automaton has 17115 states and 49716 transitions. Word has length 39 [2019-12-27 20:57:40,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:40,609 INFO L462 AbstractCegarLoop]: Abstraction has 17115 states and 49716 transitions. [2019-12-27 20:57:40,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:57:40,610 INFO L276 IsEmpty]: Start isEmpty. Operand 17115 states and 49716 transitions. [2019-12-27 20:57:40,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:57:40,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:40,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:40,638 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:40,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:40,638 INFO L82 PathProgramCache]: Analyzing trace with hash -609570297, now seen corresponding path program 2 times [2019-12-27 20:57:40,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:40,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867779862] [2019-12-27 20:57:40,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:40,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:57:40,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867779862] [2019-12-27 20:57:40,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:40,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:57:40,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1789918884] [2019-12-27 20:57:40,714 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:40,722 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:40,794 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 378 transitions. [2019-12-27 20:57:40,794 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:40,797 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:57:40,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:57:40,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:40,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:57:40,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:57:40,798 INFO L87 Difference]: Start difference. First operand 17115 states and 49716 transitions. Second operand 3 states. [2019-12-27 20:57:40,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:40,870 INFO L93 Difference]: Finished difference Result 17114 states and 49714 transitions. [2019-12-27 20:57:40,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:57:40,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 20:57:40,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:40,898 INFO L225 Difference]: With dead ends: 17114 [2019-12-27 20:57:40,899 INFO L226 Difference]: Without dead ends: 17114 [2019-12-27 20:57:40,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:57:40,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17114 states. [2019-12-27 20:57:41,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17114 to 17114. [2019-12-27 20:57:41,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17114 states. [2019-12-27 20:57:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17114 states to 17114 states and 49714 transitions. [2019-12-27 20:57:41,209 INFO L78 Accepts]: Start accepts. Automaton has 17114 states and 49714 transitions. Word has length 39 [2019-12-27 20:57:41,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:41,210 INFO L462 AbstractCegarLoop]: Abstraction has 17114 states and 49714 transitions. [2019-12-27 20:57:41,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:57:41,210 INFO L276 IsEmpty]: Start isEmpty. Operand 17114 states and 49714 transitions. [2019-12-27 20:57:41,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:57:41,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:41,225 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:41,225 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:41,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:41,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1519522478, now seen corresponding path program 1 times [2019-12-27 20:57:41,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:41,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338203979] [2019-12-27 20:57:41,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:41,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:57:41,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338203979] [2019-12-27 20:57:41,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:41,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:57:41,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [709380481] [2019-12-27 20:57:41,332 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:41,340 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:41,424 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 216 states and 448 transitions. [2019-12-27 20:57:41,424 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:41,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:57:41,607 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 20:57:41,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:57:41,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:41,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:57:41,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:57:41,610 INFO L87 Difference]: Start difference. First operand 17114 states and 49714 transitions. Second operand 12 states. [2019-12-27 20:57:45,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:45,957 INFO L93 Difference]: Finished difference Result 33916 states and 97925 transitions. [2019-12-27 20:57:45,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 20:57:45,958 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2019-12-27 20:57:45,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:46,006 INFO L225 Difference]: With dead ends: 33916 [2019-12-27 20:57:46,006 INFO L226 Difference]: Without dead ends: 33916 [2019-12-27 20:57:46,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2019-12-27 20:57:46,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33916 states. [2019-12-27 20:57:46,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33916 to 24441. [2019-12-27 20:57:46,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24441 states. [2019-12-27 20:57:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24441 states to 24441 states and 71278 transitions. [2019-12-27 20:57:46,396 INFO L78 Accepts]: Start accepts. Automaton has 24441 states and 71278 transitions. Word has length 40 [2019-12-27 20:57:46,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:46,396 INFO L462 AbstractCegarLoop]: Abstraction has 24441 states and 71278 transitions. [2019-12-27 20:57:46,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:57:46,396 INFO L276 IsEmpty]: Start isEmpty. Operand 24441 states and 71278 transitions. [2019-12-27 20:57:46,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:57:46,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:46,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:46,421 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:46,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:46,421 INFO L82 PathProgramCache]: Analyzing trace with hash -127696118, now seen corresponding path program 1 times [2019-12-27 20:57:46,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:46,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478304655] [2019-12-27 20:57:46,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:46,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:57:46,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478304655] [2019-12-27 20:57:46,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:46,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:57:46,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1233895444] [2019-12-27 20:57:46,487 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:46,495 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:46,584 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 218 states and 450 transitions. [2019-12-27 20:57:46,584 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:46,596 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:57:46,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:57:46,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:46,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:57:46,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:57:46,597 INFO L87 Difference]: Start difference. First operand 24441 states and 71278 transitions. Second operand 4 states. [2019-12-27 20:57:46,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:46,869 INFO L93 Difference]: Finished difference Result 27258 states and 77512 transitions. [2019-12-27 20:57:46,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:57:46,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-27 20:57:46,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:46,903 INFO L225 Difference]: With dead ends: 27258 [2019-12-27 20:57:46,904 INFO L226 Difference]: Without dead ends: 27258 [2019-12-27 20:57:46,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:57:46,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27258 states. [2019-12-27 20:57:47,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27258 to 19800. [2019-12-27 20:57:47,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19800 states. [2019-12-27 20:57:47,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19800 states to 19800 states and 56775 transitions. [2019-12-27 20:57:47,213 INFO L78 Accepts]: Start accepts. Automaton has 19800 states and 56775 transitions. Word has length 41 [2019-12-27 20:57:47,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:47,213 INFO L462 AbstractCegarLoop]: Abstraction has 19800 states and 56775 transitions. [2019-12-27 20:57:47,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:57:47,213 INFO L276 IsEmpty]: Start isEmpty. Operand 19800 states and 56775 transitions. [2019-12-27 20:57:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:57:47,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:47,231 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:47,231 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:47,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:47,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1511845889, now seen corresponding path program 1 times [2019-12-27 20:57:47,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:47,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428008055] [2019-12-27 20:57:47,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:57:47,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428008055] [2019-12-27 20:57:47,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:47,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:57:47,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1775728799] [2019-12-27 20:57:47,287 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:47,296 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:47,371 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 180 states and 353 transitions. [2019-12-27 20:57:47,371 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:47,373 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:57:47,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:57:47,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:47,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:57:47,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:57:47,374 INFO L87 Difference]: Start difference. First operand 19800 states and 56775 transitions. Second operand 3 states. [2019-12-27 20:57:47,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:47,441 INFO L93 Difference]: Finished difference Result 19718 states and 56527 transitions. [2019-12-27 20:57:47,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:57:47,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 20:57:47,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:47,467 INFO L225 Difference]: With dead ends: 19718 [2019-12-27 20:57:47,467 INFO L226 Difference]: Without dead ends: 19718 [2019-12-27 20:57:47,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:57:47,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19718 states. [2019-12-27 20:57:47,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19718 to 15159. [2019-12-27 20:57:47,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15159 states. [2019-12-27 20:57:47,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15159 states to 15159 states and 43944 transitions. [2019-12-27 20:57:47,944 INFO L78 Accepts]: Start accepts. Automaton has 15159 states and 43944 transitions. Word has length 41 [2019-12-27 20:57:47,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:47,944 INFO L462 AbstractCegarLoop]: Abstraction has 15159 states and 43944 transitions. [2019-12-27 20:57:47,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:57:47,944 INFO L276 IsEmpty]: Start isEmpty. Operand 15159 states and 43944 transitions. [2019-12-27 20:57:47,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 20:57:47,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:47,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:47,959 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:47,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:47,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1374768089, now seen corresponding path program 1 times [2019-12-27 20:57:47,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:47,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082929735] [2019-12-27 20:57:47,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:48,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:57:48,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082929735] [2019-12-27 20:57:48,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:48,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:57:48,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [982753692] [2019-12-27 20:57:48,055 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:48,063 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:48,153 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 218 states and 457 transitions. [2019-12-27 20:57:48,153 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:48,176 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:57:48,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:57:48,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:48,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:57:48,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:57:48,177 INFO L87 Difference]: Start difference. First operand 15159 states and 43944 transitions. Second operand 7 states. [2019-12-27 20:57:48,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:48,281 INFO L93 Difference]: Finished difference Result 14187 states and 41869 transitions. [2019-12-27 20:57:48,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:57:48,281 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-27 20:57:48,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:48,302 INFO L225 Difference]: With dead ends: 14187 [2019-12-27 20:57:48,302 INFO L226 Difference]: Without dead ends: 12684 [2019-12-27 20:57:48,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:57:48,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12684 states. [2019-12-27 20:57:48,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12684 to 12684. [2019-12-27 20:57:48,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12684 states. [2019-12-27 20:57:48,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12684 states to 12684 states and 38259 transitions. [2019-12-27 20:57:48,490 INFO L78 Accepts]: Start accepts. Automaton has 12684 states and 38259 transitions. Word has length 42 [2019-12-27 20:57:48,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:48,490 INFO L462 AbstractCegarLoop]: Abstraction has 12684 states and 38259 transitions. [2019-12-27 20:57:48,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:57:48,490 INFO L276 IsEmpty]: Start isEmpty. Operand 12684 states and 38259 transitions. [2019-12-27 20:57:48,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:57:48,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:48,504 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:48,505 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:48,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:48,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1357444635, now seen corresponding path program 1 times [2019-12-27 20:57:48,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:48,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991262798] [2019-12-27 20:57:48,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:57:48,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991262798] [2019-12-27 20:57:48,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:48,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:57:48,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [387690557] [2019-12-27 20:57:48,591 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:48,612 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:48,937 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 275 states and 548 transitions. [2019-12-27 20:57:48,937 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:49,074 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 20:57:49,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:57:49,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:49,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:57:49,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:57:49,075 INFO L87 Difference]: Start difference. First operand 12684 states and 38259 transitions. Second operand 8 states. [2019-12-27 20:57:50,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:50,104 INFO L93 Difference]: Finished difference Result 18405 states and 54537 transitions. [2019-12-27 20:57:50,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 20:57:50,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 20:57:50,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:50,129 INFO L225 Difference]: With dead ends: 18405 [2019-12-27 20:57:50,129 INFO L226 Difference]: Without dead ends: 18405 [2019-12-27 20:57:50,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:57:50,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18405 states. [2019-12-27 20:57:50,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18405 to 13891. [2019-12-27 20:57:50,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13891 states. [2019-12-27 20:57:50,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13891 states to 13891 states and 41772 transitions. [2019-12-27 20:57:50,363 INFO L78 Accepts]: Start accepts. Automaton has 13891 states and 41772 transitions. Word has length 66 [2019-12-27 20:57:50,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:50,363 INFO L462 AbstractCegarLoop]: Abstraction has 13891 states and 41772 transitions. [2019-12-27 20:57:50,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:57:50,363 INFO L276 IsEmpty]: Start isEmpty. Operand 13891 states and 41772 transitions. [2019-12-27 20:57:50,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:57:50,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:50,377 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:50,377 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:50,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:50,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1897468067, now seen corresponding path program 2 times [2019-12-27 20:57:50,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:50,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969117948] [2019-12-27 20:57:50,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:50,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:57:50,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969117948] [2019-12-27 20:57:50,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:50,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:57:50,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1499280227] [2019-12-27 20:57:50,523 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:50,544 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:51,020 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 301 states and 597 transitions. [2019-12-27 20:57:51,021 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:51,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:57:51,269 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 20:57:51,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 20:57:51,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:51,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 20:57:51,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:57:51,270 INFO L87 Difference]: Start difference. First operand 13891 states and 41772 transitions. Second operand 14 states. [2019-12-27 20:57:56,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:56,709 INFO L93 Difference]: Finished difference Result 38549 states and 115001 transitions. [2019-12-27 20:57:56,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 20:57:56,709 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 20:57:56,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:56,761 INFO L225 Difference]: With dead ends: 38549 [2019-12-27 20:57:56,761 INFO L226 Difference]: Without dead ends: 38549 [2019-12-27 20:57:56,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=317, Invalid=1575, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 20:57:56,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38549 states. [2019-12-27 20:57:57,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38549 to 13685. [2019-12-27 20:57:57,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13685 states. [2019-12-27 20:57:57,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13685 states to 13685 states and 41241 transitions. [2019-12-27 20:57:57,424 INFO L78 Accepts]: Start accepts. Automaton has 13685 states and 41241 transitions. Word has length 66 [2019-12-27 20:57:57,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:57,425 INFO L462 AbstractCegarLoop]: Abstraction has 13685 states and 41241 transitions. [2019-12-27 20:57:57,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 20:57:57,425 INFO L276 IsEmpty]: Start isEmpty. Operand 13685 states and 41241 transitions. [2019-12-27 20:57:57,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:57:57,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:57,437 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:57,438 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:57,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:57,438 INFO L82 PathProgramCache]: Analyzing trace with hash -226065487, now seen corresponding path program 3 times [2019-12-27 20:57:57,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:57,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193258013] [2019-12-27 20:57:57,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:57,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:57:57,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193258013] [2019-12-27 20:57:57,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:57,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:57:57,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1760068977] [2019-12-27 20:57:57,517 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:57,538 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:57,769 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 268 states and 512 transitions. [2019-12-27 20:57:57,769 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:57,782 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:57:57,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:57:57,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:57,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:57:57,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:57:57,783 INFO L87 Difference]: Start difference. First operand 13685 states and 41241 transitions. Second operand 3 states. [2019-12-27 20:57:57,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:57,879 INFO L93 Difference]: Finished difference Result 16629 states and 50079 transitions. [2019-12-27 20:57:57,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:57:57,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 20:57:57,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:57,899 INFO L225 Difference]: With dead ends: 16629 [2019-12-27 20:57:57,899 INFO L226 Difference]: Without dead ends: 16629 [2019-12-27 20:57:57,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:57:57,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16629 states. [2019-12-27 20:57:58,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16629 to 11852. [2019-12-27 20:57:58,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11852 states. [2019-12-27 20:57:58,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11852 states to 11852 states and 36021 transitions. [2019-12-27 20:57:58,116 INFO L78 Accepts]: Start accepts. Automaton has 11852 states and 36021 transitions. Word has length 66 [2019-12-27 20:57:58,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:58,116 INFO L462 AbstractCegarLoop]: Abstraction has 11852 states and 36021 transitions. [2019-12-27 20:57:58,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:57:58,117 INFO L276 IsEmpty]: Start isEmpty. Operand 11852 states and 36021 transitions. [2019-12-27 20:57:58,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:57:58,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:58,129 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:58,129 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:58,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:58,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1185518723, now seen corresponding path program 1 times [2019-12-27 20:57:58,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:58,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154657611] [2019-12-27 20:57:58,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:58,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:57:58,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154657611] [2019-12-27 20:57:58,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:58,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:57:58,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [411050502] [2019-12-27 20:57:58,367 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:58,399 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:58,724 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 277 states and 551 transitions. [2019-12-27 20:57:58,724 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:58,929 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 20:57:58,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 20:57:58,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:58,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 20:57:58,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:57:58,930 INFO L87 Difference]: Start difference. First operand 11852 states and 36021 transitions. Second operand 15 states. [2019-12-27 20:58:00,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:00,369 INFO L93 Difference]: Finished difference Result 39448 states and 119818 transitions. [2019-12-27 20:58:00,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 20:58:00,370 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 20:58:00,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:00,413 INFO L225 Difference]: With dead ends: 39448 [2019-12-27 20:58:00,413 INFO L226 Difference]: Without dead ends: 33145 [2019-12-27 20:58:00,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=330, Invalid=1392, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 20:58:00,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33145 states. [2019-12-27 20:58:00,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33145 to 18128. [2019-12-27 20:58:00,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18128 states. [2019-12-27 20:58:00,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18128 states to 18128 states and 55105 transitions. [2019-12-27 20:58:00,990 INFO L78 Accepts]: Start accepts. Automaton has 18128 states and 55105 transitions. Word has length 67 [2019-12-27 20:58:00,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:00,991 INFO L462 AbstractCegarLoop]: Abstraction has 18128 states and 55105 transitions. [2019-12-27 20:58:00,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 20:58:00,991 INFO L276 IsEmpty]: Start isEmpty. Operand 18128 states and 55105 transitions. [2019-12-27 20:58:01,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:58:01,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:01,009 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:01,010 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:01,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:01,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1856066161, now seen corresponding path program 2 times [2019-12-27 20:58:01,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:01,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347211744] [2019-12-27 20:58:01,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:58:01,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347211744] [2019-12-27 20:58:01,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:01,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:58:01,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [833730541] [2019-12-27 20:58:01,185 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:01,205 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:01,581 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 333 states and 690 transitions. [2019-12-27 20:58:01,582 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:01,901 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 20:58:01,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 20:58:01,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:01,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 20:58:01,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:58:01,902 INFO L87 Difference]: Start difference. First operand 18128 states and 55105 transitions. Second operand 15 states. [2019-12-27 20:58:03,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:03,110 INFO L93 Difference]: Finished difference Result 33808 states and 101670 transitions. [2019-12-27 20:58:03,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 20:58:03,110 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 20:58:03,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:03,145 INFO L225 Difference]: With dead ends: 33808 [2019-12-27 20:58:03,145 INFO L226 Difference]: Without dead ends: 25878 [2019-12-27 20:58:03,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=201, Invalid=791, Unknown=0, NotChecked=0, Total=992 [2019-12-27 20:58:03,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25878 states. [2019-12-27 20:58:03,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25878 to 13943. [2019-12-27 20:58:03,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13943 states. [2019-12-27 20:58:03,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13943 states to 13943 states and 41689 transitions. [2019-12-27 20:58:03,421 INFO L78 Accepts]: Start accepts. Automaton has 13943 states and 41689 transitions. Word has length 67 [2019-12-27 20:58:03,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:03,421 INFO L462 AbstractCegarLoop]: Abstraction has 13943 states and 41689 transitions. [2019-12-27 20:58:03,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 20:58:03,422 INFO L276 IsEmpty]: Start isEmpty. Operand 13943 states and 41689 transitions. [2019-12-27 20:58:03,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:58:03,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:03,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:03,436 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:03,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:03,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1959201465, now seen corresponding path program 3 times [2019-12-27 20:58:03,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:03,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741653443] [2019-12-27 20:58:03,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:03,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:58:03,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741653443] [2019-12-27 20:58:03,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:03,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:58:03,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [502150326] [2019-12-27 20:58:03,628 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:03,648 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:04,144 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 354 states and 739 transitions. [2019-12-27 20:58:04,144 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:04,441 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 20:58:04,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 20:58:04,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:04,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 20:58:04,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 20:58:04,442 INFO L87 Difference]: Start difference. First operand 13943 states and 41689 transitions. Second operand 16 states. [2019-12-27 20:58:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:05,947 INFO L93 Difference]: Finished difference Result 26394 states and 78401 transitions. [2019-12-27 20:58:05,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 20:58:05,948 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 20:58:05,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:05,981 INFO L225 Difference]: With dead ends: 26394 [2019-12-27 20:58:05,981 INFO L226 Difference]: Without dead ends: 25292 [2019-12-27 20:58:05,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 11 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=906, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 20:58:06,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25292 states. [2019-12-27 20:58:06,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25292 to 13533. [2019-12-27 20:58:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13533 states. [2019-12-27 20:58:06,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13533 states to 13533 states and 40510 transitions. [2019-12-27 20:58:06,248 INFO L78 Accepts]: Start accepts. Automaton has 13533 states and 40510 transitions. Word has length 67 [2019-12-27 20:58:06,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:06,248 INFO L462 AbstractCegarLoop]: Abstraction has 13533 states and 40510 transitions. [2019-12-27 20:58:06,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 20:58:06,248 INFO L276 IsEmpty]: Start isEmpty. Operand 13533 states and 40510 transitions. [2019-12-27 20:58:06,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:58:06,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:06,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:06,262 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:06,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:06,263 INFO L82 PathProgramCache]: Analyzing trace with hash -49234465, now seen corresponding path program 4 times [2019-12-27 20:58:06,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:06,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535884983] [2019-12-27 20:58:06,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:58:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:58:06,372 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:58:06,372 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:58:06,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [906] [906] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= 0 v_~b$r_buff0_thd3~0_78) (= v_~main$tmp_guard0~0_10 0) (= v_~b$r_buff1_thd1~0_21 0) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~weak$$choice0~0_8) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t879~0.base_22|)) (= |v_#NULL.offset_6| 0) (= 0 v_~b$r_buff0_thd0~0_22) (= 0 v_~b$r_buff0_thd2~0_19) (= 0 v_~b$w_buff1_used~0_75) (= 0 v_~b$read_delayed~0_7) (= 0 v_~b$w_buff0~0_26) (< 0 |v_#StackHeapBarrier_19|) (= 0 v_~y~0_7) (= v_~__unbuffered_p2_EBX~0_12 0) (= 0 v_~weak$$choice2~0_34) (= |v_ULTIMATE.start_main_~#t879~0.offset_18| 0) (= v_~b$r_buff1_thd2~0_21 0) (= 0 v_~a~0_7) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t879~0.base_22| 1)) (= v_~b$read_delayed_var~0.offset_7 0) (= v_~b$r_buff1_thd3~0_52 0) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_cnt~0_19) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t879~0.base_22| 4)) (= 0 v_~__unbuffered_p2_EAX~0_12) (= 0 v_~b$w_buff1~0_25) (= v_~b$flush_delayed~0_12 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t879~0.base_22| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t879~0.base_22|) |v_ULTIMATE.start_main_~#t879~0.offset_18| 0)) |v_#memory_int_25|) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t879~0.base_22|) (= 0 v_~z~0_9) (= v_~__unbuffered_p1_EBX~0_13 0) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~b$w_buff0_used~0_116) (= 0 v_~b$read_delayed_var~0.base_7) (= v_~x~0_16 0) (= v_~b$r_buff1_thd0~0_21 0) (= v_~b~0_26 0) (= 0 v_~b$r_buff0_thd1~0_28) (= 0 v_~b$mem_tmp~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_26|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_78, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_21, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_10|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_10|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_116, ~a~0=v_~a~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ULTIMATE.start_main_~#t880~0.offset=|v_ULTIMATE.start_main_~#t880~0.offset_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_22, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_19, ~b$mem_tmp~0=v_~b$mem_tmp~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~b$flush_delayed~0=v_~b$flush_delayed~0_12, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ~b$w_buff1~0=v_~b$w_buff1~0_25, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x~0=v_~x~0_16, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_28, ULTIMATE.start_main_~#t881~0.offset=|v_ULTIMATE.start_main_~#t881~0.offset_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ULTIMATE.start_main_~#t881~0.base=|v_ULTIMATE.start_main_~#t881~0.base_18|, ULTIMATE.start_main_~#t879~0.offset=|v_ULTIMATE.start_main_~#t879~0.offset_18|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_10|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_75, ~y~0=v_~y~0_7, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_21, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t879~0.base=|v_ULTIMATE.start_main_~#t879~0.base_22|, ~b~0=v_~b~0_26, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~#t880~0.base=|v_ULTIMATE.start_main_~#t880~0.base_20|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_52} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t880~0.offset, ~__unbuffered_p1_EAX~0, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ~b$read_delayed~0, ~weak$$choice0~0, ~b$w_buff1~0, ~__unbuffered_cnt~0, ~x~0, ~b$r_buff0_thd1~0, ULTIMATE.start_main_~#t881~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t881~0.base, ULTIMATE.start_main_~#t879~0.offset, ULTIMATE.start_main_#t~ite51, ~b$w_buff1_used~0, ~y~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ULTIMATE.start_main_~#t879~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t880~0.base, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 20:58:06,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L840-1-->L842: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t880~0.base_12| 1)) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t880~0.base_12|) 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t880~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t880~0.base_12|) |v_ULTIMATE.start_main_~#t880~0.offset_10| 1)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t880~0.base_12|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t880~0.base_12| 4) |v_#length_17|) (= 0 |v_ULTIMATE.start_main_~#t880~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t880~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t880~0.offset=|v_ULTIMATE.start_main_~#t880~0.offset_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t880~0.base=|v_ULTIMATE.start_main_~#t880~0.base_12|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t880~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t880~0.base, #length] because there is no mapped edge [2019-12-27 20:58:06,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L752: Formula: (and (= ~b$r_buff1_thd2~0_Out437990544 ~b$r_buff0_thd2~0_In437990544) (= ~b$r_buff0_thd0~0_In437990544 ~b$r_buff1_thd0~0_Out437990544) (= ~b$r_buff1_thd3~0_Out437990544 ~b$r_buff0_thd3~0_In437990544) (= ~b$r_buff0_thd1~0_Out437990544 1) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In437990544 0)) (= 1 ~x~0_Out437990544) (= ~b$r_buff1_thd1~0_Out437990544 ~b$r_buff0_thd1~0_In437990544)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In437990544, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In437990544, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In437990544, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In437990544, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In437990544} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out437990544, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In437990544, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In437990544, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out437990544, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out437990544, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In437990544, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out437990544, ~x~0=~x~0_Out437990544, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out437990544, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In437990544} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~x~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 20:58:06,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L778-2-->L778-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork2_#t~ite9_Out1836427230| |P1Thread1of1ForFork2_#t~ite10_Out1836427230|)) (.cse0 (= (mod ~b$w_buff1_used~0_In1836427230 256) 0)) (.cse2 (= (mod ~b$r_buff1_thd2~0_In1836427230 256) 0))) (or (and (not .cse0) .cse1 (= |P1Thread1of1ForFork2_#t~ite9_Out1836427230| ~b$w_buff1~0_In1836427230) (not .cse2)) (and .cse1 (or .cse0 .cse2) (= |P1Thread1of1ForFork2_#t~ite9_Out1836427230| ~b~0_In1836427230)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In1836427230, ~b~0=~b~0_In1836427230, ~b$w_buff1~0=~b$w_buff1~0_In1836427230, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1836427230} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1836427230|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1836427230, ~b~0=~b~0_In1836427230, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1836427230|, ~b$w_buff1~0=~b$w_buff1~0_In1836427230, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1836427230} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 20:58:06,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L753-->L753-2: Formula: (let ((.cse0 (= (mod ~b$r_buff0_thd1~0_In-1489419480 256) 0)) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In-1489419480 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-1489419480|) (not .cse1)) (and (= ~b$w_buff0_used~0_In-1489419480 |P0Thread1of1ForFork1_#t~ite5_Out-1489419480|) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1489419480, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1489419480} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1489419480, P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1489419480|, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1489419480} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 20:58:06,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L754-->L754-2: Formula: (let ((.cse3 (= (mod ~b$w_buff1_used~0_In-1405383401 256) 0)) (.cse2 (= 0 (mod ~b$r_buff1_thd1~0_In-1405383401 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd1~0_In-1405383401 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1405383401 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1405383401| ~b$w_buff1_used~0_In-1405383401) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork1_#t~ite6_Out-1405383401| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1405383401, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1405383401, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1405383401, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1405383401} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1405383401, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1405383401, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1405383401, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1405383401, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1405383401|} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 20:58:06,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In-509713029 256) 0)) (.cse0 (= (mod ~b$r_buff0_thd2~0_In-509713029 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-509713029|) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-509713029| ~b$w_buff0_used~0_In-509713029)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-509713029, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-509713029} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-509713029, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-509713029, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-509713029|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 20:58:06,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L755-->L756: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd1~0_In-1151612875 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In-1151612875 256) 0))) (or (and (= ~b$r_buff0_thd1~0_In-1151612875 ~b$r_buff0_thd1~0_Out-1151612875) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 ~b$r_buff0_thd1~0_Out-1151612875)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1151612875, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1151612875} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1151612875, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-1151612875, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1151612875|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite7] because there is no mapped edge [2019-12-27 20:58:06,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L756-->L756-2: Formula: (let ((.cse2 (= (mod ~b$r_buff1_thd1~0_In673050029 256) 0)) (.cse3 (= (mod ~b$w_buff1_used~0_In673050029 256) 0)) (.cse0 (= (mod ~b$r_buff0_thd1~0_In673050029 256) 0)) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In673050029 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out673050029|)) (and (= ~b$r_buff1_thd1~0_In673050029 |P0Thread1of1ForFork1_#t~ite8_Out673050029|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In673050029, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In673050029, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In673050029, ~b$w_buff1_used~0=~b$w_buff1_used~0_In673050029} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In673050029, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In673050029, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In673050029, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out673050029|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In673050029} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 20:58:06,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L756-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= v_~b$r_buff1_thd1~0_17 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_17, P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:58:06,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L842-1-->L844: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t881~0.base_12|)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t881~0.base_12| 1) |v_#valid_36|) (= 0 |v_ULTIMATE.start_main_~#t881~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t881~0.base_12|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t881~0.base_12| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t881~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t881~0.base_12|) |v_ULTIMATE.start_main_~#t881~0.offset_10| 2)) |v_#memory_int_15|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t881~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t881~0.offset=|v_ULTIMATE.start_main_~#t881~0.offset_10|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_15|, #length=|v_#length_15|, ULTIMATE.start_main_~#t881~0.base=|v_ULTIMATE.start_main_~#t881~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t881~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t881~0.base] because there is no mapped edge [2019-12-27 20:58:06,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L809-->L809-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In296415104 256)))) (or (and (= ~b$w_buff1_used~0_In296415104 |P2Thread1of1ForFork0_#t~ite30_Out296415104|) (= |P2Thread1of1ForFork0_#t~ite29_In296415104| |P2Thread1of1ForFork0_#t~ite29_Out296415104|) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite29_Out296415104| ~b$w_buff1_used~0_In296415104) (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In296415104 256) 0))) (or (and (= (mod ~b$r_buff1_thd3~0_In296415104 256) 0) .cse1) (= (mod ~b$w_buff0_used~0_In296415104 256) 0) (and (= (mod ~b$w_buff1_used~0_In296415104 256) 0) .cse1))) (= |P2Thread1of1ForFork0_#t~ite29_Out296415104| |P2Thread1of1ForFork0_#t~ite30_Out296415104|) .cse0))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In296415104, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In296415104, ~b$w_buff1_used~0=~b$w_buff1_used~0_In296415104, ~weak$$choice2~0=~weak$$choice2~0_In296415104, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In296415104|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In296415104} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In296415104, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In296415104, ~b$w_buff1_used~0=~b$w_buff1_used~0_In296415104, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out296415104|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out296415104|, ~weak$$choice2~0=~weak$$choice2~0_In296415104, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In296415104} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 20:58:06,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L810-->L811: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~b$r_buff0_thd3~0_58 v_~b$r_buff0_thd3~0_57)) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_57, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_8|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_10|, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_9|, ~weak$$choice2~0=v_~weak$$choice2~0_18} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 20:58:06,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] L811-->L811-8: Formula: (let ((.cse1 (= |P2Thread1of1ForFork0_#t~ite36_Out-1825891161| |P2Thread1of1ForFork0_#t~ite35_Out-1825891161|)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1825891161 256))) (.cse5 (= (mod ~b$r_buff1_thd3~0_In-1825891161 256) 0)) (.cse4 (= 0 (mod ~b$w_buff1_used~0_In-1825891161 256))) (.cse6 (= (mod ~b$r_buff0_thd3~0_In-1825891161 256) 0)) (.cse2 (= (mod ~weak$$choice2~0_In-1825891161 256) 0))) (or (let ((.cse3 (not .cse6))) (and (= |P2Thread1of1ForFork0_#t~ite34_Out-1825891161| 0) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite34_Out-1825891161| |P2Thread1of1ForFork0_#t~ite35_Out-1825891161|) .cse1 .cse2 (or .cse3 (not .cse4)) (or .cse3 (not .cse5)))) (and (or (and (= ~b$r_buff1_thd3~0_In-1825891161 |P2Thread1of1ForFork0_#t~ite35_Out-1825891161|) .cse1 .cse2 (or .cse0 (and .cse5 .cse6) (and .cse4 .cse6))) (and (= |P2Thread1of1ForFork0_#t~ite35_In-1825891161| |P2Thread1of1ForFork0_#t~ite35_Out-1825891161|) (= ~b$r_buff1_thd3~0_In-1825891161 |P2Thread1of1ForFork0_#t~ite36_Out-1825891161|) (not .cse2))) (= |P2Thread1of1ForFork0_#t~ite34_In-1825891161| |P2Thread1of1ForFork0_#t~ite34_Out-1825891161|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1825891161, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1825891161, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1825891161, P2Thread1of1ForFork0_#t~ite35=|P2Thread1of1ForFork0_#t~ite35_In-1825891161|, P2Thread1of1ForFork0_#t~ite34=|P2Thread1of1ForFork0_#t~ite34_In-1825891161|, ~weak$$choice2~0=~weak$$choice2~0_In-1825891161, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1825891161} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1825891161, P2Thread1of1ForFork0_#t~ite36=|P2Thread1of1ForFork0_#t~ite36_Out-1825891161|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1825891161, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1825891161, P2Thread1of1ForFork0_#t~ite35=|P2Thread1of1ForFork0_#t~ite35_Out-1825891161|, P2Thread1of1ForFork0_#t~ite34=|P2Thread1of1ForFork0_#t~ite34_Out-1825891161|, ~weak$$choice2~0=~weak$$choice2~0_In-1825891161, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1825891161} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite36, P2Thread1of1ForFork0_#t~ite35, P2Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-27 20:58:06,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L813-->L817: Formula: (and (= v_~b$flush_delayed~0_6 0) (not (= (mod v_~b$flush_delayed~0_7 256) 0)) (= v_~b~0_16 v_~b$mem_tmp~0_4)) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_4, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~b$mem_tmp~0=v_~b$mem_tmp~0_4, ~b~0=v_~b~0_16, ~b$flush_delayed~0=v_~b$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-27 20:58:06,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L817-2-->L817-5: Formula: (let ((.cse1 (= (mod ~b$w_buff1_used~0_In2011050800 256) 0)) (.cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out2011050800| |P2Thread1of1ForFork0_#t~ite39_Out2011050800|)) (.cse2 (= (mod ~b$r_buff1_thd3~0_In2011050800 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out2011050800| ~b~0_In2011050800) .cse0 (or .cse1 .cse2)) (and (not .cse1) .cse0 (not .cse2) (= ~b$w_buff1~0_In2011050800 |P2Thread1of1ForFork0_#t~ite38_Out2011050800|)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In2011050800, ~b~0=~b~0_In2011050800, ~b$w_buff1~0=~b$w_buff1~0_In2011050800, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In2011050800} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out2011050800|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out2011050800|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2011050800, ~b~0=~b~0_In2011050800, ~b$w_buff1~0=~b$w_buff1~0_In2011050800, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In2011050800} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 20:58:06,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In1389861309 256) 0)) (.cse0 (= (mod ~b$r_buff0_thd3~0_In1389861309 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1389861309|) (not .cse0) (not .cse1)) (and (= ~b$w_buff0_used~0_In1389861309 |P2Thread1of1ForFork0_#t~ite40_Out1389861309|) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1389861309, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1389861309} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1389861309, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1389861309, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1389861309|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 20:58:06,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In40852827 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In40852827 256) 0)) (.cse3 (= 0 (mod ~b$r_buff1_thd3~0_In40852827 256))) (.cse2 (= (mod ~b$w_buff1_used~0_In40852827 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out40852827| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite41_Out40852827| ~b$w_buff1_used~0_In40852827)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In40852827, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In40852827, ~b$w_buff1_used~0=~b$w_buff1_used~0_In40852827, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In40852827} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In40852827, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In40852827, ~b$w_buff1_used~0=~b$w_buff1_used~0_In40852827, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out40852827|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In40852827} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 20:58:06,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In-1877744039 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In-1877744039 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1877744039| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1877744039| ~b$r_buff0_thd3~0_In-1877744039)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1877744039, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1877744039} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1877744039, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1877744039, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1877744039|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 20:58:06,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L821-->L821-2: Formula: (let ((.cse2 (= (mod ~b$w_buff1_used~0_In339800941 256) 0)) (.cse3 (= (mod ~b$r_buff1_thd3~0_In339800941 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In339800941 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In339800941 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out339800941|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~b$r_buff1_thd3~0_In339800941 |P2Thread1of1ForFork0_#t~ite43_Out339800941|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In339800941, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In339800941, ~b$w_buff1_used~0=~b$w_buff1_used~0_In339800941, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In339800941} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In339800941, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In339800941, P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out339800941|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In339800941, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In339800941} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 20:58:06,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~b$r_buff1_thd3~0_42 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_42, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 20:58:06,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In1532647645 256))) (.cse1 (= (mod ~b$r_buff0_thd2~0_In1532647645 256) 0)) (.cse3 (= (mod ~b$r_buff1_thd2~0_In1532647645 256) 0)) (.cse2 (= 0 (mod ~b$w_buff1_used~0_In1532647645 256)))) (or (and (= ~b$w_buff1_used~0_In1532647645 |P1Thread1of1ForFork2_#t~ite12_Out1532647645|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1532647645|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1532647645, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1532647645, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1532647645, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1532647645} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1532647645, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1532647645, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1532647645, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1532647645|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1532647645} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 20:58:06,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd2~0_In971944931 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In971944931 256)))) (or (and (= ~b$r_buff0_thd2~0_In971944931 |P1Thread1of1ForFork2_#t~ite13_Out971944931|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out971944931|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In971944931, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In971944931} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In971944931, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In971944931, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out971944931|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 20:58:06,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~b$w_buff1_used~0_In142155837 256) 0)) (.cse0 (= (mod ~b$r_buff1_thd2~0_In142155837 256) 0)) (.cse2 (= (mod ~b$w_buff0_used~0_In142155837 256) 0)) (.cse3 (= 0 (mod ~b$r_buff0_thd2~0_In142155837 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out142155837| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out142155837| ~b$r_buff1_thd2~0_In142155837)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In142155837, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In142155837, ~b$w_buff1_used~0=~b$w_buff1_used~0_In142155837, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In142155837} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In142155837, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In142155837, ~b$w_buff1_used~0=~b$w_buff1_used~0_In142155837, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out142155837|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In142155837} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 20:58:06,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L782-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~b$r_buff1_thd2~0_17) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_17, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, ~b$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 20:58:06,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L848-->L850-2: Formula: (and (or (= (mod v_~b$w_buff0_used~0_89 256) 0) (= 0 (mod v_~b$r_buff0_thd0~0_17 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_17} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_17} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 20:58:06,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L850-2-->L850-4: Formula: (let ((.cse0 (= (mod ~b$w_buff1_used~0_In500265451 256) 0)) (.cse1 (= (mod ~b$r_buff1_thd0~0_In500265451 256) 0))) (or (and (= ~b$w_buff1~0_In500265451 |ULTIMATE.start_main_#t~ite47_Out500265451|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~b~0_In500265451 |ULTIMATE.start_main_#t~ite47_Out500265451|)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In500265451, ~b$w_buff1_used~0=~b$w_buff1_used~0_In500265451, ~b~0=~b~0_In500265451, ~b$w_buff1~0=~b$w_buff1~0_In500265451} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In500265451, ~b$w_buff1_used~0=~b$w_buff1_used~0_In500265451, ~b~0=~b~0_In500265451, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out500265451|, ~b$w_buff1~0=~b$w_buff1~0_In500265451} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 20:58:06,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L850-4-->L851: Formula: (= v_~b~0_17 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{~b~0=v_~b~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 20:58:06,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L851-->L851-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In2022544949 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd0~0_In2022544949 256) 0))) (or (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In2022544949 |ULTIMATE.start_main_#t~ite49_Out2022544949|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out2022544949| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2022544949, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In2022544949} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2022544949, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out2022544949|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In2022544949} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 20:58:06,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L852-->L852-2: Formula: (let ((.cse2 (= 0 (mod ~b$w_buff1_used~0_In1905867204 256))) (.cse3 (= 0 (mod ~b$r_buff1_thd0~0_In1905867204 256))) (.cse0 (= (mod ~b$r_buff0_thd0~0_In1905867204 256) 0)) (.cse1 (= (mod ~b$w_buff0_used~0_In1905867204 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out1905867204| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~b$w_buff1_used~0_In1905867204 |ULTIMATE.start_main_#t~ite50_Out1905867204|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1905867204, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1905867204, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1905867204, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1905867204} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1905867204|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In1905867204, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1905867204, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1905867204, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1905867204} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 20:58:06,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L853-->L853-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In-835205439 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In-835205439 256)))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out-835205439| ~b$r_buff0_thd0~0_In-835205439) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-835205439| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-835205439, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-835205439} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-835205439, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-835205439|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-835205439} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 20:58:06,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L854-->L854-2: Formula: (let ((.cse2 (= 0 (mod ~b$w_buff0_used~0_In506001236 256))) (.cse3 (= (mod ~b$r_buff0_thd0~0_In506001236 256) 0)) (.cse0 (= (mod ~b$r_buff1_thd0~0_In506001236 256) 0)) (.cse1 (= (mod ~b$w_buff1_used~0_In506001236 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out506001236|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~b$r_buff1_thd0~0_In506001236 |ULTIMATE.start_main_#t~ite52_Out506001236|) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In506001236, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In506001236, ~b$w_buff1_used~0=~b$w_buff1_used~0_In506001236, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In506001236} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In506001236, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out506001236|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In506001236, ~b$w_buff1_used~0=~b$w_buff1_used~0_In506001236, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In506001236} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 20:58:06,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p1_EAX~0_8) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_7 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~b$r_buff1_thd0~0_16 |v_ULTIMATE.start_main_#t~ite52_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~__unbuffered_p2_EAX~0_7 1) (= v_~x~0_11 2) (= v_~__unbuffered_p2_EBX~0_7 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x~0=v_~x~0_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:58:06,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:58:06 BasicIcfg [2019-12-27 20:58:06,497 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:58:06,499 INFO L168 Benchmark]: Toolchain (without parser) took 106314.30 ms. Allocated memory was 139.5 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 102.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 20:58:06,500 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 20:58:06,500 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.98 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 101.9 MB in the beginning and 156.8 MB in the end (delta: -54.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:06,501 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.25 ms. Allocated memory is still 203.4 MB. Free memory was 156.8 MB in the beginning and 154.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:06,501 INFO L168 Benchmark]: Boogie Preprocessor took 81.77 ms. Allocated memory is still 203.4 MB. Free memory was 154.2 MB in the beginning and 151.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:06,502 INFO L168 Benchmark]: RCFGBuilder took 906.23 ms. Allocated memory is still 203.4 MB. Free memory was 151.6 MB in the beginning and 100.6 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:06,506 INFO L168 Benchmark]: TraceAbstraction took 104469.33 ms. Allocated memory was 203.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.0 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 20:58:06,513 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 777.98 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 101.9 MB in the beginning and 156.8 MB in the end (delta: -54.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.25 ms. Allocated memory is still 203.4 MB. Free memory was 156.8 MB in the beginning and 154.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 81.77 ms. Allocated memory is still 203.4 MB. Free memory was 154.2 MB in the beginning and 151.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 906.23 ms. Allocated memory is still 203.4 MB. Free memory was 151.6 MB in the beginning and 100.6 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 104469.33 ms. Allocated memory was 203.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.0 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 179 ProgramPointsBefore, 93 ProgramPointsAfterwards, 216 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 7196 VarBasedMoverChecksPositive, 207 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 81109 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t879, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t880, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 b$w_buff1 = b$w_buff0 [L738] 1 b$w_buff0 = 1 [L739] 1 b$w_buff1_used = b$w_buff0_used [L740] 1 b$w_buff0_used = (_Bool)1 [L752] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 x = 2 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L778] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L752] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L778] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L753] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L754] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L844] FCALL, FORK 0 pthread_create(&t881, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L792] 3 z = 1 [L795] 3 a = 1 [L798] 3 __unbuffered_p2_EAX = a [L801] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L802] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L803] 3 b$flush_delayed = weak$$choice2 [L804] 3 b$mem_tmp = b VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L805] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) VAL [!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L805] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L806] EXPR 3 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0))=1, x=2, y=1, z=1] [L806] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L807] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1))=0, x=2, y=1, z=1] [L807] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L808] EXPR 3 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used))=0, x=2, y=1, z=1] [L808] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L809] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L812] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L817] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L817] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L818] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L819] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L820] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L779] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L780] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L781] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L851] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L852] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L853] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 104.1s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 38.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6511 SDtfs, 10097 SDslu, 26525 SDs, 0 SdLazy, 18067 SolverSat, 441 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 501 GetRequests, 143 SyntacticMatches, 62 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1572 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148375occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 36.9s AutomataMinimizationTime, 27 MinimizatonAttempts, 227931 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1034 NumberOfCodeBlocks, 1034 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 940 ConstructedInterpolants, 0 QuantifiedInterpolants, 177003 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...