/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/mix015_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:29:23,925 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:29:23,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:29:23,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:29:23,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:29:23,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:29:23,944 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:29:23,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:29:23,948 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:29:23,948 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:29:23,949 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:29:23,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:29:23,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:29:23,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:29:23,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:29:23,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:29:23,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:29:23,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:29:23,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:29:23,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:29:23,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:29:23,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:29:23,963 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:29:23,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:29:23,969 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:29:23,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:29:23,969 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:29:23,970 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:29:23,970 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:29:23,973 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:29:23,973 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:29:23,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:29:23,976 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:29:23,977 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:29:23,978 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:29:23,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:29:23,979 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:29:23,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:29:23,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:29:23,983 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:29:23,984 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:29:23,984 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 05:29:23,999 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:29:23,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:29:24,000 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:29:24,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:29:24,001 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:29:24,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:29:24,001 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:29:24,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:29:24,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:29:24,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:29:24,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:29:24,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:29:24,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:29:24,002 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:29:24,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:29:24,003 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:29:24,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:29:24,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:29:24,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:29:24,004 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:29:24,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:29:24,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:29:24,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:29:24,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:29:24,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:29:24,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:29:24,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:29:24,005 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:29:24,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:29:24,006 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:29:24,284 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:29:24,300 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:29:24,303 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:29:24,304 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:29:24,304 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:29:24,305 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015_pso.oepc.i [2019-12-27 05:29:24,358 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daf306fee/cdf81949e9e840ba870c3556e8db2ac2/FLAG270837336 [2019-12-27 05:29:24,886 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:29:24,887 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015_pso.oepc.i [2019-12-27 05:29:24,901 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daf306fee/cdf81949e9e840ba870c3556e8db2ac2/FLAG270837336 [2019-12-27 05:29:25,164 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daf306fee/cdf81949e9e840ba870c3556e8db2ac2 [2019-12-27 05:29:25,172 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:29:25,174 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:29:25,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:29:25,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:29:25,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:29:25,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:29:25" (1/1) ... [2019-12-27 05:29:25,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b530117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:25, skipping insertion in model container [2019-12-27 05:29:25,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:29:25" (1/1) ... [2019-12-27 05:29:25,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:29:25,232 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:29:25,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:29:25,775 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:29:25,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:29:25,930 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:29:25,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:25 WrapperNode [2019-12-27 05:29:25,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:29:25,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:29:25,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:29:25,932 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:29:25,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:25" (1/1) ... [2019-12-27 05:29:25,966 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:25" (1/1) ... [2019-12-27 05:29:25,997 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:29:25,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:29:25,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:29:25,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:29:26,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:25" (1/1) ... [2019-12-27 05:29:26,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:25" (1/1) ... [2019-12-27 05:29:26,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:25" (1/1) ... [2019-12-27 05:29:26,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:25" (1/1) ... [2019-12-27 05:29:26,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:25" (1/1) ... [2019-12-27 05:29:26,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:25" (1/1) ... [2019-12-27 05:29:26,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:25" (1/1) ... [2019-12-27 05:29:26,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:29:26,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:29:26,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:29:26,049 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:29:26,050 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:25" (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 05:29:26,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:29:26,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:29:26,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:29:26,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:29:26,113 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:29:26,114 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:29:26,114 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:29:26,115 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:29:26,115 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:29:26,116 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:29:26,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:29:26,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:29:26,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:29:26,118 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 05:29:26,907 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:29:26,908 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:29:26,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:29:26 BoogieIcfgContainer [2019-12-27 05:29:26,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:29:26,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:29:26,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:29:26,915 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:29:26,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:29:25" (1/3) ... [2019-12-27 05:29:26,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10bc031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:29:26, skipping insertion in model container [2019-12-27 05:29:26,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:25" (2/3) ... [2019-12-27 05:29:26,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10bc031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:29:26, skipping insertion in model container [2019-12-27 05:29:26,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:29:26" (3/3) ... [2019-12-27 05:29:26,918 INFO L109 eAbstractionObserver]: Analyzing ICFG mix015_pso.oepc.i [2019-12-27 05:29:26,929 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:29:26,929 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:29:26,937 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:29:26,938 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:29:26,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:26,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:26,981 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:26,981 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:26,981 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:26,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:26,982 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:26,982 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:26,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:26,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:26,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:26,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:26,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:26,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:26,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:26,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:26,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:26,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:26,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:26,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:26,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:26,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:26,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,006 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,006 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,014 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,014 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,041 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,043 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,051 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,051 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,052 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,057 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,057 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:27,083 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 05:29:27,101 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:29:27,101 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:29:27,101 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:29:27,101 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:29:27,102 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:29:27,102 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:29:27,102 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:29:27,102 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:29:27,119 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-27 05:29:27,121 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 05:29:27,226 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 05:29:27,226 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:29:27,244 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:29:27,268 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 05:29:27,324 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 05:29:27,324 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:29:27,332 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:29:27,354 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 05:29:27,356 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:29:30,756 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 05:29:30,920 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 05:29:31,018 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83227 [2019-12-27 05:29:31,018 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 05:29:31,022 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 104 transitions [2019-12-27 05:29:50,985 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120962 states. [2019-12-27 05:29:50,987 INFO L276 IsEmpty]: Start isEmpty. Operand 120962 states. [2019-12-27 05:29:50,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 05:29:50,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:29:50,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 05:29:50,994 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 05:29:50,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:29:50,999 INFO L82 PathProgramCache]: Analyzing trace with hash 919898, now seen corresponding path program 1 times [2019-12-27 05:29:51,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:29:51,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974747439] [2019-12-27 05:29:51,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:29:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:29:51,214 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 05:29:51,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974747439] [2019-12-27 05:29:51,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:29:51,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:29:51,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641643871] [2019-12-27 05:29:51,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:29:51,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:29:51,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:29:51,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:29:51,239 INFO L87 Difference]: Start difference. First operand 120962 states. Second operand 3 states. [2019-12-27 05:29:54,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:29:54,717 INFO L93 Difference]: Finished difference Result 119798 states and 510282 transitions. [2019-12-27 05:29:54,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:29:54,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 05:29:54,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:29:55,610 INFO L225 Difference]: With dead ends: 119798 [2019-12-27 05:29:55,619 INFO L226 Difference]: Without dead ends: 112910 [2019-12-27 05:29:55,621 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 05:30:03,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112910 states. [2019-12-27 05:30:05,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112910 to 112910. [2019-12-27 05:30:05,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112910 states. [2019-12-27 05:30:10,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112910 states to 112910 states and 480308 transitions. [2019-12-27 05:30:10,552 INFO L78 Accepts]: Start accepts. Automaton has 112910 states and 480308 transitions. Word has length 3 [2019-12-27 05:30:10,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:10,552 INFO L462 AbstractCegarLoop]: Abstraction has 112910 states and 480308 transitions. [2019-12-27 05:30:10,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:30:10,552 INFO L276 IsEmpty]: Start isEmpty. Operand 112910 states and 480308 transitions. [2019-12-27 05:30:10,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 05:30:10,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:10,555 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:30:10,556 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 05:30:10,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:10,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1163520711, now seen corresponding path program 1 times [2019-12-27 05:30:10,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:10,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544404728] [2019-12-27 05:30:10,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:10,703 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 05:30:10,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544404728] [2019-12-27 05:30:10,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:10,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:30:10,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628403811] [2019-12-27 05:30:10,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:30:10,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:10,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:30:10,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:30:10,707 INFO L87 Difference]: Start difference. First operand 112910 states and 480308 transitions. Second operand 4 states. [2019-12-27 05:30:12,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:12,925 INFO L93 Difference]: Finished difference Result 175260 states and 715456 transitions. [2019-12-27 05:30:12,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:30:12,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 05:30:12,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:13,502 INFO L225 Difference]: With dead ends: 175260 [2019-12-27 05:30:13,502 INFO L226 Difference]: Without dead ends: 175211 [2019-12-27 05:30:13,503 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 05:30:23,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175211 states. [2019-12-27 05:30:26,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175211 to 160651. [2019-12-27 05:30:26,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160651 states. [2019-12-27 05:30:27,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160651 states to 160651 states and 663882 transitions. [2019-12-27 05:30:27,213 INFO L78 Accepts]: Start accepts. Automaton has 160651 states and 663882 transitions. Word has length 11 [2019-12-27 05:30:27,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:27,214 INFO L462 AbstractCegarLoop]: Abstraction has 160651 states and 663882 transitions. [2019-12-27 05:30:27,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:30:27,214 INFO L276 IsEmpty]: Start isEmpty. Operand 160651 states and 663882 transitions. [2019-12-27 05:30:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:30:27,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:27,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:30:27,222 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 05:30:27,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:27,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1406257601, now seen corresponding path program 1 times [2019-12-27 05:30:27,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:27,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637261421] [2019-12-27 05:30:27,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:27,285 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 05:30:27,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637261421] [2019-12-27 05:30:27,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:27,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:30:27,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505562658] [2019-12-27 05:30:27,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:30:27,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:27,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:30:27,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:30:27,287 INFO L87 Difference]: Start difference. First operand 160651 states and 663882 transitions. Second operand 3 states. [2019-12-27 05:30:31,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:31,955 INFO L93 Difference]: Finished difference Result 34503 states and 111808 transitions. [2019-12-27 05:30:31,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:30:31,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 05:30:31,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:32,060 INFO L225 Difference]: With dead ends: 34503 [2019-12-27 05:30:32,061 INFO L226 Difference]: Without dead ends: 34503 [2019-12-27 05:30:32,061 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 05:30:32,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34503 states. [2019-12-27 05:30:32,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34503 to 34503. [2019-12-27 05:30:32,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34503 states. [2019-12-27 05:30:32,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34503 states to 34503 states and 111808 transitions. [2019-12-27 05:30:32,896 INFO L78 Accepts]: Start accepts. Automaton has 34503 states and 111808 transitions. Word has length 13 [2019-12-27 05:30:32,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:32,896 INFO L462 AbstractCegarLoop]: Abstraction has 34503 states and 111808 transitions. [2019-12-27 05:30:32,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:30:32,896 INFO L276 IsEmpty]: Start isEmpty. Operand 34503 states and 111808 transitions. [2019-12-27 05:30:32,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:30:32,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:32,899 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:30:32,899 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 05:30:32,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:32,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1992610691, now seen corresponding path program 1 times [2019-12-27 05:30:32,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:32,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168066503] [2019-12-27 05:30:32,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:33,072 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 05:30:33,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168066503] [2019-12-27 05:30:33,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:33,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:30:33,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029462530] [2019-12-27 05:30:33,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:30:33,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:33,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:30:33,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:30:33,075 INFO L87 Difference]: Start difference. First operand 34503 states and 111808 transitions. Second operand 4 states. [2019-12-27 05:30:33,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:33,508 INFO L93 Difference]: Finished difference Result 42846 states and 138316 transitions. [2019-12-27 05:30:33,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:30:33,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 05:30:33,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:33,589 INFO L225 Difference]: With dead ends: 42846 [2019-12-27 05:30:33,589 INFO L226 Difference]: Without dead ends: 42846 [2019-12-27 05:30:33,589 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 05:30:33,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42846 states. [2019-12-27 05:30:34,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42846 to 38560. [2019-12-27 05:30:34,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38560 states. [2019-12-27 05:30:34,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38560 states to 38560 states and 124897 transitions. [2019-12-27 05:30:34,602 INFO L78 Accepts]: Start accepts. Automaton has 38560 states and 124897 transitions. Word has length 16 [2019-12-27 05:30:34,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:34,603 INFO L462 AbstractCegarLoop]: Abstraction has 38560 states and 124897 transitions. [2019-12-27 05:30:34,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:30:34,603 INFO L276 IsEmpty]: Start isEmpty. Operand 38560 states and 124897 transitions. [2019-12-27 05:30:34,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:30:34,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:34,612 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 05:30:34,612 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 05:30:34,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:34,613 INFO L82 PathProgramCache]: Analyzing trace with hash 352437866, now seen corresponding path program 1 times [2019-12-27 05:30:34,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:34,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156841234] [2019-12-27 05:30:34,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:34,763 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 05:30:34,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156841234] [2019-12-27 05:30:34,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:34,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:30:34,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692919749] [2019-12-27 05:30:34,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:30:34,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:34,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:30:34,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:30:34,765 INFO L87 Difference]: Start difference. First operand 38560 states and 124897 transitions. Second operand 5 states. [2019-12-27 05:30:35,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:35,451 INFO L93 Difference]: Finished difference Result 49556 states and 157804 transitions. [2019-12-27 05:30:35,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:30:35,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 05:30:35,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:35,547 INFO L225 Difference]: With dead ends: 49556 [2019-12-27 05:30:35,547 INFO L226 Difference]: Without dead ends: 49549 [2019-12-27 05:30:35,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 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 05:30:35,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49549 states. [2019-12-27 05:30:36,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49549 to 38223. [2019-12-27 05:30:36,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38223 states. [2019-12-27 05:30:36,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38223 states to 38223 states and 123617 transitions. [2019-12-27 05:30:36,664 INFO L78 Accepts]: Start accepts. Automaton has 38223 states and 123617 transitions. Word has length 22 [2019-12-27 05:30:36,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:36,664 INFO L462 AbstractCegarLoop]: Abstraction has 38223 states and 123617 transitions. [2019-12-27 05:30:36,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:30:36,664 INFO L276 IsEmpty]: Start isEmpty. Operand 38223 states and 123617 transitions. [2019-12-27 05:30:36,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:30:36,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:36,676 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 05:30:36,676 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 05:30:36,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:36,677 INFO L82 PathProgramCache]: Analyzing trace with hash -772014791, now seen corresponding path program 1 times [2019-12-27 05:30:36,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:36,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708548141] [2019-12-27 05:30:36,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:36,762 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 05:30:36,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708548141] [2019-12-27 05:30:36,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:36,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:30:36,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672086490] [2019-12-27 05:30:36,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:30:36,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:36,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:30:36,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:30:36,766 INFO L87 Difference]: Start difference. First operand 38223 states and 123617 transitions. Second operand 4 states. [2019-12-27 05:30:36,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:36,848 INFO L93 Difference]: Finished difference Result 14858 states and 45301 transitions. [2019-12-27 05:30:36,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:30:36,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 05:30:36,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:36,881 INFO L225 Difference]: With dead ends: 14858 [2019-12-27 05:30:36,882 INFO L226 Difference]: Without dead ends: 14858 [2019-12-27 05:30:36,882 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 05:30:37,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14858 states. [2019-12-27 05:30:37,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14858 to 14614. [2019-12-27 05:30:37,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14614 states. [2019-12-27 05:30:37,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14614 states to 14614 states and 44605 transitions. [2019-12-27 05:30:37,281 INFO L78 Accepts]: Start accepts. Automaton has 14614 states and 44605 transitions. Word has length 25 [2019-12-27 05:30:37,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:37,282 INFO L462 AbstractCegarLoop]: Abstraction has 14614 states and 44605 transitions. [2019-12-27 05:30:37,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:30:37,282 INFO L276 IsEmpty]: Start isEmpty. Operand 14614 states and 44605 transitions. [2019-12-27 05:30:37,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:30:37,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:37,296 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 05:30:37,296 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 05:30:37,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:37,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1959375522, now seen corresponding path program 1 times [2019-12-27 05:30:37,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:37,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290034942] [2019-12-27 05:30:37,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:37,383 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 05:30:37,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290034942] [2019-12-27 05:30:37,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:37,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:30:37,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070465169] [2019-12-27 05:30:37,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:30:37,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:37,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:30:37,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:30:37,386 INFO L87 Difference]: Start difference. First operand 14614 states and 44605 transitions. Second operand 3 states. [2019-12-27 05:30:37,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:37,487 INFO L93 Difference]: Finished difference Result 22649 states and 68681 transitions. [2019-12-27 05:30:37,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:30:37,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 05:30:37,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:37,518 INFO L225 Difference]: With dead ends: 22649 [2019-12-27 05:30:37,518 INFO L226 Difference]: Without dead ends: 22649 [2019-12-27 05:30:37,518 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 05:30:37,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22649 states. [2019-12-27 05:30:37,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22649 to 17220. [2019-12-27 05:30:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17220 states. [2019-12-27 05:30:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17220 states to 17220 states and 53027 transitions. [2019-12-27 05:30:37,806 INFO L78 Accepts]: Start accepts. Automaton has 17220 states and 53027 transitions. Word has length 27 [2019-12-27 05:30:37,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:37,807 INFO L462 AbstractCegarLoop]: Abstraction has 17220 states and 53027 transitions. [2019-12-27 05:30:37,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:30:37,807 INFO L276 IsEmpty]: Start isEmpty. Operand 17220 states and 53027 transitions. [2019-12-27 05:30:37,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:30:37,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:37,819 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 05:30:37,819 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 05:30:37,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:37,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1187835806, now seen corresponding path program 1 times [2019-12-27 05:30:37,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:37,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277537937] [2019-12-27 05:30:37,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:37,949 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 05:30:37,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277537937] [2019-12-27 05:30:37,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:37,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:30:37,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104382793] [2019-12-27 05:30:37,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:30:37,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:37,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:30:37,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:30:37,951 INFO L87 Difference]: Start difference. First operand 17220 states and 53027 transitions. Second operand 6 states. [2019-12-27 05:30:38,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:38,947 INFO L93 Difference]: Finished difference Result 35594 states and 106791 transitions. [2019-12-27 05:30:38,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:30:38,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 05:30:38,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:38,997 INFO L225 Difference]: With dead ends: 35594 [2019-12-27 05:30:38,997 INFO L226 Difference]: Without dead ends: 35594 [2019-12-27 05:30:38,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:30:39,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35594 states. [2019-12-27 05:30:39,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35594 to 20471. [2019-12-27 05:30:39,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20471 states. [2019-12-27 05:30:39,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20471 states to 20471 states and 62707 transitions. [2019-12-27 05:30:39,401 INFO L78 Accepts]: Start accepts. Automaton has 20471 states and 62707 transitions. Word has length 27 [2019-12-27 05:30:39,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:39,401 INFO L462 AbstractCegarLoop]: Abstraction has 20471 states and 62707 transitions. [2019-12-27 05:30:39,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:30:39,401 INFO L276 IsEmpty]: Start isEmpty. Operand 20471 states and 62707 transitions. [2019-12-27 05:30:39,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 05:30:39,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:39,417 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 05:30:39,417 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 05:30:39,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:39,417 INFO L82 PathProgramCache]: Analyzing trace with hash 708131532, now seen corresponding path program 1 times [2019-12-27 05:30:39,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:39,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698096799] [2019-12-27 05:30:39,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:39,559 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 05:30:39,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698096799] [2019-12-27 05:30:39,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:39,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:30:39,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605770597] [2019-12-27 05:30:39,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:30:39,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:39,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:30:39,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:30:39,561 INFO L87 Difference]: Start difference. First operand 20471 states and 62707 transitions. Second operand 6 states. [2019-12-27 05:30:40,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:40,469 INFO L93 Difference]: Finished difference Result 40297 states and 119974 transitions. [2019-12-27 05:30:40,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:30:40,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 05:30:40,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:40,528 INFO L225 Difference]: With dead ends: 40297 [2019-12-27 05:30:40,528 INFO L226 Difference]: Without dead ends: 40297 [2019-12-27 05:30:40,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:30:40,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40297 states. [2019-12-27 05:30:40,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40297 to 21088. [2019-12-27 05:30:40,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21088 states. [2019-12-27 05:30:40,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21088 states to 21088 states and 65044 transitions. [2019-12-27 05:30:40,964 INFO L78 Accepts]: Start accepts. Automaton has 21088 states and 65044 transitions. Word has length 28 [2019-12-27 05:30:40,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:40,964 INFO L462 AbstractCegarLoop]: Abstraction has 21088 states and 65044 transitions. [2019-12-27 05:30:40,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:30:40,965 INFO L276 IsEmpty]: Start isEmpty. Operand 21088 states and 65044 transitions. [2019-12-27 05:30:40,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:30:40,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:40,987 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 05:30:40,987 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 05:30:40,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:40,988 INFO L82 PathProgramCache]: Analyzing trace with hash 2083615183, now seen corresponding path program 1 times [2019-12-27 05:30:40,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:40,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634875251] [2019-12-27 05:30:40,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:41,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:30:41,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634875251] [2019-12-27 05:30:41,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:41,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:30:41,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046412484] [2019-12-27 05:30:41,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:30:41,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:41,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:30:41,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:30:41,070 INFO L87 Difference]: Start difference. First operand 21088 states and 65044 transitions. Second operand 5 states. [2019-12-27 05:30:41,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:41,653 INFO L93 Difference]: Finished difference Result 27064 states and 82174 transitions. [2019-12-27 05:30:41,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:30:41,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 05:30:41,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:41,695 INFO L225 Difference]: With dead ends: 27064 [2019-12-27 05:30:41,695 INFO L226 Difference]: Without dead ends: 27064 [2019-12-27 05:30:41,695 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 05:30:41,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27064 states. [2019-12-27 05:30:42,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27064 to 21997. [2019-12-27 05:30:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21997 states. [2019-12-27 05:30:42,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21997 states to 21997 states and 67856 transitions. [2019-12-27 05:30:42,051 INFO L78 Accepts]: Start accepts. Automaton has 21997 states and 67856 transitions. Word has length 33 [2019-12-27 05:30:42,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:42,051 INFO L462 AbstractCegarLoop]: Abstraction has 21997 states and 67856 transitions. [2019-12-27 05:30:42,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:30:42,051 INFO L276 IsEmpty]: Start isEmpty. Operand 21997 states and 67856 transitions. [2019-12-27 05:30:42,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:30:42,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:42,075 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 05:30:42,075 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 05:30:42,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:42,076 INFO L82 PathProgramCache]: Analyzing trace with hash -2131169195, now seen corresponding path program 2 times [2019-12-27 05:30:42,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:42,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242840747] [2019-12-27 05:30:42,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:42,189 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 05:30:42,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242840747] [2019-12-27 05:30:42,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:42,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:30:42,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274229381] [2019-12-27 05:30:42,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:30:42,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:42,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:30:42,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:30:42,191 INFO L87 Difference]: Start difference. First operand 21997 states and 67856 transitions. Second operand 7 states. [2019-12-27 05:30:43,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:43,885 INFO L93 Difference]: Finished difference Result 46984 states and 140763 transitions. [2019-12-27 05:30:43,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:30:43,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 05:30:43,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:43,964 INFO L225 Difference]: With dead ends: 46984 [2019-12-27 05:30:43,964 INFO L226 Difference]: Without dead ends: 46984 [2019-12-27 05:30:43,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 05:30:44,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46984 states. [2019-12-27 05:30:44,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46984 to 23476. [2019-12-27 05:30:44,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23476 states. [2019-12-27 05:30:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23476 states to 23476 states and 72275 transitions. [2019-12-27 05:30:44,814 INFO L78 Accepts]: Start accepts. Automaton has 23476 states and 72275 transitions. Word has length 33 [2019-12-27 05:30:44,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:44,814 INFO L462 AbstractCegarLoop]: Abstraction has 23476 states and 72275 transitions. [2019-12-27 05:30:44,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:30:44,814 INFO L276 IsEmpty]: Start isEmpty. Operand 23476 states and 72275 transitions. [2019-12-27 05:30:44,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:30:44,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:44,834 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 05:30:44,834 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 05:30:44,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:44,835 INFO L82 PathProgramCache]: Analyzing trace with hash 572830043, now seen corresponding path program 3 times [2019-12-27 05:30:44,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:44,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724990027] [2019-12-27 05:30:44,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:45,010 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 05:30:45,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724990027] [2019-12-27 05:30:45,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:45,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:30:45,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146093833] [2019-12-27 05:30:45,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:30:45,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:45,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:30:45,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:30:45,012 INFO L87 Difference]: Start difference. First operand 23476 states and 72275 transitions. Second operand 9 states. [2019-12-27 05:30:47,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:47,435 INFO L93 Difference]: Finished difference Result 54165 states and 160908 transitions. [2019-12-27 05:30:47,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 05:30:47,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 05:30:47,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:47,518 INFO L225 Difference]: With dead ends: 54165 [2019-12-27 05:30:47,519 INFO L226 Difference]: Without dead ends: 54165 [2019-12-27 05:30:47,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2019-12-27 05:30:47,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54165 states. [2019-12-27 05:30:48,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54165 to 23350. [2019-12-27 05:30:48,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23350 states. [2019-12-27 05:30:48,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23350 states to 23350 states and 71821 transitions. [2019-12-27 05:30:48,102 INFO L78 Accepts]: Start accepts. Automaton has 23350 states and 71821 transitions. Word has length 33 [2019-12-27 05:30:48,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:48,102 INFO L462 AbstractCegarLoop]: Abstraction has 23350 states and 71821 transitions. [2019-12-27 05:30:48,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:30:48,103 INFO L276 IsEmpty]: Start isEmpty. Operand 23350 states and 71821 transitions. [2019-12-27 05:30:48,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 05:30:48,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:48,124 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 05:30:48,124 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 05:30:48,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:48,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1529567545, now seen corresponding path program 1 times [2019-12-27 05:30:48,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:48,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464866340] [2019-12-27 05:30:48,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:48,224 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 05:30:48,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464866340] [2019-12-27 05:30:48,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:48,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:30:48,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615458306] [2019-12-27 05:30:48,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:30:48,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:48,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:30:48,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:30:48,227 INFO L87 Difference]: Start difference. First operand 23350 states and 71821 transitions. Second operand 7 states. [2019-12-27 05:30:50,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:50,071 INFO L93 Difference]: Finished difference Result 46892 states and 139598 transitions. [2019-12-27 05:30:50,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:30:50,071 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 05:30:50,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:50,154 INFO L225 Difference]: With dead ends: 46892 [2019-12-27 05:30:50,155 INFO L226 Difference]: Without dead ends: 46892 [2019-12-27 05:30:50,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 05:30:50,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46892 states. [2019-12-27 05:30:50,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46892 to 21154. [2019-12-27 05:30:50,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21154 states. [2019-12-27 05:30:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21154 states to 21154 states and 65338 transitions. [2019-12-27 05:30:50,649 INFO L78 Accepts]: Start accepts. Automaton has 21154 states and 65338 transitions. Word has length 34 [2019-12-27 05:30:50,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:50,650 INFO L462 AbstractCegarLoop]: Abstraction has 21154 states and 65338 transitions. [2019-12-27 05:30:50,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:30:50,650 INFO L276 IsEmpty]: Start isEmpty. Operand 21154 states and 65338 transitions. [2019-12-27 05:30:50,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 05:30:50,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:50,669 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 05:30:50,670 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 05:30:50,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:50,670 INFO L82 PathProgramCache]: Analyzing trace with hash 276051641, now seen corresponding path program 2 times [2019-12-27 05:30:50,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:50,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013687607] [2019-12-27 05:30:50,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:50,866 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 05:30:50,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013687607] [2019-12-27 05:30:50,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:50,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:30:50,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283598460] [2019-12-27 05:30:50,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:30:50,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:50,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:30:50,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:30:50,868 INFO L87 Difference]: Start difference. First operand 21154 states and 65338 transitions. Second operand 9 states. [2019-12-27 05:30:52,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:52,800 INFO L93 Difference]: Finished difference Result 55660 states and 164955 transitions. [2019-12-27 05:30:52,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 05:30:52,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-27 05:30:52,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:52,925 INFO L225 Difference]: With dead ends: 55660 [2019-12-27 05:30:52,925 INFO L226 Difference]: Without dead ends: 55660 [2019-12-27 05:30:52,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2019-12-27 05:30:53,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55660 states. [2019-12-27 05:30:53,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55660 to 20593. [2019-12-27 05:30:53,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20593 states. [2019-12-27 05:30:53,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20593 states to 20593 states and 63551 transitions. [2019-12-27 05:30:53,771 INFO L78 Accepts]: Start accepts. Automaton has 20593 states and 63551 transitions. Word has length 34 [2019-12-27 05:30:53,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:53,772 INFO L462 AbstractCegarLoop]: Abstraction has 20593 states and 63551 transitions. [2019-12-27 05:30:53,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:30:53,772 INFO L276 IsEmpty]: Start isEmpty. Operand 20593 states and 63551 transitions. [2019-12-27 05:30:53,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:30:53,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:53,800 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 05:30:53,800 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 05:30:53,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:53,801 INFO L82 PathProgramCache]: Analyzing trace with hash 358675718, now seen corresponding path program 1 times [2019-12-27 05:30:53,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:53,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826831441] [2019-12-27 05:30:53,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:53,854 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 05:30:53,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826831441] [2019-12-27 05:30:53,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:53,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:30:53,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212697419] [2019-12-27 05:30:53,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:30:53,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:53,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:30:53,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:30:53,856 INFO L87 Difference]: Start difference. First operand 20593 states and 63551 transitions. Second operand 4 states. [2019-12-27 05:30:53,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:53,982 INFO L93 Difference]: Finished difference Result 34666 states and 107392 transitions. [2019-12-27 05:30:53,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:30:53,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 05:30:53,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:54,016 INFO L225 Difference]: With dead ends: 34666 [2019-12-27 05:30:54,017 INFO L226 Difference]: Without dead ends: 17155 [2019-12-27 05:30:54,017 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 05:30:54,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17155 states. [2019-12-27 05:30:54,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17155 to 17060. [2019-12-27 05:30:54,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17060 states. [2019-12-27 05:30:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17060 states to 17060 states and 51753 transitions. [2019-12-27 05:30:54,285 INFO L78 Accepts]: Start accepts. Automaton has 17060 states and 51753 transitions. Word has length 39 [2019-12-27 05:30:54,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:54,286 INFO L462 AbstractCegarLoop]: Abstraction has 17060 states and 51753 transitions. [2019-12-27 05:30:54,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:30:54,286 INFO L276 IsEmpty]: Start isEmpty. Operand 17060 states and 51753 transitions. [2019-12-27 05:30:54,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:30:54,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:54,302 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 05:30:54,302 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 05:30:54,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:54,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1572679302, now seen corresponding path program 2 times [2019-12-27 05:30:54,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:54,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672795855] [2019-12-27 05:30:54,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:54,353 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 05:30:54,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672795855] [2019-12-27 05:30:54,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:54,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:30:54,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556096702] [2019-12-27 05:30:54,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:30:54,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:54,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:30:54,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:30:54,355 INFO L87 Difference]: Start difference. First operand 17060 states and 51753 transitions. Second operand 3 states. [2019-12-27 05:30:54,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:54,423 INFO L93 Difference]: Finished difference Result 17059 states and 51751 transitions. [2019-12-27 05:30:54,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:30:54,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 05:30:54,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:54,455 INFO L225 Difference]: With dead ends: 17059 [2019-12-27 05:30:54,455 INFO L226 Difference]: Without dead ends: 17059 [2019-12-27 05:30:54,455 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 05:30:54,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17059 states. [2019-12-27 05:30:54,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17059 to 17059. [2019-12-27 05:30:54,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17059 states. [2019-12-27 05:30:54,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17059 states to 17059 states and 51751 transitions. [2019-12-27 05:30:54,730 INFO L78 Accepts]: Start accepts. Automaton has 17059 states and 51751 transitions. Word has length 39 [2019-12-27 05:30:54,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:54,730 INFO L462 AbstractCegarLoop]: Abstraction has 17059 states and 51751 transitions. [2019-12-27 05:30:54,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:30:54,731 INFO L276 IsEmpty]: Start isEmpty. Operand 17059 states and 51751 transitions. [2019-12-27 05:30:54,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:30:54,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:54,748 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 05:30:54,748 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 05:30:54,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:54,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1861174117, now seen corresponding path program 1 times [2019-12-27 05:30:54,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:54,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088050847] [2019-12-27 05:30:54,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:54,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 05:30:54,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088050847] [2019-12-27 05:30:54,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:54,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:30:54,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499560699] [2019-12-27 05:30:54,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:30:54,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:54,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:30:54,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:30:54,794 INFO L87 Difference]: Start difference. First operand 17059 states and 51751 transitions. Second operand 4 states. [2019-12-27 05:30:54,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:54,930 INFO L93 Difference]: Finished difference Result 29717 states and 89747 transitions. [2019-12-27 05:30:54,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:30:54,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 05:30:54,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:54,957 INFO L225 Difference]: With dead ends: 29717 [2019-12-27 05:30:54,957 INFO L226 Difference]: Without dead ends: 14733 [2019-12-27 05:30:54,958 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 05:30:55,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14733 states. [2019-12-27 05:30:55,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14733 to 14675. [2019-12-27 05:30:55,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14675 states. [2019-12-27 05:30:55,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14675 states to 14675 states and 42815 transitions. [2019-12-27 05:30:55,345 INFO L78 Accepts]: Start accepts. Automaton has 14675 states and 42815 transitions. Word has length 40 [2019-12-27 05:30:55,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:55,346 INFO L462 AbstractCegarLoop]: Abstraction has 14675 states and 42815 transitions. [2019-12-27 05:30:55,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:30:55,346 INFO L276 IsEmpty]: Start isEmpty. Operand 14675 states and 42815 transitions. [2019-12-27 05:30:55,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:30:55,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:55,367 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 05:30:55,367 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 05:30:55,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:55,367 INFO L82 PathProgramCache]: Analyzing trace with hash 437381093, now seen corresponding path program 2 times [2019-12-27 05:30:55,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:55,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100676438] [2019-12-27 05:30:55,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:55,454 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 05:30:55,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100676438] [2019-12-27 05:30:55,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:55,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:30:55,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65023576] [2019-12-27 05:30:55,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:30:55,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:55,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:30:55,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:30:55,457 INFO L87 Difference]: Start difference. First operand 14675 states and 42815 transitions. Second operand 3 states. [2019-12-27 05:30:55,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:55,716 INFO L93 Difference]: Finished difference Result 14593 states and 42554 transitions. [2019-12-27 05:30:55,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:30:55,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 05:30:55,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:55,746 INFO L225 Difference]: With dead ends: 14593 [2019-12-27 05:30:55,746 INFO L226 Difference]: Without dead ends: 14593 [2019-12-27 05:30:55,748 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 05:30:55,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14593 states. [2019-12-27 05:30:55,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14593 to 12598. [2019-12-27 05:30:55,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12598 states. [2019-12-27 05:30:55,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12598 states to 12598 states and 37395 transitions. [2019-12-27 05:30:55,961 INFO L78 Accepts]: Start accepts. Automaton has 12598 states and 37395 transitions. Word has length 40 [2019-12-27 05:30:55,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:55,962 INFO L462 AbstractCegarLoop]: Abstraction has 12598 states and 37395 transitions. [2019-12-27 05:30:55,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:30:55,962 INFO L276 IsEmpty]: Start isEmpty. Operand 12598 states and 37395 transitions. [2019-12-27 05:30:55,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 05:30:55,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:55,973 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 05:30:55,973 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 05:30:55,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:55,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1353733925, now seen corresponding path program 1 times [2019-12-27 05:30:55,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:55,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452655855] [2019-12-27 05:30:55,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:56,021 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 05:30:56,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452655855] [2019-12-27 05:30:56,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:56,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:30:56,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165943556] [2019-12-27 05:30:56,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:30:56,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:56,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:30:56,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:30:56,023 INFO L87 Difference]: Start difference. First operand 12598 states and 37395 transitions. Second operand 5 states. [2019-12-27 05:30:56,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:56,088 INFO L93 Difference]: Finished difference Result 11574 states and 35114 transitions. [2019-12-27 05:30:56,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:30:56,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 05:30:56,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:56,105 INFO L225 Difference]: With dead ends: 11574 [2019-12-27 05:30:56,105 INFO L226 Difference]: Without dead ends: 8807 [2019-12-27 05:30:56,106 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 05:30:56,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8807 states. [2019-12-27 05:30:56,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8807 to 8807. [2019-12-27 05:30:56,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8807 states. [2019-12-27 05:30:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8807 states to 8807 states and 28580 transitions. [2019-12-27 05:30:56,418 INFO L78 Accepts]: Start accepts. Automaton has 8807 states and 28580 transitions. Word has length 41 [2019-12-27 05:30:56,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:56,418 INFO L462 AbstractCegarLoop]: Abstraction has 8807 states and 28580 transitions. [2019-12-27 05:30:56,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:30:56,418 INFO L276 IsEmpty]: Start isEmpty. Operand 8807 states and 28580 transitions. [2019-12-27 05:30:56,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:30:56,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:56,439 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 05:30:56,439 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 05:30:56,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:56,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1529197946, now seen corresponding path program 1 times [2019-12-27 05:30:56,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:56,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492655117] [2019-12-27 05:30:56,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:56,566 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 05:30:56,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492655117] [2019-12-27 05:30:56,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:56,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:30:56,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115219974] [2019-12-27 05:30:56,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:30:56,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:56,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:30:56,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:30:56,569 INFO L87 Difference]: Start difference. First operand 8807 states and 28580 transitions. Second operand 7 states. [2019-12-27 05:30:56,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:56,925 INFO L93 Difference]: Finished difference Result 17690 states and 56318 transitions. [2019-12-27 05:30:56,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:30:56,926 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 05:30:56,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:56,954 INFO L225 Difference]: With dead ends: 17690 [2019-12-27 05:30:56,954 INFO L226 Difference]: Without dead ends: 12828 [2019-12-27 05:30:56,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:30:57,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12828 states. [2019-12-27 05:30:57,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12828 to 10420. [2019-12-27 05:30:57,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10420 states. [2019-12-27 05:30:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10420 states to 10420 states and 33672 transitions. [2019-12-27 05:30:57,258 INFO L78 Accepts]: Start accepts. Automaton has 10420 states and 33672 transitions. Word has length 65 [2019-12-27 05:30:57,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:57,259 INFO L462 AbstractCegarLoop]: Abstraction has 10420 states and 33672 transitions. [2019-12-27 05:30:57,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:30:57,259 INFO L276 IsEmpty]: Start isEmpty. Operand 10420 states and 33672 transitions. [2019-12-27 05:30:57,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:30:57,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:57,280 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 05:30:57,280 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 05:30:57,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:57,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1412718426, now seen corresponding path program 2 times [2019-12-27 05:30:57,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:57,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512667460] [2019-12-27 05:30:57,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:57,390 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 05:30:57,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512667460] [2019-12-27 05:30:57,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:57,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:30:57,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586572301] [2019-12-27 05:30:57,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:30:57,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:57,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:30:57,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:30:57,393 INFO L87 Difference]: Start difference. First operand 10420 states and 33672 transitions. Second operand 7 states. [2019-12-27 05:30:57,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:57,740 INFO L93 Difference]: Finished difference Result 20502 states and 64918 transitions. [2019-12-27 05:30:57,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:30:57,741 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 05:30:57,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:57,769 INFO L225 Difference]: With dead ends: 20502 [2019-12-27 05:30:57,769 INFO L226 Difference]: Without dead ends: 14952 [2019-12-27 05:30:57,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:30:57,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14952 states. [2019-12-27 05:30:58,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14952 to 12252. [2019-12-27 05:30:58,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12252 states. [2019-12-27 05:30:58,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12252 states to 12252 states and 39399 transitions. [2019-12-27 05:30:58,055 INFO L78 Accepts]: Start accepts. Automaton has 12252 states and 39399 transitions. Word has length 65 [2019-12-27 05:30:58,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:58,055 INFO L462 AbstractCegarLoop]: Abstraction has 12252 states and 39399 transitions. [2019-12-27 05:30:58,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:30:58,055 INFO L276 IsEmpty]: Start isEmpty. Operand 12252 states and 39399 transitions. [2019-12-27 05:30:58,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:30:58,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:58,069 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 05:30:58,070 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 05:30:58,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:58,070 INFO L82 PathProgramCache]: Analyzing trace with hash 33307276, now seen corresponding path program 3 times [2019-12-27 05:30:58,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:58,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105502793] [2019-12-27 05:30:58,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:58,179 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 05:30:58,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105502793] [2019-12-27 05:30:58,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:58,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:30:58,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885060721] [2019-12-27 05:30:58,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:30:58,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:58,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:30:58,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:30:58,181 INFO L87 Difference]: Start difference. First operand 12252 states and 39399 transitions. Second operand 9 states. [2019-12-27 05:30:59,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:59,340 INFO L93 Difference]: Finished difference Result 42771 states and 132692 transitions. [2019-12-27 05:30:59,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:30:59,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 05:30:59,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:59,393 INFO L225 Difference]: With dead ends: 42771 [2019-12-27 05:30:59,393 INFO L226 Difference]: Without dead ends: 38195 [2019-12-27 05:30:59,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=590, Unknown=0, NotChecked=0, Total=812 [2019-12-27 05:30:59,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38195 states. [2019-12-27 05:30:59,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38195 to 12688. [2019-12-27 05:30:59,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12688 states. [2019-12-27 05:30:59,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12688 states to 12688 states and 40848 transitions. [2019-12-27 05:30:59,972 INFO L78 Accepts]: Start accepts. Automaton has 12688 states and 40848 transitions. Word has length 65 [2019-12-27 05:30:59,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:59,972 INFO L462 AbstractCegarLoop]: Abstraction has 12688 states and 40848 transitions. [2019-12-27 05:30:59,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:30:59,972 INFO L276 IsEmpty]: Start isEmpty. Operand 12688 states and 40848 transitions. [2019-12-27 05:30:59,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:30:59,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:59,987 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 05:30:59,987 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 05:30:59,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:59,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1174139712, now seen corresponding path program 4 times [2019-12-27 05:30:59,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:59,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582822982] [2019-12-27 05:30:59,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:00,098 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 05:31:00,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582822982] [2019-12-27 05:31:00,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:00,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:31:00,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845085963] [2019-12-27 05:31:00,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:31:00,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:00,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:31:00,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:31:00,104 INFO L87 Difference]: Start difference. First operand 12688 states and 40848 transitions. Second operand 9 states. [2019-12-27 05:31:01,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:01,435 INFO L93 Difference]: Finished difference Result 37701 states and 115655 transitions. [2019-12-27 05:31:01,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 05:31:01,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 05:31:01,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:01,479 INFO L225 Difference]: With dead ends: 37701 [2019-12-27 05:31:01,479 INFO L226 Difference]: Without dead ends: 30619 [2019-12-27 05:31:01,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2019-12-27 05:31:01,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30619 states. [2019-12-27 05:31:01,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30619 to 12231. [2019-12-27 05:31:01,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12231 states. [2019-12-27 05:31:01,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12231 states to 12231 states and 39367 transitions. [2019-12-27 05:31:01,814 INFO L78 Accepts]: Start accepts. Automaton has 12231 states and 39367 transitions. Word has length 65 [2019-12-27 05:31:01,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:01,815 INFO L462 AbstractCegarLoop]: Abstraction has 12231 states and 39367 transitions. [2019-12-27 05:31:01,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:31:01,815 INFO L276 IsEmpty]: Start isEmpty. Operand 12231 states and 39367 transitions. [2019-12-27 05:31:01,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:31:01,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:01,833 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 05:31:01,833 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 05:31:01,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:01,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2002921922, now seen corresponding path program 5 times [2019-12-27 05:31:01,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:01,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081889256] [2019-12-27 05:31:01,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:01,886 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 05:31:01,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081889256] [2019-12-27 05:31:01,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:01,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:31:01,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504099663] [2019-12-27 05:31:01,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:31:01,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:01,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:31:01,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:31:01,888 INFO L87 Difference]: Start difference. First operand 12231 states and 39367 transitions. Second operand 3 states. [2019-12-27 05:31:02,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:02,010 INFO L93 Difference]: Finished difference Result 14846 states and 47254 transitions. [2019-12-27 05:31:02,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:31:02,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 05:31:02,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:02,038 INFO L225 Difference]: With dead ends: 14846 [2019-12-27 05:31:02,039 INFO L226 Difference]: Without dead ends: 14846 [2019-12-27 05:31:02,039 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 05:31:02,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14846 states. [2019-12-27 05:31:02,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14846 to 12666. [2019-12-27 05:31:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12666 states. [2019-12-27 05:31:02,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12666 states to 12666 states and 40752 transitions. [2019-12-27 05:31:02,264 INFO L78 Accepts]: Start accepts. Automaton has 12666 states and 40752 transitions. Word has length 65 [2019-12-27 05:31:02,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:02,264 INFO L462 AbstractCegarLoop]: Abstraction has 12666 states and 40752 transitions. [2019-12-27 05:31:02,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:31:02,265 INFO L276 IsEmpty]: Start isEmpty. Operand 12666 states and 40752 transitions. [2019-12-27 05:31:02,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:31:02,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:02,279 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 05:31:02,279 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 05:31:02,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:02,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1068268020, now seen corresponding path program 1 times [2019-12-27 05:31:02,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:02,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630326595] [2019-12-27 05:31:02,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:02,320 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 05:31:02,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630326595] [2019-12-27 05:31:02,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:02,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:31:02,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364397571] [2019-12-27 05:31:02,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:31:02,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:02,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:31:02,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:31:02,322 INFO L87 Difference]: Start difference. First operand 12666 states and 40752 transitions. Second operand 3 states. [2019-12-27 05:31:02,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:02,511 INFO L93 Difference]: Finished difference Result 19125 states and 61222 transitions. [2019-12-27 05:31:02,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:31:02,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 05:31:02,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:02,543 INFO L225 Difference]: With dead ends: 19125 [2019-12-27 05:31:02,543 INFO L226 Difference]: Without dead ends: 19125 [2019-12-27 05:31:02,543 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 05:31:02,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19125 states. [2019-12-27 05:31:02,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19125 to 13033. [2019-12-27 05:31:02,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13033 states. [2019-12-27 05:31:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13033 states to 13033 states and 41948 transitions. [2019-12-27 05:31:02,967 INFO L78 Accepts]: Start accepts. Automaton has 13033 states and 41948 transitions. Word has length 66 [2019-12-27 05:31:02,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:02,967 INFO L462 AbstractCegarLoop]: Abstraction has 13033 states and 41948 transitions. [2019-12-27 05:31:02,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:31:02,967 INFO L276 IsEmpty]: Start isEmpty. Operand 13033 states and 41948 transitions. [2019-12-27 05:31:02,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:31:02,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:02,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 05:31:02,982 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 05:31:02,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:02,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1537924046, now seen corresponding path program 2 times [2019-12-27 05:31:02,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:02,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496578984] [2019-12-27 05:31:02,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:03,088 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 05:31:03,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496578984] [2019-12-27 05:31:03,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:03,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:31:03,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947363037] [2019-12-27 05:31:03,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:31:03,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:03,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:31:03,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:31:03,090 INFO L87 Difference]: Start difference. First operand 13033 states and 41948 transitions. Second operand 9 states. [2019-12-27 05:31:04,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:04,549 INFO L93 Difference]: Finished difference Result 43432 states and 133386 transitions. [2019-12-27 05:31:04,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 05:31:04,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 05:31:04,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:04,594 INFO L225 Difference]: With dead ends: 43432 [2019-12-27 05:31:04,594 INFO L226 Difference]: Without dead ends: 31405 [2019-12-27 05:31:04,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=639, Unknown=0, NotChecked=0, Total=870 [2019-12-27 05:31:04,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31405 states. [2019-12-27 05:31:04,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31405 to 13080. [2019-12-27 05:31:04,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13080 states. [2019-12-27 05:31:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13080 states to 13080 states and 41726 transitions. [2019-12-27 05:31:04,942 INFO L78 Accepts]: Start accepts. Automaton has 13080 states and 41726 transitions. Word has length 66 [2019-12-27 05:31:04,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:04,942 INFO L462 AbstractCegarLoop]: Abstraction has 13080 states and 41726 transitions. [2019-12-27 05:31:04,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:31:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 13080 states and 41726 transitions. [2019-12-27 05:31:04,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:31:04,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:04,957 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 05:31:04,957 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 05:31:04,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:04,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1285891802, now seen corresponding path program 3 times [2019-12-27 05:31:04,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:04,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391815108] [2019-12-27 05:31:04,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:05,065 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 05:31:05,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391815108] [2019-12-27 05:31:05,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:05,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:31:05,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478882708] [2019-12-27 05:31:05,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:31:05,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:05,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:31:05,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:31:05,067 INFO L87 Difference]: Start difference. First operand 13080 states and 41726 transitions. Second operand 9 states. [2019-12-27 05:31:06,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:06,014 INFO L93 Difference]: Finished difference Result 30358 states and 93054 transitions. [2019-12-27 05:31:06,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 05:31:06,014 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 05:31:06,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:06,052 INFO L225 Difference]: With dead ends: 30358 [2019-12-27 05:31:06,052 INFO L226 Difference]: Without dead ends: 28304 [2019-12-27 05:31:06,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2019-12-27 05:31:06,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28304 states. [2019-12-27 05:31:06,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28304 to 12608. [2019-12-27 05:31:06,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12608 states. [2019-12-27 05:31:06,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12608 states to 12608 states and 40278 transitions. [2019-12-27 05:31:06,363 INFO L78 Accepts]: Start accepts. Automaton has 12608 states and 40278 transitions. Word has length 66 [2019-12-27 05:31:06,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:06,363 INFO L462 AbstractCegarLoop]: Abstraction has 12608 states and 40278 transitions. [2019-12-27 05:31:06,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:31:06,363 INFO L276 IsEmpty]: Start isEmpty. Operand 12608 states and 40278 transitions. [2019-12-27 05:31:06,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:31:06,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:06,377 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:06,377 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 05:31:06,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:06,378 INFO L82 PathProgramCache]: Analyzing trace with hash 159393856, now seen corresponding path program 4 times [2019-12-27 05:31:06,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:06,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66281635] [2019-12-27 05:31:06,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:06,440 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 05:31:06,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66281635] [2019-12-27 05:31:06,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:06,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:31:06,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551557394] [2019-12-27 05:31:06,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:31:06,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:06,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:31:06,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:31:06,442 INFO L87 Difference]: Start difference. First operand 12608 states and 40278 transitions. Second operand 4 states. [2019-12-27 05:31:06,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:06,577 INFO L93 Difference]: Finished difference Result 12465 states and 39700 transitions. [2019-12-27 05:31:06,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:31:06,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 05:31:06,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:06,601 INFO L225 Difference]: With dead ends: 12465 [2019-12-27 05:31:06,601 INFO L226 Difference]: Without dead ends: 12465 [2019-12-27 05:31:06,602 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 05:31:06,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12465 states. [2019-12-27 05:31:07,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12465 to 11135. [2019-12-27 05:31:07,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11135 states. [2019-12-27 05:31:07,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11135 states to 11135 states and 35602 transitions. [2019-12-27 05:31:07,122 INFO L78 Accepts]: Start accepts. Automaton has 11135 states and 35602 transitions. Word has length 66 [2019-12-27 05:31:07,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:07,122 INFO L462 AbstractCegarLoop]: Abstraction has 11135 states and 35602 transitions. [2019-12-27 05:31:07,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:31:07,122 INFO L276 IsEmpty]: Start isEmpty. Operand 11135 states and 35602 transitions. [2019-12-27 05:31:07,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:31:07,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:07,144 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 05:31:07,144 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 05:31:07,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:07,144 INFO L82 PathProgramCache]: Analyzing trace with hash 673864792, now seen corresponding path program 1 times [2019-12-27 05:31:07,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:07,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367672015] [2019-12-27 05:31:07,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:07,304 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 05:31:07,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367672015] [2019-12-27 05:31:07,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:07,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:31:07,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076991190] [2019-12-27 05:31:07,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:31:07,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:07,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:31:07,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:31:07,307 INFO L87 Difference]: Start difference. First operand 11135 states and 35602 transitions. Second operand 3 states. [2019-12-27 05:31:07,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:07,360 INFO L93 Difference]: Finished difference Result 9544 states and 29862 transitions. [2019-12-27 05:31:07,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:31:07,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 05:31:07,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:07,378 INFO L225 Difference]: With dead ends: 9544 [2019-12-27 05:31:07,378 INFO L226 Difference]: Without dead ends: 9544 [2019-12-27 05:31:07,380 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 05:31:07,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9544 states. [2019-12-27 05:31:07,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9544 to 9466. [2019-12-27 05:31:07,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9466 states. [2019-12-27 05:31:07,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9466 states to 9466 states and 29642 transitions. [2019-12-27 05:31:07,587 INFO L78 Accepts]: Start accepts. Automaton has 9466 states and 29642 transitions. Word has length 66 [2019-12-27 05:31:07,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:07,587 INFO L462 AbstractCegarLoop]: Abstraction has 9466 states and 29642 transitions. [2019-12-27 05:31:07,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:31:07,587 INFO L276 IsEmpty]: Start isEmpty. Operand 9466 states and 29642 transitions. [2019-12-27 05:31:07,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:31:07,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:07,597 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 05:31:07,597 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 05:31:07,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:07,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1633407744, now seen corresponding path program 1 times [2019-12-27 05:31:07,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:07,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122332749] [2019-12-27 05:31:07,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:07,769 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 05:31:07,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122332749] [2019-12-27 05:31:07,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:07,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:31:07,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395327270] [2019-12-27 05:31:07,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:31:07,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:07,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:31:07,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:31:07,771 INFO L87 Difference]: Start difference. First operand 9466 states and 29642 transitions. Second operand 9 states. [2019-12-27 05:31:08,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:08,857 INFO L93 Difference]: Finished difference Result 16890 states and 52292 transitions. [2019-12-27 05:31:08,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 05:31:08,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-27 05:31:08,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:08,877 INFO L225 Difference]: With dead ends: 16890 [2019-12-27 05:31:08,877 INFO L226 Difference]: Without dead ends: 12429 [2019-12-27 05:31:08,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-12-27 05:31:08,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12429 states. [2019-12-27 05:31:09,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12429 to 9942. [2019-12-27 05:31:09,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9942 states. [2019-12-27 05:31:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9942 states to 9942 states and 30860 transitions. [2019-12-27 05:31:09,055 INFO L78 Accepts]: Start accepts. Automaton has 9942 states and 30860 transitions. Word has length 67 [2019-12-27 05:31:09,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:09,056 INFO L462 AbstractCegarLoop]: Abstraction has 9942 states and 30860 transitions. [2019-12-27 05:31:09,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:31:09,056 INFO L276 IsEmpty]: Start isEmpty. Operand 9942 states and 30860 transitions. [2019-12-27 05:31:09,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:31:09,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:09,066 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 05:31:09,067 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 05:31:09,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:09,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1416858720, now seen corresponding path program 2 times [2019-12-27 05:31:09,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:09,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404850059] [2019-12-27 05:31:09,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:09,260 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 05:31:09,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404850059] [2019-12-27 05:31:09,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:09,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:31:09,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769137103] [2019-12-27 05:31:09,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:31:09,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:09,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:31:09,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:31:09,262 INFO L87 Difference]: Start difference. First operand 9942 states and 30860 transitions. Second operand 10 states. [2019-12-27 05:31:09,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:09,923 INFO L93 Difference]: Finished difference Result 15769 states and 48514 transitions. [2019-12-27 05:31:09,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 05:31:09,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 05:31:09,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:09,956 INFO L225 Difference]: With dead ends: 15769 [2019-12-27 05:31:09,956 INFO L226 Difference]: Without dead ends: 14750 [2019-12-27 05:31:09,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2019-12-27 05:31:10,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14750 states. [2019-12-27 05:31:10,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14750 to 12278. [2019-12-27 05:31:10,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12278 states. [2019-12-27 05:31:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12278 states to 12278 states and 38271 transitions. [2019-12-27 05:31:10,246 INFO L78 Accepts]: Start accepts. Automaton has 12278 states and 38271 transitions. Word has length 67 [2019-12-27 05:31:10,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:10,246 INFO L462 AbstractCegarLoop]: Abstraction has 12278 states and 38271 transitions. [2019-12-27 05:31:10,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:31:10,247 INFO L276 IsEmpty]: Start isEmpty. Operand 12278 states and 38271 transitions. [2019-12-27 05:31:10,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:31:10,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:10,258 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 05:31:10,258 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 05:31:10,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:10,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1549601526, now seen corresponding path program 3 times [2019-12-27 05:31:10,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:10,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106753587] [2019-12-27 05:31:10,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:10,409 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 05:31:10,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106753587] [2019-12-27 05:31:10,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:10,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:31:10,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919784009] [2019-12-27 05:31:10,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:31:10,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:10,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:31:10,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:31:10,412 INFO L87 Difference]: Start difference. First operand 12278 states and 38271 transitions. Second operand 10 states. [2019-12-27 05:31:11,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:11,165 INFO L93 Difference]: Finished difference Result 15276 states and 46648 transitions. [2019-12-27 05:31:11,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:31:11,166 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 05:31:11,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:11,190 INFO L225 Difference]: With dead ends: 15276 [2019-12-27 05:31:11,191 INFO L226 Difference]: Without dead ends: 12497 [2019-12-27 05:31:11,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 05:31:11,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12497 states. [2019-12-27 05:31:11,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12497 to 9802. [2019-12-27 05:31:11,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9802 states. [2019-12-27 05:31:11,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9802 states to 9802 states and 30384 transitions. [2019-12-27 05:31:11,815 INFO L78 Accepts]: Start accepts. Automaton has 9802 states and 30384 transitions. Word has length 67 [2019-12-27 05:31:11,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:11,815 INFO L462 AbstractCegarLoop]: Abstraction has 9802 states and 30384 transitions. [2019-12-27 05:31:11,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:31:11,815 INFO L276 IsEmpty]: Start isEmpty. Operand 9802 states and 30384 transitions. [2019-12-27 05:31:11,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:31:11,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:11,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 05:31:11,832 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 05:31:11,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:11,832 INFO L82 PathProgramCache]: Analyzing trace with hash 755721406, now seen corresponding path program 4 times [2019-12-27 05:31:11,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:11,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626870049] [2019-12-27 05:31:11,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:12,149 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 05:31:12,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626870049] [2019-12-27 05:31:12,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:12,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:31:12,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18100153] [2019-12-27 05:31:12,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:31:12,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:12,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:31:12,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:31:12,151 INFO L87 Difference]: Start difference. First operand 9802 states and 30384 transitions. Second operand 11 states. [2019-12-27 05:31:12,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:12,867 INFO L93 Difference]: Finished difference Result 15709 states and 48371 transitions. [2019-12-27 05:31:12,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 05:31:12,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 05:31:12,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:12,887 INFO L225 Difference]: With dead ends: 15709 [2019-12-27 05:31:12,888 INFO L226 Difference]: Without dead ends: 14690 [2019-12-27 05:31:12,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-27 05:31:12,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14690 states. [2019-12-27 05:31:13,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14690 to 12816. [2019-12-27 05:31:13,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12816 states. [2019-12-27 05:31:13,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12816 states to 12816 states and 40042 transitions. [2019-12-27 05:31:13,096 INFO L78 Accepts]: Start accepts. Automaton has 12816 states and 40042 transitions. Word has length 67 [2019-12-27 05:31:13,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:13,096 INFO L462 AbstractCegarLoop]: Abstraction has 12816 states and 40042 transitions. [2019-12-27 05:31:13,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:31:13,096 INFO L276 IsEmpty]: Start isEmpty. Operand 12816 states and 40042 transitions. [2019-12-27 05:31:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:31:13,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:13,111 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 05:31:13,111 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 05:31:13,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:13,111 INFO L82 PathProgramCache]: Analyzing trace with hash 2084228456, now seen corresponding path program 5 times [2019-12-27 05:31:13,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:13,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430582830] [2019-12-27 05:31:13,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:13,268 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 05:31:13,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430582830] [2019-12-27 05:31:13,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:13,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:31:13,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000400687] [2019-12-27 05:31:13,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:31:13,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:13,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:31:13,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:31:13,270 INFO L87 Difference]: Start difference. First operand 12816 states and 40042 transitions. Second operand 11 states. [2019-12-27 05:31:13,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:13,912 INFO L93 Difference]: Finished difference Result 15306 states and 46717 transitions. [2019-12-27 05:31:13,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 05:31:13,912 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 05:31:13,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:13,928 INFO L225 Difference]: With dead ends: 15306 [2019-12-27 05:31:13,928 INFO L226 Difference]: Without dead ends: 11747 [2019-12-27 05:31:13,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-27 05:31:13,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11747 states. [2019-12-27 05:31:14,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11747 to 9670. [2019-12-27 05:31:14,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9670 states. [2019-12-27 05:31:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9670 states to 9670 states and 29784 transitions. [2019-12-27 05:31:14,095 INFO L78 Accepts]: Start accepts. Automaton has 9670 states and 29784 transitions. Word has length 67 [2019-12-27 05:31:14,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:14,095 INFO L462 AbstractCegarLoop]: Abstraction has 9670 states and 29784 transitions. [2019-12-27 05:31:14,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:31:14,095 INFO L276 IsEmpty]: Start isEmpty. Operand 9670 states and 29784 transitions. [2019-12-27 05:31:14,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:31:14,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:14,105 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 05:31:14,105 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 05:31:14,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:14,106 INFO L82 PathProgramCache]: Analyzing trace with hash 797762192, now seen corresponding path program 6 times [2019-12-27 05:31:14,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:14,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359968421] [2019-12-27 05:31:14,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:14,282 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 05:31:14,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359968421] [2019-12-27 05:31:14,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:14,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 05:31:14,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388621597] [2019-12-27 05:31:14,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 05:31:14,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:14,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 05:31:14,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:31:14,284 INFO L87 Difference]: Start difference. First operand 9670 states and 29784 transitions. Second operand 12 states. [2019-12-27 05:31:15,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:15,016 INFO L93 Difference]: Finished difference Result 12110 states and 36326 transitions. [2019-12-27 05:31:15,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:31:15,016 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 05:31:15,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:15,032 INFO L225 Difference]: With dead ends: 12110 [2019-12-27 05:31:15,033 INFO L226 Difference]: Without dead ends: 11683 [2019-12-27 05:31:15,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 05:31:15,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11683 states. [2019-12-27 05:31:15,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11683 to 9350. [2019-12-27 05:31:15,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9350 states. [2019-12-27 05:31:15,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9350 states to 9350 states and 28864 transitions. [2019-12-27 05:31:15,197 INFO L78 Accepts]: Start accepts. Automaton has 9350 states and 28864 transitions. Word has length 67 [2019-12-27 05:31:15,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:15,197 INFO L462 AbstractCegarLoop]: Abstraction has 9350 states and 28864 transitions. [2019-12-27 05:31:15,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 05:31:15,197 INFO L276 IsEmpty]: Start isEmpty. Operand 9350 states and 28864 transitions. [2019-12-27 05:31:15,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:31:15,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:15,207 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 05:31:15,207 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 05:31:15,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:15,207 INFO L82 PathProgramCache]: Analyzing trace with hash 139331638, now seen corresponding path program 7 times [2019-12-27 05:31:15,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:15,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999867827] [2019-12-27 05:31:15,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:31:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:31:15,323 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:31:15,323 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:31:15,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= v_~x~0_11 0) (= 0 v_~weak$$choice0~0_8) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~a$w_buff1_used~0_71) (= 0 v_~__unbuffered_p0_EAX~0_15) (= 0 v_~__unbuffered_cnt~0_20) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p1_EAX~0_12) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t391~0.base_25|) (= 0 v_~a$w_buff1~0_21) (< 0 |v_#StackHeapBarrier_17|) (= v_~a$r_buff0_thd3~0_77 0) (= 0 v_~weak$$choice2~0_34) (= 0 v_~a$w_buff0~0_23) (= (select .cse0 |v_ULTIMATE.start_main_~#t391~0.base_25|) 0) (= v_~a$flush_delayed~0_13 0) (= 0 |v_#NULL.base_6|) (= v_~__unbuffered_p2_EBX~0_13 0) (= v_~a$mem_tmp~0_10 0) (= 0 v_~a$r_buff1_thd1~0_21) (= v_~a$r_buff0_thd1~0_29 0) (= 0 v_~__unbuffered_p2_EAX~0_12) (= v_~a$r_buff0_thd2~0_21 0) (= 0 v_~a$r_buff1_thd0~0_22) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t391~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t391~0.base_25|) |v_ULTIMATE.start_main_~#t391~0.offset_20| 0)) |v_#memory_int_21|) (= 0 v_~a$r_buff1_thd2~0_17) (= (store .cse0 |v_ULTIMATE.start_main_~#t391~0.base_25| 1) |v_#valid_58|) (= 0 v_~z~0_8) (= v_~y~0_11 0) (= 0 v_~a$read_delayed~0_6) (= 0 v_~a$r_buff1_thd3~0_50) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6) (= 0 |v_ULTIMATE.start_main_~#t391~0.offset_20|) (= 0 v_~a$w_buff0_used~0_108) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t391~0.base_25| 4)) (= v_~a~0_27 0) (= v_~a$r_buff0_thd0~0_21 0) (= v_~__unbuffered_p0_EBX~0_15 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_11|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_21, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_11|, ~a~0=v_~a~0_27, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_19|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ULTIMATE.start_main_~#t392~0.base=|v_ULTIMATE.start_main_~#t392~0.base_25|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_15, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_50, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_108, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_29, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ~a$w_buff0~0=v_~a$w_buff0~0_23, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_22, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_11, ULTIMATE.start_main_~#t391~0.base=|v_ULTIMATE.start_main_~#t391~0.base_25|, ~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~y~0=v_~y~0_11, ULTIMATE.start_main_~#t393~0.offset=|v_ULTIMATE.start_main_~#t393~0.offset_15|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_21, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_77, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_~#t392~0.offset=|v_ULTIMATE.start_main_~#t392~0.offset_20|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t393~0.base=|v_ULTIMATE.start_main_~#t393~0.base_17|, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_8, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t391~0.offset=|v_ULTIMATE.start_main_~#t391~0.offset_20|} 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_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t392~0.base, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~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_~#t391~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_~#t393~0.offset, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t392~0.offset, #NULL.base, ULTIMATE.start_main_~#t393~0.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, ULTIMATE.start_main_~#t391~0.offset] because there is no mapped edge [2019-12-27 05:31:15,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L837-1-->L839: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t392~0.base_12|) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t392~0.base_12|) 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t392~0.base_12| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t392~0.base_12|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t392~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t392~0.offset_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t392~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t392~0.base_12|) |v_ULTIMATE.start_main_~#t392~0.offset_10| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t392~0.base=|v_ULTIMATE.start_main_~#t392~0.base_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t392~0.offset=|v_ULTIMATE.start_main_~#t392~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t392~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t392~0.offset] because there is no mapped edge [2019-12-27 05:31:15,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L839-1-->L841: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t393~0.offset_11|) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t393~0.base_13| 1) |v_#valid_36|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t393~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t393~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t393~0.base_13|) |v_ULTIMATE.start_main_~#t393~0.offset_11| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t393~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t393~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t393~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t393~0.offset=|v_ULTIMATE.start_main_~#t393~0.offset_11|, ULTIMATE.start_main_~#t393~0.base=|v_ULTIMATE.start_main_~#t393~0.base_13|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t393~0.offset, ULTIMATE.start_main_~#t393~0.base] because there is no mapped edge [2019-12-27 05:31:15,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L4-->L758: Formula: (and (= 1 ~a$r_buff0_thd1~0_Out1987157271) (= ~a$r_buff0_thd0~0_In1987157271 ~a$r_buff1_thd0~0_Out1987157271) (= ~a$r_buff0_thd1~0_In1987157271 ~a$r_buff1_thd1~0_Out1987157271) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1987157271 0)) (= ~y~0_In1987157271 ~__unbuffered_p0_EBX~0_Out1987157271) (= ~a$r_buff1_thd3~0_Out1987157271 ~a$r_buff0_thd3~0_In1987157271) (= ~x~0_Out1987157271 ~__unbuffered_p0_EAX~0_Out1987157271) (= ~a$r_buff1_thd2~0_Out1987157271 ~a$r_buff0_thd2~0_In1987157271) (= 1 ~x~0_Out1987157271)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1987157271, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1987157271, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1987157271, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1987157271, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1987157271, ~y~0=~y~0_In1987157271} OutVars{~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out1987157271, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out1987157271, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out1987157271, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out1987157271, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1987157271, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1987157271, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1987157271, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1987157271, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1987157271, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out1987157271, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1987157271, ~y~0=~y~0_In1987157271, ~x~0=~x~0_Out1987157271} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~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, ~x~0] because there is no mapped edge [2019-12-27 05:31:15,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L759-->L759-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In2118725444 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In2118725444 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out2118725444| 0) (not .cse0) (not .cse1)) (and (= ~a$w_buff0_used~0_In2118725444 |P0Thread1of1ForFork1_#t~ite5_Out2118725444|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2118725444, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2118725444} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out2118725444|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2118725444, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2118725444} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 05:31:15,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1358552099 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-1358552099 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-1358552099 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd1~0_In-1358552099 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite6_Out-1358552099| ~a$w_buff1_used~0_In-1358552099)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1358552099|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1358552099, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1358552099, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1358552099, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1358552099} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1358552099|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1358552099, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1358552099, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1358552099, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1358552099} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 05:31:15,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L778-2-->L778-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1191761691 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In1191761691 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out1191761691| ~a~0_In1191761691) (or .cse0 .cse1)) (and (not .cse1) (= ~a$w_buff1~0_In1191761691 |P1Thread1of1ForFork2_#t~ite9_Out1191761691|) (not .cse0)))) InVars {~a~0=~a~0_In1191761691, ~a$w_buff1~0=~a$w_buff1~0_In1191761691, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1191761691, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1191761691} OutVars{~a~0=~a~0_In1191761691, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1191761691|, ~a$w_buff1~0=~a$w_buff1~0_In1191761691, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1191761691, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1191761691} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 05:31:15,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L778-4-->L779: Formula: (= v_~a~0_18 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{~a~0=v_~a~0_18, 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 05:31:15,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L761-->L762: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1597536842 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-1597536842 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out-1597536842)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_In-1597536842 ~a$r_buff0_thd1~0_Out-1597536842)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1597536842, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1597536842} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1597536842|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1597536842, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1597536842} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:31:15,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In-324783899 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-324783899 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-324783899 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-324783899 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-324783899| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-324783899| ~a$r_buff1_thd1~0_In-324783899) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-324783899, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-324783899, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-324783899, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-324783899} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-324783899|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-324783899, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-324783899, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-324783899, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-324783899} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 05:31:15,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L762-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} 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_15, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} 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 05:31:15,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In415392755 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In415392755 256) 0))) (or (and (= ~a$w_buff0_used~0_In415392755 |P1Thread1of1ForFork2_#t~ite11_Out415392755|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out415392755|) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In415392755, ~a$w_buff0_used~0=~a$w_buff0_used~0_In415392755} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In415392755, ~a$w_buff0_used~0=~a$w_buff0_used~0_In415392755, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out415392755|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 05:31:15,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-568803480 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-568803480 256)))) (or (and .cse1 (= (mod ~a$w_buff1_used~0_In-568803480 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In-568803480 256)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-568803480 256))))) (= |P2Thread1of1ForFork0_#t~ite20_Out-568803480| ~a$w_buff0~0_In-568803480) (= |P2Thread1of1ForFork0_#t~ite20_Out-568803480| |P2Thread1of1ForFork0_#t~ite21_Out-568803480|)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite21_Out-568803480| ~a$w_buff0~0_In-568803480) (= |P2Thread1of1ForFork0_#t~ite20_In-568803480| |P2Thread1of1ForFork0_#t~ite20_Out-568803480|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-568803480, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-568803480, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-568803480, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-568803480, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-568803480, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-568803480|, ~weak$$choice2~0=~weak$$choice2~0_In-568803480} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-568803480|, ~a$w_buff0~0=~a$w_buff0~0_In-568803480, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-568803480, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-568803480, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-568803480, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-568803480|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-568803480, ~weak$$choice2~0=~weak$$choice2~0_In-568803480} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 05:31:15,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L804-->L804-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1920809740 256)))) (or (and (= ~a$w_buff1~0_In-1920809740 |P2Thread1of1ForFork0_#t~ite24_Out-1920809740|) (= |P2Thread1of1ForFork0_#t~ite23_In-1920809740| |P2Thread1of1ForFork0_#t~ite23_Out-1920809740|) (not .cse0)) (and (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1920809740 256) 0))) (or (= (mod ~a$w_buff0_used~0_In-1920809740 256) 0) (and (= (mod ~a$w_buff1_used~0_In-1920809740 256) 0) .cse1) (and (= 0 (mod ~a$r_buff1_thd3~0_In-1920809740 256)) .cse1))) (= ~a$w_buff1~0_In-1920809740 |P2Thread1of1ForFork0_#t~ite23_Out-1920809740|) .cse0 (= |P2Thread1of1ForFork0_#t~ite24_Out-1920809740| |P2Thread1of1ForFork0_#t~ite23_Out-1920809740|)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In-1920809740, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1920809740|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1920809740, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1920809740, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1920809740, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1920809740, ~weak$$choice2~0=~weak$$choice2~0_In-1920809740} OutVars{~a$w_buff1~0=~a$w_buff1~0_In-1920809740, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1920809740|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1920809740|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1920809740, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1920809740, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1920809740, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1920809740, ~weak$$choice2~0=~weak$$choice2~0_In-1920809740} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 05:31:15,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L805-->L805-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1365574076 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_Out1365574076| ~a$w_buff0_used~0_In1365574076) (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In1365574076 256) 0))) (or (= (mod ~a$w_buff0_used~0_In1365574076 256) 0) (and .cse0 (= (mod ~a$r_buff1_thd3~0_In1365574076 256) 0)) (and (= (mod ~a$w_buff1_used~0_In1365574076 256) 0) .cse0))) .cse1 (= |P2Thread1of1ForFork0_#t~ite26_Out1365574076| |P2Thread1of1ForFork0_#t~ite27_Out1365574076|)) (and (= |P2Thread1of1ForFork0_#t~ite27_Out1365574076| ~a$w_buff0_used~0_In1365574076) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite26_In1365574076| |P2Thread1of1ForFork0_#t~ite26_Out1365574076|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1365574076|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1365574076, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1365574076, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1365574076, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1365574076, ~weak$$choice2~0=~weak$$choice2~0_In1365574076} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1365574076|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1365574076|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1365574076, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1365574076, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1365574076, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1365574076, ~weak$$choice2~0=~weak$$choice2~0_In1365574076} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 05:31:15,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-->L808: Formula: (and (= v_~a$r_buff0_thd3~0_49 v_~a$r_buff0_thd3~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_48, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~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 05:31:15,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a~0_16 v_~a$mem_tmp~0_4) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_16, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 05:31:15,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L814-2-->L814-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In1362469038 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd3~0_In1362469038 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out1362469038| ~a~0_In1362469038)) (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In1362469038 |P2Thread1of1ForFork0_#t~ite38_Out1362469038|)))) InVars {~a~0=~a~0_In1362469038, ~a$w_buff1~0=~a$w_buff1~0_In1362469038, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1362469038, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1362469038} OutVars{~a~0=~a~0_In1362469038, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1362469038|, ~a$w_buff1~0=~a$w_buff1~0_In1362469038, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1362469038, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1362469038} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 05:31:15,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L814-4-->L815: Formula: (= v_~a~0_19 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{~a~0=v_~a~0_19, 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 05:31:15,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1801017056 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-1801017056 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-1801017056| ~a$w_buff0_used~0_In-1801017056)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-1801017056| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1801017056, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1801017056} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1801017056|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1801017056, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1801017056} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 05:31:15,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In2136528746 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In2136528746 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In2136528746 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In2136528746 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out2136528746| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out2136528746| ~a$w_buff1_used~0_In2136528746) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2136528746, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2136528746, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2136528746, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2136528746} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2136528746, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2136528746, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2136528746, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2136528746, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out2136528746|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 05:31:15,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L817-->L817-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1303134317 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In-1303134317 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1303134317| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1303134317| ~a$r_buff0_thd3~0_In-1303134317) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1303134317, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1303134317} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1303134317, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1303134317, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1303134317|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 05:31:15,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L818-->L818-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In-256246722 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd3~0_In-256246722 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-256246722 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In-256246722 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-256246722|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$r_buff1_thd3~0_In-256246722 |P2Thread1of1ForFork0_#t~ite43_Out-256246722|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-256246722, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-256246722, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-256246722, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-256246722} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-256246722|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-256246722, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-256246722, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-256246722, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-256246722} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 05:31:15,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= v_~a$r_buff1_thd3~0_42 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} 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_42, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, 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 05:31:15,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L780-->L780-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd2~0_In-1461148474 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1461148474 256))) (.cse0 (= (mod ~a$r_buff1_thd2~0_In-1461148474 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1461148474 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-1461148474| ~a$w_buff1_used~0_In-1461148474) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1461148474| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1461148474, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1461148474, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1461148474, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1461148474} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1461148474, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1461148474, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1461148474, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1461148474|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1461148474} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 05:31:15,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In128436877 256))) (.cse1 (= (mod ~a$r_buff0_thd2~0_In128436877 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out128436877|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In128436877 |P1Thread1of1ForFork2_#t~ite13_Out128436877|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In128436877, ~a$w_buff0_used~0=~a$w_buff0_used~0_In128436877} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In128436877, ~a$w_buff0_used~0=~a$w_buff0_used~0_In128436877, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out128436877|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 05:31:15,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L782-->L782-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd2~0_In1867691467 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In1867691467 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In1867691467 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In1867691467 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out1867691467| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork2_#t~ite14_Out1867691467| ~a$r_buff1_thd2~0_In1867691467) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1867691467, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1867691467, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1867691467, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1867691467} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1867691467, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1867691467, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1867691467, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1867691467, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1867691467|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 05:31:15,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L782-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |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_17, 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_16, 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 05:31:15,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L841-1-->L847: 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_3|, ~__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 05:31:15,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L847-2-->L847-4: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In1145048032 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In1145048032 256)))) (or (and (or .cse0 .cse1) (= ~a~0_In1145048032 |ULTIMATE.start_main_#t~ite47_Out1145048032|)) (and (not .cse1) (not .cse0) (= ~a$w_buff1~0_In1145048032 |ULTIMATE.start_main_#t~ite47_Out1145048032|)))) InVars {~a~0=~a~0_In1145048032, ~a$w_buff1~0=~a$w_buff1~0_In1145048032, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1145048032, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1145048032} OutVars{~a~0=~a~0_In1145048032, ~a$w_buff1~0=~a$w_buff1~0_In1145048032, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1145048032|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1145048032, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1145048032} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 05:31:15,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L847-4-->L848: Formula: (= v_~a~0_21 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{~a~0=v_~a~0_21, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 05:31:15,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1162047934 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1162047934 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out1162047934|) (not .cse1)) (and (= ~a$w_buff0_used~0_In1162047934 |ULTIMATE.start_main_#t~ite49_Out1162047934|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1162047934, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1162047934} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1162047934, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1162047934|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1162047934} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 05:31:15,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L849-->L849-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In1609857324 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In1609857324 256))) (.cse0 (= (mod ~a$r_buff1_thd0~0_In1609857324 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1609857324 256)))) (or (and (= ~a$w_buff1_used~0_In1609857324 |ULTIMATE.start_main_#t~ite50_Out1609857324|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite50_Out1609857324| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1609857324, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1609857324, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1609857324, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1609857324} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1609857324|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1609857324, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1609857324, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1609857324, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1609857324} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 05:31:15,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L850-->L850-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1642478695 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1642478695 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1642478695| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1642478695| ~a$r_buff0_thd0~0_In-1642478695)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1642478695, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1642478695} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1642478695|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1642478695, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1642478695} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 05:31:15,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L851-->L851-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In-223603546 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-223603546 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-223603546 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-223603546 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-223603546|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$r_buff1_thd0~0_In-223603546 |ULTIMATE.start_main_#t~ite52_Out-223603546|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-223603546, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-223603546, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-223603546, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-223603546} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-223603546|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-223603546, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-223603546, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-223603546, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-223603546} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 05:31:15,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= 1 v_~__unbuffered_p0_EAX~0_12) (= v_~__unbuffered_p2_EBX~0_10 0) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_~__unbuffered_p2_EAX~0_9 1) (= v_~__unbuffered_p0_EBX~0_12 0) (= |v_ULTIMATE.start_main_#t~ite52_15| v_~a$r_buff1_thd0~0_19)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_15|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ~__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_12, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ~__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_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} 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 05:31:15,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:31:15 BasicIcfg [2019-12-27 05:31:15,450 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:31:15,452 INFO L168 Benchmark]: Toolchain (without parser) took 110278.61 ms. Allocated memory was 145.8 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.9 MB in the beginning and 1.1 GB in the end (delta: -992.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 05:31:15,452 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 05:31:15,453 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.11 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.5 MB in the beginning and 156.7 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 05:31:15,453 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.78 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 153.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 05:31:15,454 INFO L168 Benchmark]: Boogie Preprocessor took 43.73 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 150.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 05:31:15,454 INFO L168 Benchmark]: RCFGBuilder took 860.71 ms. Allocated memory is still 203.4 MB. Free memory was 150.9 MB in the beginning and 100.8 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-27 05:31:15,454 INFO L168 Benchmark]: TraceAbstraction took 108539.42 ms. Allocated memory was 203.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 99.8 MB in the beginning and 1.1 GB in the end (delta: -994.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 05:31:15,456 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.18 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 756.11 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.5 MB in the beginning and 156.7 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.78 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 153.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.73 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 150.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 860.71 ms. Allocated memory is still 203.4 MB. Free memory was 150.9 MB in the beginning and 100.8 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 108539.42 ms. Allocated memory was 203.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 99.8 MB in the beginning and 1.1 GB in the end (delta: -994.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 179 ProgramPointsBefore, 95 ProgramPointsAfterwards, 216 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7008 VarBasedMoverChecksPositive, 202 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 83227 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t391, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L839] FCALL, FORK 0 pthread_create(&t392, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t393, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$w_buff1 = a$w_buff0 [L738] 1 a$w_buff0 = 1 [L739] 1 a$w_buff1_used = a$w_buff0_used [L740] 1 a$w_buff0_used = (_Bool)1 [L758] 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=1, __unbuffered_p0_EBX=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] [L772] 2 y = 1 [L775] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L778] 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=1, __unbuffered_p0_EBX=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, 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=7, weak$$choice2=1, x=1, y=1, z=1] [L802] 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, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, 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=7, weak$$choice2=1, x=1, y=1, z=1] [L758] 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) [L759] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L760] 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 [L802] 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) [L803] 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)) [L804] 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)) [L805] 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)) [L806] EXPR 3 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : 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=7, weak$$choice2=1, 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))=0, x=1, y=1, z=1] [L806] 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)) [L808] 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 [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : 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=7, 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] [L808] 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)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : 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=7, weak$$choice2=1, x=1, y=1, z=1] [L814] 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 [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : 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=7, weak$$choice2=1, x=1, y=1, z=1] [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 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 [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 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 [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L847] 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=1, __unbuffered_p0_EBX=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=7, weak$$choice2=1, x=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 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 [L850] 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, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 108.2s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 36.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8126 SDtfs, 12867 SDslu, 26980 SDs, 0 SdLazy, 12766 SolverSat, 666 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 482 GetRequests, 64 SyntacticMatches, 18 SemanticMatches, 400 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1758 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160651occurred 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: 42.8s AutomataMinimizationTime, 35 MinimizatonAttempts, 299162 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1662 NumberOfCodeBlocks, 1662 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1560 ConstructedInterpolants, 0 QuantifiedInterpolants, 341298 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...