/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:16:24,873 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:16:24,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:16:24,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:16:24,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:16:24,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:16:24,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:16:24,911 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:16:24,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:16:24,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:16:24,917 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:16:24,918 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:16:24,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:16:24,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:16:24,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:16:24,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:16:24,925 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:16:24,926 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:16:24,927 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:16:24,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:16:24,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:16:24,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:16:24,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:16:24,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:16:24,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:16:24,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:16:24,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:16:24,936 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:16:24,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:16:24,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:16:24,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:16:24,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:16:24,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:16:24,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:16:24,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:16:24,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:16:24,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:16:24,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:16:24,942 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:16:24,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:16:24,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:16:24,945 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:16:24,958 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:16:24,958 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:16:24,959 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:16:24,960 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:16:24,960 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:16:24,960 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:16:24,960 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:16:24,960 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:16:24,961 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:16:24,961 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:16:24,961 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:16:24,961 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:16:24,961 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:16:24,961 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:16:24,962 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:16:24,962 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:16:24,962 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:16:24,962 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:16:24,962 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:16:24,963 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:16:24,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:16:24,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:16:24,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:16:24,963 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:16:24,964 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:16:24,964 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:16:24,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:16:24,964 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:16:24,964 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:16:24,965 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:16:25,229 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:16:25,248 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:16:25,252 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:16:25,254 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:16:25,254 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:16:25,255 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.oepc.i [2019-12-27 06:16:25,327 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b72a274bf/1f5e09059ddd41f0a32523d0595f9ef3/FLAGb7be8279d [2019-12-27 06:16:25,828 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:16:25,828 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_pso.oepc.i [2019-12-27 06:16:25,845 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b72a274bf/1f5e09059ddd41f0a32523d0595f9ef3/FLAGb7be8279d [2019-12-27 06:16:26,116 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b72a274bf/1f5e09059ddd41f0a32523d0595f9ef3 [2019-12-27 06:16:26,125 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:16:26,127 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:16:26,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:16:26,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:16:26,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:16:26,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:16:26" (1/1) ... [2019-12-27 06:16:26,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c54fe63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:26, skipping insertion in model container [2019-12-27 06:16:26,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:16:26" (1/1) ... [2019-12-27 06:16:26,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:16:26,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:16:26,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:16:26,809 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:16:26,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:16:26,951 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:16:26,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:26 WrapperNode [2019-12-27 06:16:26,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:16:26,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:16:26,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:16:26,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:16:26,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:26" (1/1) ... [2019-12-27 06:16:26,984 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:26" (1/1) ... [2019-12-27 06:16:27,016 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:16:27,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:16:27,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:16:27,017 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:16:27,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:26" (1/1) ... [2019-12-27 06:16:27,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:26" (1/1) ... [2019-12-27 06:16:27,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:26" (1/1) ... [2019-12-27 06:16:27,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:26" (1/1) ... [2019-12-27 06:16:27,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:26" (1/1) ... [2019-12-27 06:16:27,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:26" (1/1) ... [2019-12-27 06:16:27,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:26" (1/1) ... [2019-12-27 06:16:27,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:16:27,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:16:27,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:16:27,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:16:27,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:26" (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 06:16:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:16:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:16:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:16:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:16:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:16:27,127 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:16:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:16:27,128 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:16:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:16:27,128 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:16:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:16:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:16:27,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:16:27,131 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 06:16:27,890 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:16:27,890 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:16:27,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:16:27 BoogieIcfgContainer [2019-12-27 06:16:27,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:16:27,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:16:27,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:16:27,898 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:16:27,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:16:26" (1/3) ... [2019-12-27 06:16:27,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0ca58d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:16:27, skipping insertion in model container [2019-12-27 06:16:27,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:26" (2/3) ... [2019-12-27 06:16:27,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0ca58d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:16:27, skipping insertion in model container [2019-12-27 06:16:27,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:16:27" (3/3) ... [2019-12-27 06:16:27,905 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_pso.oepc.i [2019-12-27 06:16:27,917 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:16:27,917 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:16:27,929 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:16:27,930 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:16:27,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:27,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:27,994 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:27,995 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:27,995 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:27,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:27,996 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:27,996 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:27,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:27,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:27,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:27,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:27,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:27,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:27,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:27,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,031 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,032 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,040 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,040 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,068 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,071 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,078 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,079 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,079 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,083 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,083 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:28,103 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:16:28,125 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:16:28,126 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:16:28,126 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:16:28,126 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:16:28,126 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:16:28,126 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:16:28,126 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:16:28,127 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:16:28,144 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 06:16:28,146 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 06:16:28,252 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 06:16:28,252 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:16:28,272 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:16:28,310 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 06:16:28,371 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 06:16:28,371 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:16:28,382 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:16:28,412 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 06:16:28,413 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:16:31,835 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 06:16:31,993 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 06:16:32,019 INFO L206 etLargeBlockEncoding]: Checked pairs total: 86659 [2019-12-27 06:16:32,019 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 06:16:32,023 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 107 transitions [2019-12-27 06:16:51,905 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123932 states. [2019-12-27 06:16:51,907 INFO L276 IsEmpty]: Start isEmpty. Operand 123932 states. [2019-12-27 06:16:51,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:16:51,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:51,914 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:16:51,914 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 06:16:51,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:51,922 INFO L82 PathProgramCache]: Analyzing trace with hash 916959, now seen corresponding path program 1 times [2019-12-27 06:16:51,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:51,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979810024] [2019-12-27 06:16:51,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:52,147 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 06:16:52,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979810024] [2019-12-27 06:16:52,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:52,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:16:52,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290771805] [2019-12-27 06:16:52,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:16:52,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:52,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:16:52,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:16:52,172 INFO L87 Difference]: Start difference. First operand 123932 states. Second operand 3 states. [2019-12-27 06:16:55,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:55,919 INFO L93 Difference]: Finished difference Result 123002 states and 528862 transitions. [2019-12-27 06:16:55,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:16:55,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:16:55,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:56,691 INFO L225 Difference]: With dead ends: 123002 [2019-12-27 06:16:56,691 INFO L226 Difference]: Without dead ends: 115358 [2019-12-27 06:16:56,693 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 06:17:01,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115358 states. [2019-12-27 06:17:06,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115358 to 115358. [2019-12-27 06:17:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115358 states. [2019-12-27 06:17:07,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115358 states to 115358 states and 495332 transitions. [2019-12-27 06:17:07,054 INFO L78 Accepts]: Start accepts. Automaton has 115358 states and 495332 transitions. Word has length 3 [2019-12-27 06:17:07,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:07,054 INFO L462 AbstractCegarLoop]: Abstraction has 115358 states and 495332 transitions. [2019-12-27 06:17:07,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:07,054 INFO L276 IsEmpty]: Start isEmpty. Operand 115358 states and 495332 transitions. [2019-12-27 06:17:07,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:17:07,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:07,059 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:07,059 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 06:17:07,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:07,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1587788746, now seen corresponding path program 1 times [2019-12-27 06:17:07,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:07,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545784366] [2019-12-27 06:17:07,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:07,188 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 06:17:07,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545784366] [2019-12-27 06:17:07,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:07,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:07,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540639643] [2019-12-27 06:17:07,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:17:07,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:07,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:17:07,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:17:07,192 INFO L87 Difference]: Start difference. First operand 115358 states and 495332 transitions. Second operand 4 states. [2019-12-27 06:17:13,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:13,391 INFO L93 Difference]: Finished difference Result 179368 states and 739568 transitions. [2019-12-27 06:17:13,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:17:13,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:17:13,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:14,109 INFO L225 Difference]: With dead ends: 179368 [2019-12-27 06:17:14,110 INFO L226 Difference]: Without dead ends: 179319 [2019-12-27 06:17:14,111 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 06:17:20,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179319 states. [2019-12-27 06:17:23,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179319 to 163842. [2019-12-27 06:17:23,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163842 states. [2019-12-27 06:17:24,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163842 states to 163842 states and 684578 transitions. [2019-12-27 06:17:24,227 INFO L78 Accepts]: Start accepts. Automaton has 163842 states and 684578 transitions. Word has length 11 [2019-12-27 06:17:24,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:24,227 INFO L462 AbstractCegarLoop]: Abstraction has 163842 states and 684578 transitions. [2019-12-27 06:17:24,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:17:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 163842 states and 684578 transitions. [2019-12-27 06:17:24,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:17:24,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:24,234 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:24,234 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 06:17:24,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:24,235 INFO L82 PathProgramCache]: Analyzing trace with hash 245340836, now seen corresponding path program 1 times [2019-12-27 06:17:24,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:24,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477701974] [2019-12-27 06:17:24,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:24,309 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 06:17:24,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477701974] [2019-12-27 06:17:24,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:24,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:24,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469673925] [2019-12-27 06:17:24,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:24,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:24,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:24,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:24,313 INFO L87 Difference]: Start difference. First operand 163842 states and 684578 transitions. Second operand 3 states. [2019-12-27 06:17:24,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:24,453 INFO L93 Difference]: Finished difference Result 35474 states and 116324 transitions. [2019-12-27 06:17:24,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:24,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:17:24,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:29,556 INFO L225 Difference]: With dead ends: 35474 [2019-12-27 06:17:29,557 INFO L226 Difference]: Without dead ends: 35474 [2019-12-27 06:17:29,557 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 06:17:29,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35474 states. [2019-12-27 06:17:30,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35474 to 35474. [2019-12-27 06:17:30,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35474 states. [2019-12-27 06:17:30,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35474 states to 35474 states and 116324 transitions. [2019-12-27 06:17:30,159 INFO L78 Accepts]: Start accepts. Automaton has 35474 states and 116324 transitions. Word has length 13 [2019-12-27 06:17:30,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:30,160 INFO L462 AbstractCegarLoop]: Abstraction has 35474 states and 116324 transitions. [2019-12-27 06:17:30,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:30,160 INFO L276 IsEmpty]: Start isEmpty. Operand 35474 states and 116324 transitions. [2019-12-27 06:17:30,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:17:30,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:30,163 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:30,163 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 06:17:30,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:30,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1764199357, now seen corresponding path program 1 times [2019-12-27 06:17:30,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:30,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96173019] [2019-12-27 06:17:30,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:30,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 06:17:30,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96173019] [2019-12-27 06:17:30,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:30,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:30,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566905671] [2019-12-27 06:17:30,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:30,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:30,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:30,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:30,229 INFO L87 Difference]: Start difference. First operand 35474 states and 116324 transitions. Second operand 3 states. [2019-12-27 06:17:30,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:30,461 INFO L93 Difference]: Finished difference Result 53873 states and 176061 transitions. [2019-12-27 06:17:30,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:30,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 06:17:30,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:30,554 INFO L225 Difference]: With dead ends: 53873 [2019-12-27 06:17:30,554 INFO L226 Difference]: Without dead ends: 53873 [2019-12-27 06:17:30,555 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 06:17:30,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53873 states. [2019-12-27 06:17:31,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53873 to 40386. [2019-12-27 06:17:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40386 states. [2019-12-27 06:17:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40386 states to 40386 states and 133919 transitions. [2019-12-27 06:17:31,781 INFO L78 Accepts]: Start accepts. Automaton has 40386 states and 133919 transitions. Word has length 16 [2019-12-27 06:17:31,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:31,782 INFO L462 AbstractCegarLoop]: Abstraction has 40386 states and 133919 transitions. [2019-12-27 06:17:31,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:31,782 INFO L276 IsEmpty]: Start isEmpty. Operand 40386 states and 133919 transitions. [2019-12-27 06:17:31,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:17:31,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:31,785 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:31,785 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 06:17:31,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:31,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1679414171, now seen corresponding path program 1 times [2019-12-27 06:17:31,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:31,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982115010] [2019-12-27 06:17:31,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:31,879 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 06:17:31,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982115010] [2019-12-27 06:17:31,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:31,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:31,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258379118] [2019-12-27 06:17:31,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:17:31,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:31,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:17:31,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:17:31,881 INFO L87 Difference]: Start difference. First operand 40386 states and 133919 transitions. Second operand 4 states. [2019-12-27 06:17:32,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:32,292 INFO L93 Difference]: Finished difference Result 48153 states and 157153 transitions. [2019-12-27 06:17:32,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:17:32,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:17:32,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:32,376 INFO L225 Difference]: With dead ends: 48153 [2019-12-27 06:17:32,376 INFO L226 Difference]: Without dead ends: 48153 [2019-12-27 06:17:32,376 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 06:17:32,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48153 states. [2019-12-27 06:17:33,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48153 to 44290. [2019-12-27 06:17:33,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44290 states. [2019-12-27 06:17:33,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44290 states to 44290 states and 145673 transitions. [2019-12-27 06:17:33,169 INFO L78 Accepts]: Start accepts. Automaton has 44290 states and 145673 transitions. Word has length 16 [2019-12-27 06:17:33,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:33,170 INFO L462 AbstractCegarLoop]: Abstraction has 44290 states and 145673 transitions. [2019-12-27 06:17:33,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:17:33,170 INFO L276 IsEmpty]: Start isEmpty. Operand 44290 states and 145673 transitions. [2019-12-27 06:17:33,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:17:33,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:33,174 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:33,174 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 06:17:33,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:33,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1745863415, now seen corresponding path program 1 times [2019-12-27 06:17:33,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:33,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035068468] [2019-12-27 06:17:33,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:33,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 06:17:33,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035068468] [2019-12-27 06:17:33,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:33,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:33,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634396277] [2019-12-27 06:17:33,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:17:33,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:33,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:17:33,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:17:33,234 INFO L87 Difference]: Start difference. First operand 44290 states and 145673 transitions. Second operand 4 states. [2019-12-27 06:17:33,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:33,608 INFO L93 Difference]: Finished difference Result 52593 states and 171527 transitions. [2019-12-27 06:17:33,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:17:33,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:17:33,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:33,697 INFO L225 Difference]: With dead ends: 52593 [2019-12-27 06:17:33,697 INFO L226 Difference]: Without dead ends: 52593 [2019-12-27 06:17:33,697 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 06:17:33,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52593 states. [2019-12-27 06:17:34,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52593 to 45862. [2019-12-27 06:17:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45862 states. [2019-12-27 06:17:34,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45862 states to 45862 states and 150892 transitions. [2019-12-27 06:17:34,794 INFO L78 Accepts]: Start accepts. Automaton has 45862 states and 150892 transitions. Word has length 16 [2019-12-27 06:17:34,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:34,795 INFO L462 AbstractCegarLoop]: Abstraction has 45862 states and 150892 transitions. [2019-12-27 06:17:34,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:17:34,795 INFO L276 IsEmpty]: Start isEmpty. Operand 45862 states and 150892 transitions. [2019-12-27 06:17:34,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:17:34,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:34,804 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 06:17:34,805 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 06:17:34,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:34,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1921236917, now seen corresponding path program 1 times [2019-12-27 06:17:34,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:34,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199489423] [2019-12-27 06:17:34,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:34,889 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 06:17:34,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199489423] [2019-12-27 06:17:34,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:34,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:34,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569947927] [2019-12-27 06:17:34,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:17:34,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:34,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:17:34,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:34,892 INFO L87 Difference]: Start difference. First operand 45862 states and 150892 transitions. Second operand 5 states. [2019-12-27 06:17:35,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:35,540 INFO L93 Difference]: Finished difference Result 62673 states and 200938 transitions. [2019-12-27 06:17:35,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:17:35,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 06:17:35,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:35,645 INFO L225 Difference]: With dead ends: 62673 [2019-12-27 06:17:35,645 INFO L226 Difference]: Without dead ends: 62666 [2019-12-27 06:17:35,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:17:35,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62666 states. [2019-12-27 06:17:36,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62666 to 47202. [2019-12-27 06:17:36,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47202 states. [2019-12-27 06:17:37,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47202 states to 47202 states and 154985 transitions. [2019-12-27 06:17:37,121 INFO L78 Accepts]: Start accepts. Automaton has 47202 states and 154985 transitions. Word has length 22 [2019-12-27 06:17:37,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:37,122 INFO L462 AbstractCegarLoop]: Abstraction has 47202 states and 154985 transitions. [2019-12-27 06:17:37,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:17:37,122 INFO L276 IsEmpty]: Start isEmpty. Operand 47202 states and 154985 transitions. [2019-12-27 06:17:37,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:17:37,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:37,132 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 06:17:37,132 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 06:17:37,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:37,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1854787673, now seen corresponding path program 1 times [2019-12-27 06:17:37,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:37,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205710981] [2019-12-27 06:17:37,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:37,241 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 06:17:37,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205710981] [2019-12-27 06:17:37,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:37,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:37,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573318922] [2019-12-27 06:17:37,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:17:37,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:37,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:17:37,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:37,244 INFO L87 Difference]: Start difference. First operand 47202 states and 154985 transitions. Second operand 5 states. [2019-12-27 06:17:37,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:37,981 INFO L93 Difference]: Finished difference Result 65940 states and 210721 transitions. [2019-12-27 06:17:37,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:17:37,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 06:17:37,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:38,161 INFO L225 Difference]: With dead ends: 65940 [2019-12-27 06:17:38,161 INFO L226 Difference]: Without dead ends: 65933 [2019-12-27 06:17:38,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:17:38,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65933 states. [2019-12-27 06:17:39,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65933 to 45465. [2019-12-27 06:17:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45465 states. [2019-12-27 06:17:39,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45465 states to 45465 states and 149394 transitions. [2019-12-27 06:17:39,214 INFO L78 Accepts]: Start accepts. Automaton has 45465 states and 149394 transitions. Word has length 22 [2019-12-27 06:17:39,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:39,215 INFO L462 AbstractCegarLoop]: Abstraction has 45465 states and 149394 transitions. [2019-12-27 06:17:39,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:17:39,215 INFO L276 IsEmpty]: Start isEmpty. Operand 45465 states and 149394 transitions. [2019-12-27 06:17:39,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:17:39,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:39,227 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 06:17:39,227 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 06:17:39,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:39,228 INFO L82 PathProgramCache]: Analyzing trace with hash 145172187, now seen corresponding path program 1 times [2019-12-27 06:17:39,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:39,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714572016] [2019-12-27 06:17:39,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:39,271 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 06:17:39,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714572016] [2019-12-27 06:17:39,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:39,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:39,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497838163] [2019-12-27 06:17:39,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:17:39,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:39,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:17:39,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:17:39,273 INFO L87 Difference]: Start difference. First operand 45465 states and 149394 transitions. Second operand 4 states. [2019-12-27 06:17:39,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:39,376 INFO L93 Difference]: Finished difference Result 18727 states and 58359 transitions. [2019-12-27 06:17:39,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:17:39,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:17:39,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:39,419 INFO L225 Difference]: With dead ends: 18727 [2019-12-27 06:17:39,419 INFO L226 Difference]: Without dead ends: 18727 [2019-12-27 06:17:39,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:17:39,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18727 states. [2019-12-27 06:17:39,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18727 to 18364. [2019-12-27 06:17:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18364 states. [2019-12-27 06:17:39,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18364 states to 18364 states and 57323 transitions. [2019-12-27 06:17:39,803 INFO L78 Accepts]: Start accepts. Automaton has 18364 states and 57323 transitions. Word has length 25 [2019-12-27 06:17:39,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:39,804 INFO L462 AbstractCegarLoop]: Abstraction has 18364 states and 57323 transitions. [2019-12-27 06:17:39,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:17:39,804 INFO L276 IsEmpty]: Start isEmpty. Operand 18364 states and 57323 transitions. [2019-12-27 06:17:39,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:17:39,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:39,818 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 06:17:39,818 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 06:17:39,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:39,818 INFO L82 PathProgramCache]: Analyzing trace with hash -2016642455, now seen corresponding path program 1 times [2019-12-27 06:17:39,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:39,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945884997] [2019-12-27 06:17:39,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:39,852 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 06:17:39,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945884997] [2019-12-27 06:17:39,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:39,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:39,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366810809] [2019-12-27 06:17:39,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:39,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:39,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:39,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:39,855 INFO L87 Difference]: Start difference. First operand 18364 states and 57323 transitions. Second operand 3 states. [2019-12-27 06:17:39,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:39,982 INFO L93 Difference]: Finished difference Result 24105 states and 71434 transitions. [2019-12-27 06:17:39,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:39,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 06:17:39,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:40,024 INFO L225 Difference]: With dead ends: 24105 [2019-12-27 06:17:40,025 INFO L226 Difference]: Without dead ends: 24105 [2019-12-27 06:17:40,025 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 06:17:40,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24105 states. [2019-12-27 06:17:40,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24105 to 18364. [2019-12-27 06:17:40,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18364 states. [2019-12-27 06:17:40,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18364 states to 18364 states and 54802 transitions. [2019-12-27 06:17:40,467 INFO L78 Accepts]: Start accepts. Automaton has 18364 states and 54802 transitions. Word has length 27 [2019-12-27 06:17:40,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:40,467 INFO L462 AbstractCegarLoop]: Abstraction has 18364 states and 54802 transitions. [2019-12-27 06:17:40,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:40,467 INFO L276 IsEmpty]: Start isEmpty. Operand 18364 states and 54802 transitions. [2019-12-27 06:17:40,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:17:40,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:40,479 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 06:17:40,480 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 06:17:40,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:40,480 INFO L82 PathProgramCache]: Analyzing trace with hash -364349975, now seen corresponding path program 1 times [2019-12-27 06:17:40,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:40,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202196460] [2019-12-27 06:17:40,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:40,546 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 06:17:40,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202196460] [2019-12-27 06:17:40,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:40,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:40,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464674895] [2019-12-27 06:17:40,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:17:40,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:40,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:17:40,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:40,548 INFO L87 Difference]: Start difference. First operand 18364 states and 54802 transitions. Second operand 5 states. [2019-12-27 06:17:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:40,879 INFO L93 Difference]: Finished difference Result 22570 states and 66509 transitions. [2019-12-27 06:17:40,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:17:40,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 06:17:40,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:40,910 INFO L225 Difference]: With dead ends: 22570 [2019-12-27 06:17:40,911 INFO L226 Difference]: Without dead ends: 22570 [2019-12-27 06:17:40,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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 06:17:41,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22570 states. [2019-12-27 06:17:41,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22570 to 21200. [2019-12-27 06:17:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21200 states. [2019-12-27 06:17:41,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21200 states to 21200 states and 63046 transitions. [2019-12-27 06:17:41,253 INFO L78 Accepts]: Start accepts. Automaton has 21200 states and 63046 transitions. Word has length 27 [2019-12-27 06:17:41,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:41,253 INFO L462 AbstractCegarLoop]: Abstraction has 21200 states and 63046 transitions. [2019-12-27 06:17:41,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:17:41,253 INFO L276 IsEmpty]: Start isEmpty. Operand 21200 states and 63046 transitions. [2019-12-27 06:17:41,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 06:17:41,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:41,268 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 06:17:41,268 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 06:17:41,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:41,269 INFO L82 PathProgramCache]: Analyzing trace with hash 587647727, now seen corresponding path program 1 times [2019-12-27 06:17:41,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:41,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50399256] [2019-12-27 06:17:41,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:41,329 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 06:17:41,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50399256] [2019-12-27 06:17:41,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:41,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:41,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108011559] [2019-12-27 06:17:41,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:17:41,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:41,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:17:41,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:41,331 INFO L87 Difference]: Start difference. First operand 21200 states and 63046 transitions. Second operand 5 states. [2019-12-27 06:17:41,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:41,675 INFO L93 Difference]: Finished difference Result 24672 states and 72522 transitions. [2019-12-27 06:17:41,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:17:41,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 06:17:41,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:41,719 INFO L225 Difference]: With dead ends: 24672 [2019-12-27 06:17:41,720 INFO L226 Difference]: Without dead ends: 24672 [2019-12-27 06:17:41,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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 06:17:41,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24672 states. [2019-12-27 06:17:42,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24672 to 21106. [2019-12-27 06:17:42,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21106 states. [2019-12-27 06:17:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21106 states to 21106 states and 62614 transitions. [2019-12-27 06:17:42,058 INFO L78 Accepts]: Start accepts. Automaton has 21106 states and 62614 transitions. Word has length 28 [2019-12-27 06:17:42,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:42,058 INFO L462 AbstractCegarLoop]: Abstraction has 21106 states and 62614 transitions. [2019-12-27 06:17:42,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:17:42,058 INFO L276 IsEmpty]: Start isEmpty. Operand 21106 states and 62614 transitions. [2019-12-27 06:17:42,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:17:42,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:42,078 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 06:17:42,078 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 06:17:42,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:42,079 INFO L82 PathProgramCache]: Analyzing trace with hash 688173209, now seen corresponding path program 1 times [2019-12-27 06:17:42,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:42,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044837670] [2019-12-27 06:17:42,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:42,145 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 06:17:42,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044837670] [2019-12-27 06:17:42,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:42,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:17:42,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119845771] [2019-12-27 06:17:42,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:17:42,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:42,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:17:42,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:17:42,147 INFO L87 Difference]: Start difference. First operand 21106 states and 62614 transitions. Second operand 6 states. [2019-12-27 06:17:42,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:42,861 INFO L93 Difference]: Finished difference Result 28374 states and 82992 transitions. [2019-12-27 06:17:42,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:17:42,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 06:17:42,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:42,902 INFO L225 Difference]: With dead ends: 28374 [2019-12-27 06:17:42,902 INFO L226 Difference]: Without dead ends: 28374 [2019-12-27 06:17:42,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:17:43,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28374 states. [2019-12-27 06:17:43,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28374 to 22550. [2019-12-27 06:17:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22550 states. [2019-12-27 06:17:43,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22550 states to 22550 states and 66975 transitions. [2019-12-27 06:17:43,297 INFO L78 Accepts]: Start accepts. Automaton has 22550 states and 66975 transitions. Word has length 33 [2019-12-27 06:17:43,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:43,298 INFO L462 AbstractCegarLoop]: Abstraction has 22550 states and 66975 transitions. [2019-12-27 06:17:43,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:17:43,298 INFO L276 IsEmpty]: Start isEmpty. Operand 22550 states and 66975 transitions. [2019-12-27 06:17:43,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 06:17:43,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:43,318 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 06:17:43,318 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 06:17:43,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:43,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1143871937, now seen corresponding path program 1 times [2019-12-27 06:17:43,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:43,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933625481] [2019-12-27 06:17:43,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:43,436 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 06:17:43,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933625481] [2019-12-27 06:17:43,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:43,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:17:43,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28680627] [2019-12-27 06:17:43,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:17:43,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:43,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:17:43,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:17:43,438 INFO L87 Difference]: Start difference. First operand 22550 states and 66975 transitions. Second operand 6 states. [2019-12-27 06:17:44,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:44,281 INFO L93 Difference]: Finished difference Result 27535 states and 80686 transitions. [2019-12-27 06:17:44,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:17:44,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 06:17:44,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:44,337 INFO L225 Difference]: With dead ends: 27535 [2019-12-27 06:17:44,337 INFO L226 Difference]: Without dead ends: 27535 [2019-12-27 06:17:44,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:17:44,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27535 states. [2019-12-27 06:17:44,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27535 to 19269. [2019-12-27 06:17:44,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19269 states. [2019-12-27 06:17:44,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19269 states to 19269 states and 57413 transitions. [2019-12-27 06:17:44,723 INFO L78 Accepts]: Start accepts. Automaton has 19269 states and 57413 transitions. Word has length 34 [2019-12-27 06:17:44,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:44,724 INFO L462 AbstractCegarLoop]: Abstraction has 19269 states and 57413 transitions. [2019-12-27 06:17:44,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:17:44,724 INFO L276 IsEmpty]: Start isEmpty. Operand 19269 states and 57413 transitions. [2019-12-27 06:17:44,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:17:44,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:44,744 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 06:17:44,744 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 06:17:44,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:44,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1024843726, now seen corresponding path program 1 times [2019-12-27 06:17:44,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:44,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637055981] [2019-12-27 06:17:44,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:44,792 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 06:17:44,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637055981] [2019-12-27 06:17:44,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:44,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:17:44,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161310394] [2019-12-27 06:17:44,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:44,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:44,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:44,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:44,794 INFO L87 Difference]: Start difference. First operand 19269 states and 57413 transitions. Second operand 3 states. [2019-12-27 06:17:44,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:44,884 INFO L93 Difference]: Finished difference Result 19268 states and 57411 transitions. [2019-12-27 06:17:44,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:44,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 06:17:44,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:44,917 INFO L225 Difference]: With dead ends: 19268 [2019-12-27 06:17:44,917 INFO L226 Difference]: Without dead ends: 19268 [2019-12-27 06:17:44,920 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 06:17:45,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19268 states. [2019-12-27 06:17:45,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19268 to 19268. [2019-12-27 06:17:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19268 states. [2019-12-27 06:17:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19268 states to 19268 states and 57411 transitions. [2019-12-27 06:17:45,206 INFO L78 Accepts]: Start accepts. Automaton has 19268 states and 57411 transitions. Word has length 39 [2019-12-27 06:17:45,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:45,207 INFO L462 AbstractCegarLoop]: Abstraction has 19268 states and 57411 transitions. [2019-12-27 06:17:45,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:45,207 INFO L276 IsEmpty]: Start isEmpty. Operand 19268 states and 57411 transitions. [2019-12-27 06:17:45,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 06:17:45,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:45,227 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 06:17:45,227 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 06:17:45,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:45,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1293195895, now seen corresponding path program 1 times [2019-12-27 06:17:45,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:45,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155043957] [2019-12-27 06:17:45,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:45,310 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 06:17:45,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155043957] [2019-12-27 06:17:45,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:45,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:45,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135744642] [2019-12-27 06:17:45,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:45,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:45,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:45,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:45,314 INFO L87 Difference]: Start difference. First operand 19268 states and 57411 transitions. Second operand 3 states. [2019-12-27 06:17:45,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:45,402 INFO L93 Difference]: Finished difference Result 19268 states and 57334 transitions. [2019-12-27 06:17:45,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:45,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 06:17:45,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:45,440 INFO L225 Difference]: With dead ends: 19268 [2019-12-27 06:17:45,440 INFO L226 Difference]: Without dead ends: 19268 [2019-12-27 06:17:45,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:45,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19268 states. [2019-12-27 06:17:45,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19268 to 17219. [2019-12-27 06:17:45,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17219 states. [2019-12-27 06:17:45,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17219 states to 17219 states and 51708 transitions. [2019-12-27 06:17:45,908 INFO L78 Accepts]: Start accepts. Automaton has 17219 states and 51708 transitions. Word has length 40 [2019-12-27 06:17:45,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:45,908 INFO L462 AbstractCegarLoop]: Abstraction has 17219 states and 51708 transitions. [2019-12-27 06:17:45,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:45,908 INFO L276 IsEmpty]: Start isEmpty. Operand 17219 states and 51708 transitions. [2019-12-27 06:17:45,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 06:17:45,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:45,932 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 06:17:45,932 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 06:17:45,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:45,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1998295176, now seen corresponding path program 1 times [2019-12-27 06:17:45,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:45,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143630991] [2019-12-27 06:17:45,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:46,000 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 06:17:46,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143630991] [2019-12-27 06:17:46,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:46,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:17:46,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293527635] [2019-12-27 06:17:46,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:17:46,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:46,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:17:46,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:46,003 INFO L87 Difference]: Start difference. First operand 17219 states and 51708 transitions. Second operand 5 states. [2019-12-27 06:17:46,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:46,086 INFO L93 Difference]: Finished difference Result 16023 states and 49133 transitions. [2019-12-27 06:17:46,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:17:46,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 06:17:46,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:46,109 INFO L225 Difference]: With dead ends: 16023 [2019-12-27 06:17:46,110 INFO L226 Difference]: Without dead ends: 16023 [2019-12-27 06:17:46,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:46,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16023 states. [2019-12-27 06:17:46,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16023 to 16023. [2019-12-27 06:17:46,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16023 states. [2019-12-27 06:17:46,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16023 states to 16023 states and 49133 transitions. [2019-12-27 06:17:46,371 INFO L78 Accepts]: Start accepts. Automaton has 16023 states and 49133 transitions. Word has length 41 [2019-12-27 06:17:46,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:46,371 INFO L462 AbstractCegarLoop]: Abstraction has 16023 states and 49133 transitions. [2019-12-27 06:17:46,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:17:46,371 INFO L276 IsEmpty]: Start isEmpty. Operand 16023 states and 49133 transitions. [2019-12-27 06:17:46,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:17:46,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:46,392 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] [2019-12-27 06:17:46,393 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 06:17:46,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:46,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1498292074, now seen corresponding path program 1 times [2019-12-27 06:17:46,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:46,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765881856] [2019-12-27 06:17:46,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:46,487 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 06:17:46,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765881856] [2019-12-27 06:17:46,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:46,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:17:46,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394501251] [2019-12-27 06:17:46,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:17:46,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:46,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:17:46,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:17:46,489 INFO L87 Difference]: Start difference. First operand 16023 states and 49133 transitions. Second operand 7 states. [2019-12-27 06:17:46,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:46,951 INFO L93 Difference]: Finished difference Result 44825 states and 136460 transitions. [2019-12-27 06:17:46,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:17:46,951 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 06:17:46,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:47,000 INFO L225 Difference]: With dead ends: 44825 [2019-12-27 06:17:47,000 INFO L226 Difference]: Without dead ends: 34913 [2019-12-27 06:17:47,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:17:47,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34913 states. [2019-12-27 06:17:47,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34913 to 19456. [2019-12-27 06:17:47,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19456 states. [2019-12-27 06:17:47,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19456 states to 19456 states and 59789 transitions. [2019-12-27 06:17:47,575 INFO L78 Accepts]: Start accepts. Automaton has 19456 states and 59789 transitions. Word has length 65 [2019-12-27 06:17:47,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:47,575 INFO L462 AbstractCegarLoop]: Abstraction has 19456 states and 59789 transitions. [2019-12-27 06:17:47,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:17:47,575 INFO L276 IsEmpty]: Start isEmpty. Operand 19456 states and 59789 transitions. [2019-12-27 06:17:47,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:17:47,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:47,594 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] [2019-12-27 06:17:47,594 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 06:17:47,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:47,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1514990150, now seen corresponding path program 2 times [2019-12-27 06:17:47,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:47,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296890153] [2019-12-27 06:17:47,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:47,678 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 06:17:47,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296890153] [2019-12-27 06:17:47,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:47,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:17:47,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304001248] [2019-12-27 06:17:47,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:17:47,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:47,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:17:47,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:17:47,680 INFO L87 Difference]: Start difference. First operand 19456 states and 59789 transitions. Second operand 7 states. [2019-12-27 06:17:48,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:48,206 INFO L93 Difference]: Finished difference Result 51791 states and 156015 transitions. [2019-12-27 06:17:48,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:17:48,207 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 06:17:48,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:48,286 INFO L225 Difference]: With dead ends: 51791 [2019-12-27 06:17:48,286 INFO L226 Difference]: Without dead ends: 38002 [2019-12-27 06:17:48,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:17:48,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38002 states. [2019-12-27 06:17:48,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38002 to 23226. [2019-12-27 06:17:48,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23226 states. [2019-12-27 06:17:48,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23226 states to 23226 states and 70989 transitions. [2019-12-27 06:17:48,844 INFO L78 Accepts]: Start accepts. Automaton has 23226 states and 70989 transitions. Word has length 65 [2019-12-27 06:17:48,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:48,844 INFO L462 AbstractCegarLoop]: Abstraction has 23226 states and 70989 transitions. [2019-12-27 06:17:48,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:17:48,845 INFO L276 IsEmpty]: Start isEmpty. Operand 23226 states and 70989 transitions. [2019-12-27 06:17:48,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:17:48,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:48,872 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] [2019-12-27 06:17:48,872 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 06:17:48,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:48,872 INFO L82 PathProgramCache]: Analyzing trace with hash -118142618, now seen corresponding path program 3 times [2019-12-27 06:17:48,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:48,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548477909] [2019-12-27 06:17:48,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:48,951 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 06:17:48,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548477909] [2019-12-27 06:17:48,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:48,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:17:48,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972999888] [2019-12-27 06:17:48,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:17:48,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:48,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:17:48,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:17:48,953 INFO L87 Difference]: Start difference. First operand 23226 states and 70989 transitions. Second operand 7 states. [2019-12-27 06:17:49,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:49,435 INFO L93 Difference]: Finished difference Result 43950 states and 132286 transitions. [2019-12-27 06:17:49,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 06:17:49,437 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 06:17:49,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:49,493 INFO L225 Difference]: With dead ends: 43950 [2019-12-27 06:17:49,494 INFO L226 Difference]: Without dead ends: 41239 [2019-12-27 06:17:49,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:17:49,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41239 states. [2019-12-27 06:17:49,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41239 to 23322. [2019-12-27 06:17:49,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23322 states. [2019-12-27 06:17:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23322 states to 23322 states and 71333 transitions. [2019-12-27 06:17:49,987 INFO L78 Accepts]: Start accepts. Automaton has 23322 states and 71333 transitions. Word has length 65 [2019-12-27 06:17:49,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:49,987 INFO L462 AbstractCegarLoop]: Abstraction has 23322 states and 71333 transitions. [2019-12-27 06:17:49,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:17:49,988 INFO L276 IsEmpty]: Start isEmpty. Operand 23322 states and 71333 transitions. [2019-12-27 06:17:50,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:17:50,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:50,010 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] [2019-12-27 06:17:50,010 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 06:17:50,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:50,011 INFO L82 PathProgramCache]: Analyzing trace with hash 659589900, now seen corresponding path program 4 times [2019-12-27 06:17:50,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:50,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809461087] [2019-12-27 06:17:50,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:50,071 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 06:17:50,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809461087] [2019-12-27 06:17:50,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:50,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:50,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442181689] [2019-12-27 06:17:50,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:50,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:50,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:50,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:50,074 INFO L87 Difference]: Start difference. First operand 23322 states and 71333 transitions. Second operand 3 states. [2019-12-27 06:17:50,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:50,212 INFO L93 Difference]: Finished difference Result 26589 states and 81440 transitions. [2019-12-27 06:17:50,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:50,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:17:50,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:50,247 INFO L225 Difference]: With dead ends: 26589 [2019-12-27 06:17:50,248 INFO L226 Difference]: Without dead ends: 26589 [2019-12-27 06:17:50,248 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 06:17:50,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26589 states. [2019-12-27 06:17:50,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26589 to 22041. [2019-12-27 06:17:50,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22041 states. [2019-12-27 06:17:50,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22041 states to 22041 states and 68216 transitions. [2019-12-27 06:17:50,759 INFO L78 Accepts]: Start accepts. Automaton has 22041 states and 68216 transitions. Word has length 65 [2019-12-27 06:17:50,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:50,759 INFO L462 AbstractCegarLoop]: Abstraction has 22041 states and 68216 transitions. [2019-12-27 06:17:50,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:50,760 INFO L276 IsEmpty]: Start isEmpty. Operand 22041 states and 68216 transitions. [2019-12-27 06:17:50,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:17:50,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:50,788 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 06:17:50,788 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 06:17:50,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:50,788 INFO L82 PathProgramCache]: Analyzing trace with hash -212190394, now seen corresponding path program 1 times [2019-12-27 06:17:50,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:50,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360817758] [2019-12-27 06:17:50,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:50,830 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 06:17:50,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360817758] [2019-12-27 06:17:50,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:50,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:50,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140656914] [2019-12-27 06:17:50,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:50,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:50,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:50,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:50,832 INFO L87 Difference]: Start difference. First operand 22041 states and 68216 transitions. Second operand 3 states. [2019-12-27 06:17:51,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:51,109 INFO L93 Difference]: Finished difference Result 30320 states and 94017 transitions. [2019-12-27 06:17:51,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:51,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 06:17:51,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:51,186 INFO L225 Difference]: With dead ends: 30320 [2019-12-27 06:17:51,186 INFO L226 Difference]: Without dead ends: 30320 [2019-12-27 06:17:51,187 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 06:17:51,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30320 states. [2019-12-27 06:17:51,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30320 to 22586. [2019-12-27 06:17:51,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22586 states. [2019-12-27 06:17:51,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22586 states to 22586 states and 69961 transitions. [2019-12-27 06:17:51,948 INFO L78 Accepts]: Start accepts. Automaton has 22586 states and 69961 transitions. Word has length 66 [2019-12-27 06:17:51,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:51,949 INFO L462 AbstractCegarLoop]: Abstraction has 22586 states and 69961 transitions. [2019-12-27 06:17:51,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:51,949 INFO L276 IsEmpty]: Start isEmpty. Operand 22586 states and 69961 transitions. [2019-12-27 06:17:51,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:17:51,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:51,981 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 06:17:51,982 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 06:17:51,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:51,982 INFO L82 PathProgramCache]: Analyzing trace with hash -195192520, now seen corresponding path program 2 times [2019-12-27 06:17:51,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:51,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29809342] [2019-12-27 06:17:51,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:52,062 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 06:17:52,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29809342] [2019-12-27 06:17:52,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:52,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:17:52,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985748262] [2019-12-27 06:17:52,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:17:52,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:52,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:17:52,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:17:52,068 INFO L87 Difference]: Start difference. First operand 22586 states and 69961 transitions. Second operand 7 states. [2019-12-27 06:17:52,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:52,524 INFO L93 Difference]: Finished difference Result 47256 states and 145217 transitions. [2019-12-27 06:17:52,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 06:17:52,524 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 06:17:52,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:52,585 INFO L225 Difference]: With dead ends: 47256 [2019-12-27 06:17:52,585 INFO L226 Difference]: Without dead ends: 43446 [2019-12-27 06:17:52,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:17:52,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43446 states. [2019-12-27 06:17:53,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43446 to 22730. [2019-12-27 06:17:53,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22730 states. [2019-12-27 06:17:53,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22730 states to 22730 states and 70519 transitions. [2019-12-27 06:17:53,093 INFO L78 Accepts]: Start accepts. Automaton has 22730 states and 70519 transitions. Word has length 66 [2019-12-27 06:17:53,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:53,093 INFO L462 AbstractCegarLoop]: Abstraction has 22730 states and 70519 transitions. [2019-12-27 06:17:53,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:17:53,093 INFO L276 IsEmpty]: Start isEmpty. Operand 22730 states and 70519 transitions. [2019-12-27 06:17:53,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:17:53,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:53,123 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 06:17:53,123 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 06:17:53,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:53,123 INFO L82 PathProgramCache]: Analyzing trace with hash -384910392, now seen corresponding path program 3 times [2019-12-27 06:17:53,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:53,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903868942] [2019-12-27 06:17:53,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:53,187 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 06:17:53,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903868942] [2019-12-27 06:17:53,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:53,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:53,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903727736] [2019-12-27 06:17:53,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:17:53,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:53,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:17:53,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:17:53,189 INFO L87 Difference]: Start difference. First operand 22730 states and 70519 transitions. Second operand 4 states. [2019-12-27 06:17:53,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:53,361 INFO L93 Difference]: Finished difference Result 22532 states and 69731 transitions. [2019-12-27 06:17:53,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:17:53,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 06:17:53,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:53,401 INFO L225 Difference]: With dead ends: 22532 [2019-12-27 06:17:53,401 INFO L226 Difference]: Without dead ends: 22532 [2019-12-27 06:17:53,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:53,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22532 states. [2019-12-27 06:17:53,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22532 to 20694. [2019-12-27 06:17:53,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20694 states. [2019-12-27 06:17:53,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20694 states to 20694 states and 63965 transitions. [2019-12-27 06:17:53,764 INFO L78 Accepts]: Start accepts. Automaton has 20694 states and 63965 transitions. Word has length 66 [2019-12-27 06:17:53,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:53,764 INFO L462 AbstractCegarLoop]: Abstraction has 20694 states and 63965 transitions. [2019-12-27 06:17:53,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:17:53,767 INFO L276 IsEmpty]: Start isEmpty. Operand 20694 states and 63965 transitions. [2019-12-27 06:17:53,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:17:53,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:53,798 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 06:17:53,798 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 06:17:53,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:53,799 INFO L82 PathProgramCache]: Analyzing trace with hash -112199822, now seen corresponding path program 1 times [2019-12-27 06:17:53,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:53,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754176915] [2019-12-27 06:17:53,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:53,853 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 06:17:53,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754176915] [2019-12-27 06:17:53,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:53,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:53,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398828852] [2019-12-27 06:17:53,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:53,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:53,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:53,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:53,855 INFO L87 Difference]: Start difference. First operand 20694 states and 63965 transitions. Second operand 3 states. [2019-12-27 06:17:54,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:54,063 INFO L93 Difference]: Finished difference Result 17107 states and 51679 transitions. [2019-12-27 06:17:54,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:54,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 06:17:54,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:54,101 INFO L225 Difference]: With dead ends: 17107 [2019-12-27 06:17:54,102 INFO L226 Difference]: Without dead ends: 17107 [2019-12-27 06:17:54,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:54,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17107 states. [2019-12-27 06:17:54,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17107 to 15439. [2019-12-27 06:17:54,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15439 states. [2019-12-27 06:17:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15439 states to 15439 states and 46585 transitions. [2019-12-27 06:17:54,517 INFO L78 Accepts]: Start accepts. Automaton has 15439 states and 46585 transitions. Word has length 66 [2019-12-27 06:17:54,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:54,518 INFO L462 AbstractCegarLoop]: Abstraction has 15439 states and 46585 transitions. [2019-12-27 06:17:54,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:54,518 INFO L276 IsEmpty]: Start isEmpty. Operand 15439 states and 46585 transitions. [2019-12-27 06:17:54,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:17:54,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:54,540 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 06:17:54,540 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 06:17:54,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:54,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1013027499, now seen corresponding path program 1 times [2019-12-27 06:17:54,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:54,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255526903] [2019-12-27 06:17:54,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:54,723 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 06:17:54,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255526903] [2019-12-27 06:17:54,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:54,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:17:54,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033718181] [2019-12-27 06:17:54,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:17:54,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:54,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:17:54,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:17:54,725 INFO L87 Difference]: Start difference. First operand 15439 states and 46585 transitions. Second operand 10 states. [2019-12-27 06:17:55,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:55,955 INFO L93 Difference]: Finished difference Result 23020 states and 69118 transitions. [2019-12-27 06:17:55,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:17:55,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 06:17:55,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:55,983 INFO L225 Difference]: With dead ends: 23020 [2019-12-27 06:17:55,983 INFO L226 Difference]: Without dead ends: 18939 [2019-12-27 06:17:55,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:17:56,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18939 states. [2019-12-27 06:17:56,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18939 to 15789. [2019-12-27 06:17:56,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15789 states. [2019-12-27 06:17:56,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15789 states to 15789 states and 47542 transitions. [2019-12-27 06:17:56,239 INFO L78 Accepts]: Start accepts. Automaton has 15789 states and 47542 transitions. Word has length 67 [2019-12-27 06:17:56,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:56,239 INFO L462 AbstractCegarLoop]: Abstraction has 15789 states and 47542 transitions. [2019-12-27 06:17:56,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:17:56,239 INFO L276 IsEmpty]: Start isEmpty. Operand 15789 states and 47542 transitions. [2019-12-27 06:17:56,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:17:56,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:56,255 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 06:17:56,255 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 06:17:56,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:56,256 INFO L82 PathProgramCache]: Analyzing trace with hash 608064189, now seen corresponding path program 2 times [2019-12-27 06:17:56,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:56,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846552944] [2019-12-27 06:17:56,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:56,413 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 06:17:56,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846552944] [2019-12-27 06:17:56,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:56,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:17:56,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936390702] [2019-12-27 06:17:56,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:17:56,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:56,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:17:56,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:17:56,415 INFO L87 Difference]: Start difference. First operand 15789 states and 47542 transitions. Second operand 11 states. [2019-12-27 06:17:57,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:57,967 INFO L93 Difference]: Finished difference Result 23119 states and 68779 transitions. [2019-12-27 06:17:57,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 06:17:57,968 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 06:17:57,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:57,995 INFO L225 Difference]: With dead ends: 23119 [2019-12-27 06:17:57,995 INFO L226 Difference]: Without dead ends: 19934 [2019-12-27 06:17:57,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2019-12-27 06:17:58,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19934 states. [2019-12-27 06:17:58,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19934 to 15869. [2019-12-27 06:17:58,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15869 states. [2019-12-27 06:17:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15869 states to 15869 states and 47607 transitions. [2019-12-27 06:17:58,277 INFO L78 Accepts]: Start accepts. Automaton has 15869 states and 47607 transitions. Word has length 67 [2019-12-27 06:17:58,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:58,277 INFO L462 AbstractCegarLoop]: Abstraction has 15869 states and 47607 transitions. [2019-12-27 06:17:58,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:17:58,277 INFO L276 IsEmpty]: Start isEmpty. Operand 15869 states and 47607 transitions. [2019-12-27 06:17:58,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:17:58,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:58,295 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 06:17:58,295 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 06:17:58,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:58,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1394809923, now seen corresponding path program 3 times [2019-12-27 06:17:58,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:58,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4652291] [2019-12-27 06:17:58,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:58,699 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 06:17:58,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4652291] [2019-12-27 06:17:58,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:58,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 06:17:58,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110798777] [2019-12-27 06:17:58,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 06:17:58,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:58,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 06:17:58,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:17:58,701 INFO L87 Difference]: Start difference. First operand 15869 states and 47607 transitions. Second operand 15 states. [2019-12-27 06:18:04,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:04,484 INFO L93 Difference]: Finished difference Result 39170 states and 114493 transitions. [2019-12-27 06:18:04,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 06:18:04,485 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 06:18:04,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:04,529 INFO L225 Difference]: With dead ends: 39170 [2019-12-27 06:18:04,529 INFO L226 Difference]: Without dead ends: 33276 [2019-12-27 06:18:04,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1247 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=633, Invalid=3527, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 06:18:04,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33276 states. [2019-12-27 06:18:04,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33276 to 16966. [2019-12-27 06:18:04,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16966 states. [2019-12-27 06:18:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16966 states to 16966 states and 50511 transitions. [2019-12-27 06:18:04,893 INFO L78 Accepts]: Start accepts. Automaton has 16966 states and 50511 transitions. Word has length 67 [2019-12-27 06:18:04,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:04,893 INFO L462 AbstractCegarLoop]: Abstraction has 16966 states and 50511 transitions. [2019-12-27 06:18:04,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 06:18:04,893 INFO L276 IsEmpty]: Start isEmpty. Operand 16966 states and 50511 transitions. [2019-12-27 06:18:04,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:18:04,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:04,910 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 06:18:04,910 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:04,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:04,911 INFO L82 PathProgramCache]: Analyzing trace with hash -72502869, now seen corresponding path program 4 times [2019-12-27 06:18:04,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:04,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293012708] [2019-12-27 06:18:04,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:05,352 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 06:18:05,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293012708] [2019-12-27 06:18:05,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:05,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 06:18:05,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713932966] [2019-12-27 06:18:05,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 06:18:05,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:05,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 06:18:05,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:18:05,353 INFO L87 Difference]: Start difference. First operand 16966 states and 50511 transitions. Second operand 15 states. [2019-12-27 06:18:11,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:11,637 INFO L93 Difference]: Finished difference Result 40076 states and 117032 transitions. [2019-12-27 06:18:11,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 06:18:11,638 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 06:18:11,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:11,678 INFO L225 Difference]: With dead ends: 40076 [2019-12-27 06:18:11,678 INFO L226 Difference]: Without dead ends: 32441 [2019-12-27 06:18:11,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=602, Invalid=3430, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 06:18:11,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32441 states. [2019-12-27 06:18:11,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32441 to 16395. [2019-12-27 06:18:11,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16395 states. [2019-12-27 06:18:12,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16395 states to 16395 states and 48896 transitions. [2019-12-27 06:18:12,021 INFO L78 Accepts]: Start accepts. Automaton has 16395 states and 48896 transitions. Word has length 67 [2019-12-27 06:18:12,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:12,021 INFO L462 AbstractCegarLoop]: Abstraction has 16395 states and 48896 transitions. [2019-12-27 06:18:12,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 06:18:12,022 INFO L276 IsEmpty]: Start isEmpty. Operand 16395 states and 48896 transitions. [2019-12-27 06:18:12,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:18:12,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:12,038 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 06:18:12,038 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:12,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:12,038 INFO L82 PathProgramCache]: Analyzing trace with hash -746286385, now seen corresponding path program 5 times [2019-12-27 06:18:12,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:12,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066139898] [2019-12-27 06:18:12,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:12,544 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 06:18:12,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066139898] [2019-12-27 06:18:12,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:12,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 06:18:12,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180666903] [2019-12-27 06:18:12,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 06:18:12,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:12,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 06:18:12,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-27 06:18:12,546 INFO L87 Difference]: Start difference. First operand 16395 states and 48896 transitions. Second operand 17 states. [2019-12-27 06:18:16,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:16,334 INFO L93 Difference]: Finished difference Result 24451 states and 71748 transitions. [2019-12-27 06:18:16,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 06:18:16,334 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 06:18:16,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:16,365 INFO L225 Difference]: With dead ends: 24451 [2019-12-27 06:18:16,366 INFO L226 Difference]: Without dead ends: 23128 [2019-12-27 06:18:16,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=334, Invalid=1388, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 06:18:16,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23128 states. [2019-12-27 06:18:16,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23128 to 17541. [2019-12-27 06:18:16,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17541 states. [2019-12-27 06:18:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17541 states to 17541 states and 52163 transitions. [2019-12-27 06:18:16,664 INFO L78 Accepts]: Start accepts. Automaton has 17541 states and 52163 transitions. Word has length 67 [2019-12-27 06:18:16,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:16,664 INFO L462 AbstractCegarLoop]: Abstraction has 17541 states and 52163 transitions. [2019-12-27 06:18:16,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 06:18:16,664 INFO L276 IsEmpty]: Start isEmpty. Operand 17541 states and 52163 transitions. [2019-12-27 06:18:16,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:18:16,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:16,680 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 06:18:16,680 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:16,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:16,681 INFO L82 PathProgramCache]: Analyzing trace with hash 979265481, now seen corresponding path program 6 times [2019-12-27 06:18:16,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:16,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132092205] [2019-12-27 06:18:16,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:17,303 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 06:18:17,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132092205] [2019-12-27 06:18:17,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:17,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 06:18:17,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514750453] [2019-12-27 06:18:17,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 06:18:17,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:17,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 06:18:17,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-27 06:18:17,306 INFO L87 Difference]: Start difference. First operand 17541 states and 52163 transitions. Second operand 17 states. [2019-12-27 06:18:21,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:21,468 INFO L93 Difference]: Finished difference Result 25126 states and 73636 transitions. [2019-12-27 06:18:21,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 06:18:21,468 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 06:18:21,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:21,500 INFO L225 Difference]: With dead ends: 25126 [2019-12-27 06:18:21,500 INFO L226 Difference]: Without dead ends: 24183 [2019-12-27 06:18:21,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=342, Invalid=1550, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 06:18:21,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24183 states. [2019-12-27 06:18:21,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24183 to 17497. [2019-12-27 06:18:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17497 states. [2019-12-27 06:18:21,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17497 states to 17497 states and 52038 transitions. [2019-12-27 06:18:21,815 INFO L78 Accepts]: Start accepts. Automaton has 17497 states and 52038 transitions. Word has length 67 [2019-12-27 06:18:21,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:21,815 INFO L462 AbstractCegarLoop]: Abstraction has 17497 states and 52038 transitions. [2019-12-27 06:18:21,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 06:18:21,815 INFO L276 IsEmpty]: Start isEmpty. Operand 17497 states and 52038 transitions. [2019-12-27 06:18:21,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:18:21,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:21,831 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 06:18:21,832 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:21,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:21,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1439174799, now seen corresponding path program 7 times [2019-12-27 06:18:21,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:21,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540543244] [2019-12-27 06:18:21,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:22,429 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 06:18:22,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540543244] [2019-12-27 06:18:22,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:22,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 06:18:22,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135479522] [2019-12-27 06:18:22,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 06:18:22,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:22,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 06:18:22,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-12-27 06:18:22,432 INFO L87 Difference]: Start difference. First operand 17497 states and 52038 transitions. Second operand 17 states. [2019-12-27 06:18:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:25,840 INFO L93 Difference]: Finished difference Result 25082 states and 73535 transitions. [2019-12-27 06:18:25,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 06:18:25,840 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 06:18:25,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:25,872 INFO L225 Difference]: With dead ends: 25082 [2019-12-27 06:18:25,872 INFO L226 Difference]: Without dead ends: 24183 [2019-12-27 06:18:25,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=329, Invalid=1477, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 06:18:25,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24183 states. [2019-12-27 06:18:26,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24183 to 17473. [2019-12-27 06:18:26,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17473 states. [2019-12-27 06:18:26,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17473 states to 17473 states and 51968 transitions. [2019-12-27 06:18:26,178 INFO L78 Accepts]: Start accepts. Automaton has 17473 states and 51968 transitions. Word has length 67 [2019-12-27 06:18:26,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:26,179 INFO L462 AbstractCegarLoop]: Abstraction has 17473 states and 51968 transitions. [2019-12-27 06:18:26,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 06:18:26,179 INFO L276 IsEmpty]: Start isEmpty. Operand 17473 states and 51968 transitions. [2019-12-27 06:18:26,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:18:26,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:26,195 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 06:18:26,195 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:26,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:26,195 INFO L82 PathProgramCache]: Analyzing trace with hash 24242517, now seen corresponding path program 8 times [2019-12-27 06:18:26,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:26,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935323962] [2019-12-27 06:18:26,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:26,919 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 06:18:26,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935323962] [2019-12-27 06:18:26,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:26,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 06:18:26,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464092269] [2019-12-27 06:18:26,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 06:18:26,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:26,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 06:18:26,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:18:26,921 INFO L87 Difference]: Start difference. First operand 17473 states and 51968 transitions. Second operand 15 states. [2019-12-27 06:18:31,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:31,090 INFO L93 Difference]: Finished difference Result 35478 states and 103936 transitions. [2019-12-27 06:18:31,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 06:18:31,091 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 06:18:31,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:31,133 INFO L225 Difference]: With dead ends: 35478 [2019-12-27 06:18:31,133 INFO L226 Difference]: Without dead ends: 33197 [2019-12-27 06:18:31,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=485, Invalid=2377, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 06:18:31,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33197 states. [2019-12-27 06:18:31,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33197 to 17251. [2019-12-27 06:18:31,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17251 states. [2019-12-27 06:18:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17251 states to 17251 states and 51388 transitions. [2019-12-27 06:18:31,484 INFO L78 Accepts]: Start accepts. Automaton has 17251 states and 51388 transitions. Word has length 67 [2019-12-27 06:18:31,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:31,485 INFO L462 AbstractCegarLoop]: Abstraction has 17251 states and 51388 transitions. [2019-12-27 06:18:31,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 06:18:31,485 INFO L276 IsEmpty]: Start isEmpty. Operand 17251 states and 51388 transitions. [2019-12-27 06:18:31,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:18:31,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:31,501 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 06:18:31,501 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:31,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:31,501 INFO L82 PathProgramCache]: Analyzing trace with hash -557411761, now seen corresponding path program 9 times [2019-12-27 06:18:31,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:31,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961171022] [2019-12-27 06:18:31,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:31,959 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 06:18:31,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961171022] [2019-12-27 06:18:31,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:31,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 06:18:31,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911899657] [2019-12-27 06:18:31,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 06:18:31,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:31,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 06:18:31,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-12-27 06:18:31,961 INFO L87 Difference]: Start difference. First operand 17251 states and 51388 transitions. Second operand 17 states. [2019-12-27 06:18:37,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:37,559 INFO L93 Difference]: Finished difference Result 36849 states and 107897 transitions. [2019-12-27 06:18:37,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-27 06:18:37,559 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 06:18:37,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:37,602 INFO L225 Difference]: With dead ends: 36849 [2019-12-27 06:18:37,602 INFO L226 Difference]: Without dead ends: 33038 [2019-12-27 06:18:37,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=539, Invalid=3001, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 06:18:37,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33038 states. [2019-12-27 06:18:38,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33038 to 17303. [2019-12-27 06:18:38,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17303 states. [2019-12-27 06:18:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17303 states to 17303 states and 51543 transitions. [2019-12-27 06:18:38,103 INFO L78 Accepts]: Start accepts. Automaton has 17303 states and 51543 transitions. Word has length 67 [2019-12-27 06:18:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:38,103 INFO L462 AbstractCegarLoop]: Abstraction has 17303 states and 51543 transitions. [2019-12-27 06:18:38,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 06:18:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 17303 states and 51543 transitions. [2019-12-27 06:18:38,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:18:38,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:38,120 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 06:18:38,120 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:38,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:38,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1169520235, now seen corresponding path program 10 times [2019-12-27 06:18:38,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:38,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047702290] [2019-12-27 06:18:38,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:38,250 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 06:18:38,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047702290] [2019-12-27 06:18:38,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:38,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:18:38,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3169000] [2019-12-27 06:18:38,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:18:38,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:38,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:18:38,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:18:38,253 INFO L87 Difference]: Start difference. First operand 17303 states and 51543 transitions. Second operand 11 states. [2019-12-27 06:18:39,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:39,377 INFO L93 Difference]: Finished difference Result 33843 states and 100011 transitions. [2019-12-27 06:18:39,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 06:18:39,377 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 06:18:39,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:39,414 INFO L225 Difference]: With dead ends: 33843 [2019-12-27 06:18:39,414 INFO L226 Difference]: Without dead ends: 27940 [2019-12-27 06:18:39,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2019-12-27 06:18:39,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27940 states. [2019-12-27 06:18:39,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27940 to 16290. [2019-12-27 06:18:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16290 states. [2019-12-27 06:18:39,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16290 states to 16290 states and 48612 transitions. [2019-12-27 06:18:39,738 INFO L78 Accepts]: Start accepts. Automaton has 16290 states and 48612 transitions. Word has length 67 [2019-12-27 06:18:39,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:39,739 INFO L462 AbstractCegarLoop]: Abstraction has 16290 states and 48612 transitions. [2019-12-27 06:18:39,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:18:39,739 INFO L276 IsEmpty]: Start isEmpty. Operand 16290 states and 48612 transitions. [2019-12-27 06:18:39,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:18:39,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:39,755 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 06:18:39,755 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:39,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:39,755 INFO L82 PathProgramCache]: Analyzing trace with hash -614399051, now seen corresponding path program 11 times [2019-12-27 06:18:39,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:39,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330552568] [2019-12-27 06:18:39,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:18:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:18:39,863 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:18:39,863 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:18:39,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_p1_EAX~0_15) (= |v_#NULL.offset_7| 0) (= 0 v_~a$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t919~0.base_26|) (= 0 v_~__unbuffered_cnt~0_21) (= 0 v_~a$r_buff1_thd3~0_48) (= |v_ULTIMATE.start_main_~#t919~0.offset_19| 0) (= v_~__unbuffered_p2_EBX~0_16 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z~0_7) (= 0 v_~a$r_buff1_thd0~0_26) (= 0 v_~a$w_buff1~0_23) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t919~0.base_26| 4)) (= 0 v_~a$w_buff0_used~0_113) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t919~0.base_26| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t919~0.base_26|) |v_ULTIMATE.start_main_~#t919~0.offset_19| 0))) (= v_~a$flush_delayed~0_13 0) (= 0 v_~a$r_buff1_thd1~0_18) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 v_~weak$$choice0~0_7) (= v_~a$r_buff0_thd1~0_28 0) (= v_~a$mem_tmp~0_10 0) (= 0 v_~__unbuffered_p0_EAX~0_17) (= 0 |v_#NULL.base_7|) (= 0 v_~y~0_8) (= v_~a$r_buff0_thd2~0_21 0) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~a$w_buff0~0_26) (= (store .cse0 |v_ULTIMATE.start_main_~#t919~0.base_26| 1) |v_#valid_64|) (= v_~a$r_buff0_thd3~0_79 0) (= 0 v_~a$w_buff1_used~0_68) (= (select .cse0 |v_ULTIMATE.start_main_~#t919~0.base_26|) 0) (= 0 v_~a$r_buff1_thd2~0_18) (= v_~a~0_27 0) (= v_~a$r_buff0_thd0~0_21 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_21, ULTIMATE.start_main_~#t919~0.offset=|v_ULTIMATE.start_main_~#t919~0.offset_19|, ULTIMATE.start_main_~#t921~0.offset=|v_ULTIMATE.start_main_~#t921~0.offset_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ~a~0=v_~a~0_27, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_48, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_113, ULTIMATE.start_main_~#t920~0.base=|v_ULTIMATE.start_main_~#t920~0.base_21|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ULTIMATE.start_main_~#t919~0.base=|v_ULTIMATE.start_main_~#t919~0.base_26|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_26, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ULTIMATE.start_main_~#t920~0.offset=|v_ULTIMATE.start_main_~#t920~0.offset_16|, ULTIMATE.start_main_~#t921~0.base=|v_ULTIMATE.start_main_~#t921~0.base_17|, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~a$w_buff1~0=v_~a$w_buff1~0_23, ~y~0=v_~y~0_8, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, #NULL.base=|v_#NULL.base_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_7, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_~#t919~0.offset, ULTIMATE.start_main_~#t921~0.offset, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ULTIMATE.start_main_~#t920~0.base, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t919~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t920~0.offset, ULTIMATE.start_main_~#t921~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 06:18:39,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L750: Formula: (and (= ~a$r_buff0_thd1~0_In-1966343264 ~a$r_buff1_thd1~0_Out-1966343264) (= ~a$r_buff1_thd2~0_Out-1966343264 ~a$r_buff0_thd2~0_In-1966343264) (= 1 ~a$r_buff0_thd1~0_Out-1966343264) (= ~a$r_buff0_thd3~0_In-1966343264 ~a$r_buff1_thd3~0_Out-1966343264) (= ~a$r_buff0_thd0~0_In-1966343264 ~a$r_buff1_thd0~0_Out-1966343264) (= ~x~0_In-1966343264 ~__unbuffered_p0_EAX~0_Out-1966343264) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1966343264))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1966343264, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1966343264, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1966343264, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1966343264, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1966343264, ~x~0=~x~0_In-1966343264} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1966343264, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-1966343264, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-1966343264, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-1966343264, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1966343264, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-1966343264, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1966343264, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1966343264, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1966343264, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1966343264, ~x~0=~x~0_In-1966343264} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:18:39,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-1-->L834: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t920~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t920~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t920~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t920~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t920~0.base_11|) |v_ULTIMATE.start_main_~#t920~0.offset_10| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t920~0.offset_10|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t920~0.base_11| 1)) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t920~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t920~0.base=|v_ULTIMATE.start_main_~#t920~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t920~0.offset=|v_ULTIMATE.start_main_~#t920~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t920~0.base, #length, ULTIMATE.start_main_~#t920~0.offset] because there is no mapped edge [2019-12-27 06:18:39,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L770-2-->L770-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-451368670 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-451368670 256)))) (or (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In-451368670 |P1Thread1of1ForFork2_#t~ite9_Out-451368670|)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-451368670| ~a~0_In-451368670) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In-451368670, ~a$w_buff1~0=~a$w_buff1~0_In-451368670, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-451368670, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-451368670} OutVars{~a~0=~a~0_In-451368670, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-451368670|, ~a$w_buff1~0=~a$w_buff1~0_In-451368670, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-451368670, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-451368670} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 06:18:39,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L770-4-->L771: Formula: (= v_~a~0_22 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{~a~0=v_~a~0_22, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 06:18:39,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L771-->L771-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1058024551 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-1058024551 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1058024551| ~a$w_buff0_used~0_In-1058024551) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1058024551| 0) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1058024551, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1058024551} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1058024551, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1058024551, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1058024551|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 06:18:39,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In1599845806 256))) (.cse1 (= (mod ~a$r_buff1_thd2~0_In1599845806 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1599845806 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In1599845806 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out1599845806| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~a$w_buff1_used~0_In1599845806 |P1Thread1of1ForFork2_#t~ite12_Out1599845806|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1599845806, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1599845806, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1599845806, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1599845806} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1599845806, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1599845806, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1599845806, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1599845806|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1599845806} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 06:18:39,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In876796992 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In876796992 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out876796992| ~a$r_buff0_thd2~0_In876796992)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out876796992| 0) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In876796992, ~a$w_buff0_used~0=~a$w_buff0_used~0_In876796992} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In876796992, ~a$w_buff0_used~0=~a$w_buff0_used~0_In876796992, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out876796992|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 06:18:39,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1312013069 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1312013069 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In-1312013069 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1312013069 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out-1312013069| ~a$r_buff1_thd2~0_In-1312013069) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1312013069|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1312013069, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1312013069, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1312013069, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1312013069} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1312013069, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1312013069, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1312013069, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1312013069, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1312013069|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 06:18:39,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L774-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 06:18:39,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-401138406 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-401138406 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out-401138406| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In-401138406 |P0Thread1of1ForFork1_#t~ite5_Out-401138406|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-401138406, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-401138406} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-401138406|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-401138406, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-401138406} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 06:18:39,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In216572401 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In216572401 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In216572401 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In216572401 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out216572401| ~a$w_buff1_used~0_In216572401) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork1_#t~ite6_Out216572401| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In216572401, ~a$w_buff0_used~0=~a$w_buff0_used~0_In216572401, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In216572401, ~a$w_buff1_used~0=~a$w_buff1_used~0_In216572401} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out216572401|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In216572401, ~a$w_buff0_used~0=~a$w_buff0_used~0_In216572401, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In216572401, ~a$w_buff1_used~0=~a$w_buff1_used~0_In216572401} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 06:18:39,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L753-->L754: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In2135776045 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In2135776045 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_Out2135776045 ~a$r_buff0_thd1~0_In2135776045)) (and (not .cse0) (not .cse1) (= ~a$r_buff0_thd1~0_Out2135776045 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2135776045, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2135776045} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out2135776045|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2135776045, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out2135776045} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:18:39,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L754-->L754-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In1038510281 256))) (.cse0 (= (mod ~a$r_buff1_thd1~0_In1038510281 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In1038510281 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In1038510281 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd1~0_In1038510281 |P0Thread1of1ForFork1_#t~ite8_Out1038510281|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1038510281|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1038510281, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1038510281, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1038510281, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1038510281} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1038510281|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1038510281, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1038510281, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1038510281, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1038510281} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 06:18:39,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L754-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= v_~a$r_buff1_thd1~0_13 |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{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_13, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 06:18:39,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L834-1-->L836: Formula: (and (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t921~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t921~0.offset_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t921~0.base_11| 4) |v_#length_15|) (not (= |v_ULTIMATE.start_main_~#t921~0.base_11| 0)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t921~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t921~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t921~0.base_11|) |v_ULTIMATE.start_main_~#t921~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t921~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t921~0.base=|v_ULTIMATE.start_main_~#t921~0.base_11|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t921~0.offset=|v_ULTIMATE.start_main_~#t921~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t921~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t921~0.offset] because there is no mapped edge [2019-12-27 06:18:39,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L801-->L801-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1875038035 256)))) (or (and (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-1875038035 256) 0))) (or (and .cse0 (= (mod ~a$w_buff1_used~0_In-1875038035 256) 0)) (= (mod ~a$w_buff0_used~0_In-1875038035 256) 0) (and (= (mod ~a$r_buff1_thd3~0_In-1875038035 256) 0) .cse0))) .cse1 (= |P2Thread1of1ForFork0_#t~ite29_Out-1875038035| ~a$w_buff1_used~0_In-1875038035) (= |P2Thread1of1ForFork0_#t~ite29_Out-1875038035| |P2Thread1of1ForFork0_#t~ite30_Out-1875038035|)) (and (= |P2Thread1of1ForFork0_#t~ite30_Out-1875038035| ~a$w_buff1_used~0_In-1875038035) (= |P2Thread1of1ForFork0_#t~ite29_In-1875038035| |P2Thread1of1ForFork0_#t~ite29_Out-1875038035|) (not .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1875038035, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1875038035, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1875038035, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1875038035, ~weak$$choice2~0=~weak$$choice2~0_In-1875038035, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1875038035|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1875038035, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1875038035, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1875038035, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1875038035, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1875038035|, ~weak$$choice2~0=~weak$$choice2~0_In-1875038035, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1875038035|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 06:18:39,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L802-->L803: Formula: (and (= v_~a$r_buff0_thd3~0_52 v_~a$r_buff0_thd3~0_51) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_51, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 06:18:39,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-->L809: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_20 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_20, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 06:18:39,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L809-2-->L809-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In-1503316999 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-1503316999 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1503316999| ~a~0_In-1503316999) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-1503316999| ~a$w_buff1~0_In-1503316999)))) InVars {~a~0=~a~0_In-1503316999, ~a$w_buff1~0=~a$w_buff1~0_In-1503316999, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1503316999, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1503316999} OutVars{~a~0=~a~0_In-1503316999, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1503316999|, ~a$w_buff1~0=~a$w_buff1~0_In-1503316999, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1503316999, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1503316999} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 06:18:39,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-4-->L810: Formula: (= v_~a~0_18 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{~a~0=v_~a~0_18, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 06:18:39,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In310797707 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In310797707 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out310797707| 0)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out310797707| ~a$w_buff0_used~0_In310797707) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In310797707, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In310797707} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out310797707|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In310797707, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In310797707} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 06:18:39,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In1176875024 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1176875024 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1176875024 256))) (.cse2 (= (mod ~a$r_buff0_thd3~0_In1176875024 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out1176875024| ~a$w_buff1_used~0_In1176875024) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out1176875024| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1176875024, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1176875024, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1176875024, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1176875024} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1176875024, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1176875024, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1176875024, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1176875024, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1176875024|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 06:18:39,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In791141474 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In791141474 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd3~0_In791141474 |P2Thread1of1ForFork0_#t~ite42_Out791141474|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out791141474|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In791141474, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In791141474} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In791141474, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In791141474, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out791141474|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 06:18:39,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1712148126 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1712148126 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1712148126 256))) (.cse3 (= (mod ~a$r_buff1_thd3~0_In-1712148126 256) 0))) (or (and (= ~a$r_buff1_thd3~0_In-1712148126 |P2Thread1of1ForFork0_#t~ite43_Out-1712148126|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1712148126|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1712148126, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1712148126, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1712148126, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1712148126} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1712148126|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1712148126, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1712148126, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1712148126, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1712148126} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 06:18:39,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_43 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_43, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 06:18:39,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:18:39,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L842-2-->L842-5: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-143769573 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-143769573 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out-143769573| |ULTIMATE.start_main_#t~ite48_Out-143769573|))) (or (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In-143769573 |ULTIMATE.start_main_#t~ite47_Out-143769573|) .cse2) (and (or .cse0 .cse1) .cse2 (= ~a~0_In-143769573 |ULTIMATE.start_main_#t~ite47_Out-143769573|)))) InVars {~a~0=~a~0_In-143769573, ~a$w_buff1~0=~a$w_buff1~0_In-143769573, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-143769573, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-143769573} OutVars{~a~0=~a~0_In-143769573, ~a$w_buff1~0=~a$w_buff1~0_In-143769573, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-143769573|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-143769573, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-143769573|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-143769573} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 06:18:39,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1525700322 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1525700322 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out1525700322| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite49_Out1525700322| ~a$w_buff0_used~0_In1525700322)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1525700322, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1525700322} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1525700322, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1525700322|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1525700322} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 06:18:39,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L844-->L844-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1463776124 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-1463776124 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1463776124 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1463776124 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-1463776124| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite50_Out-1463776124| ~a$w_buff1_used~0_In-1463776124) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1463776124, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1463776124, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1463776124, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1463776124} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1463776124|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1463776124, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1463776124, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1463776124, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1463776124} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 06:18:39,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L845-->L845-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In2139381170 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In2139381170 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out2139381170|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In2139381170 |ULTIMATE.start_main_#t~ite51_Out2139381170|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2139381170, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2139381170} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out2139381170|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2139381170, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2139381170} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 06:18:39,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L846-->L846-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd0~0_In423656946 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In423656946 256))) (.cse1 (= (mod ~a$r_buff1_thd0~0_In423656946 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In423656946 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out423656946| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out423656946| ~a$r_buff1_thd0~0_In423656946) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In423656946, ~a$w_buff0_used~0=~a$w_buff0_used~0_In423656946, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In423656946, ~a$w_buff1_used~0=~a$w_buff1_used~0_In423656946} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out423656946|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In423656946, ~a$w_buff0_used~0=~a$w_buff0_used~0_In423656946, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In423656946, ~a$w_buff1_used~0=~a$w_buff1_used~0_In423656946} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 06:18:39,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite52_13| v_~a$r_buff1_thd0~0_19) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 0 v_~__unbuffered_p0_EAX~0_11) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_~__unbuffered_p2_EAX~0_9 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:18:39,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:18:39 BasicIcfg [2019-12-27 06:18:39,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:18:39,984 INFO L168 Benchmark]: Toolchain (without parser) took 133857.13 ms. Allocated memory was 138.9 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 101.0 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 06:18:39,984 INFO L168 Benchmark]: CDTParser took 0.69 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 06:18:39,984 INFO L168 Benchmark]: CACSL2BoogieTranslator took 824.29 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.5 MB in the beginning and 156.4 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:18:39,985 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.87 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:18:39,985 INFO L168 Benchmark]: Boogie Preprocessor took 42.34 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:18:39,985 INFO L168 Benchmark]: RCFGBuilder took 832.30 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 100.6 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:18:39,986 INFO L168 Benchmark]: TraceAbstraction took 132087.36 ms. Allocated memory was 202.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.0 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 06:18:39,988 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.69 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 824.29 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.5 MB in the beginning and 156.4 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.87 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.34 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 832.30 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 100.6 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 132087.36 ms. Allocated memory was 202.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.0 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 178 ProgramPointsBefore, 96 ProgramPointsAfterwards, 215 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7337 VarBasedMoverChecksPositive, 224 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 86659 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t919, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t920, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L750] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L772] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L773] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L836] FCALL, FORK 0 pthread_create(&t921, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 3 y = 1 [L787] 3 z = 1 [L790] 3 __unbuffered_p2_EAX = z [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 a$flush_delayed = weak$$choice2 [L796] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L798] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L798] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L799] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L800] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L800] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L801] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L803] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L809] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L810] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L811] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L812] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L842] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L842] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L843] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L844] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L845] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 131.7s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 63.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9766 SDtfs, 12931 SDslu, 41301 SDs, 0 SdLazy, 35021 SolverSat, 618 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 617 GetRequests, 41 SyntacticMatches, 32 SemanticMatches, 544 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5898 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163842occurred 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: 37.5s AutomataMinimizationTime, 35 MinimizatonAttempts, 289208 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 1674 NumberOfCodeBlocks, 1674 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1572 ConstructedInterpolants, 0 QuantifiedInterpolants, 403970 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...