/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/safe021_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:47:21,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:47:21,758 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:47:21,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:47:21,777 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:47:21,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:47:21,782 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:47:21,791 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:47:21,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:47:21,795 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:47:21,798 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:47:21,800 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:47:21,801 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:47:21,802 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:47:21,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:47:21,806 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:47:21,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:47:21,809 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:47:21,812 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:47:21,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:47:21,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:47:21,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:47:21,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:47:21,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:47:21,830 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:47:21,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:47:21,831 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:47:21,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:47:21,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:47:21,835 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:47:21,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:47:21,836 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:47:21,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:47:21,837 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:47:21,838 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:47:21,839 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:47:21,839 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:47:21,840 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:47:21,840 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:47:21,840 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:47:21,842 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:47:21,843 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-18 22:47:21,876 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:47:21,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:47:21,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:47:21,881 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:47:21,881 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:47:21,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:47:21,881 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:47:21,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:47:21,882 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:47:21,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:47:21,883 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:47:21,883 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:47:21,883 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:47:21,883 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:47:21,884 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:47:21,884 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:47:21,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:47:21,884 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:47:21,884 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:47:21,888 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:47:21,888 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:47:21,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:47:21,889 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:47:21,889 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:47:21,889 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:47:21,889 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:47:21,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:47:21,890 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:47:21,893 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:47:21,893 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:47:22,159 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:47:22,180 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:47:22,185 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:47:22,186 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:47:22,186 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:47:22,187 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_rmo.oepc.i [2019-12-18 22:47:22,258 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2548dabf/e710cb52c215478e9974c7c5a257ff34/FLAGa2a9d1264 [2019-12-18 22:47:22,826 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:47:22,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_rmo.oepc.i [2019-12-18 22:47:22,851 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2548dabf/e710cb52c215478e9974c7c5a257ff34/FLAGa2a9d1264 [2019-12-18 22:47:23,117 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2548dabf/e710cb52c215478e9974c7c5a257ff34 [2019-12-18 22:47:23,127 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:47:23,129 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:47:23,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:47:23,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:47:23,135 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:47:23,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:47:23" (1/1) ... [2019-12-18 22:47:23,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160dde8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:23, skipping insertion in model container [2019-12-18 22:47:23,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:47:23" (1/1) ... [2019-12-18 22:47:23,153 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:47:23,199 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:47:23,734 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:47:23,746 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:47:23,811 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:47:23,887 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:47:23,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:23 WrapperNode [2019-12-18 22:47:23,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:47:23,888 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:47:23,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:47:23,889 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:47:23,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:23" (1/1) ... [2019-12-18 22:47:23,920 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:23" (1/1) ... [2019-12-18 22:47:23,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:47:23,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:47:23,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:47:23,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:47:23,961 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:23" (1/1) ... [2019-12-18 22:47:23,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:23" (1/1) ... [2019-12-18 22:47:23,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:23" (1/1) ... [2019-12-18 22:47:23,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:23" (1/1) ... [2019-12-18 22:47:23,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:23" (1/1) ... [2019-12-18 22:47:23,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:23" (1/1) ... [2019-12-18 22:47:23,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:23" (1/1) ... [2019-12-18 22:47:23,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:47:23,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:47:23,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:47:23,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:47:23,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:47:24,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:47:24,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:47:24,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:47:24,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:47:24,067 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:47:24,068 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:47:24,068 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:47:24,068 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:47:24,068 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:47:24,068 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:47:24,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:47:24,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:47:24,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:47:24,071 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 22:47:24,856 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:47:24,857 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:47:24,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:47:24 BoogieIcfgContainer [2019-12-18 22:47:24,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:47:24,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:47:24,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:47:24,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:47:24,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:47:23" (1/3) ... [2019-12-18 22:47:24,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73df6005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:47:24, skipping insertion in model container [2019-12-18 22:47:24,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:23" (2/3) ... [2019-12-18 22:47:24,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73df6005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:47:24, skipping insertion in model container [2019-12-18 22:47:24,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:47:24" (3/3) ... [2019-12-18 22:47:24,867 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_rmo.oepc.i [2019-12-18 22:47:24,877 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:47:24,877 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:47:24,885 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:47:24,886 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:47:24,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,927 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,928 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,928 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,928 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,929 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,951 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,951 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,959 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,959 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,986 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,987 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,987 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,990 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,991 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,995 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,997 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:24,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:25,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:25,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:25,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:25,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:25,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:25,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:25,019 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:47:25,039 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:47:25,040 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:47:25,040 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:47:25,040 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:47:25,040 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:47:25,040 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:47:25,040 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:47:25,040 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:47:25,057 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 22:47:25,059 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 22:47:25,141 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 22:47:25,141 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:47:25,166 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:47:25,198 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 22:47:25,247 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 22:47:25,248 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:47:25,258 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:47:25,283 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 22:47:25,284 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:47:28,993 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 22:47:29,114 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 22:47:29,132 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80960 [2019-12-18 22:47:29,132 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 22:47:29,138 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-18 22:47:45,429 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106892 states. [2019-12-18 22:47:45,431 INFO L276 IsEmpty]: Start isEmpty. Operand 106892 states. [2019-12-18 22:47:45,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 22:47:45,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:47:45,437 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 22:47:45,438 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-18 22:47:45,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:47:45,443 INFO L82 PathProgramCache]: Analyzing trace with hash 911873, now seen corresponding path program 1 times [2019-12-18 22:47:45,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:47:45,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672508213] [2019-12-18 22:47:45,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:47:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:47:45,634 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-18 22:47:45,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672508213] [2019-12-18 22:47:45,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:47:45,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:47:45,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117452121] [2019-12-18 22:47:45,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:47:45,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:47:45,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:47:45,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:47:45,660 INFO L87 Difference]: Start difference. First operand 106892 states. Second operand 3 states. [2019-12-18 22:47:47,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:47:47,345 INFO L93 Difference]: Finished difference Result 106230 states and 453846 transitions. [2019-12-18 22:47:47,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:47:47,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 22:47:47,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:47:47,939 INFO L225 Difference]: With dead ends: 106230 [2019-12-18 22:47:47,939 INFO L226 Difference]: Without dead ends: 99639 [2019-12-18 22:47:47,941 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-18 22:47:54,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99639 states. [2019-12-18 22:47:57,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99639 to 99639. [2019-12-18 22:47:57,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99639 states. [2019-12-18 22:47:57,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99639 states to 99639 states and 425116 transitions. [2019-12-18 22:47:57,614 INFO L78 Accepts]: Start accepts. Automaton has 99639 states and 425116 transitions. Word has length 3 [2019-12-18 22:47:57,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:47:57,614 INFO L462 AbstractCegarLoop]: Abstraction has 99639 states and 425116 transitions. [2019-12-18 22:47:57,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:47:57,614 INFO L276 IsEmpty]: Start isEmpty. Operand 99639 states and 425116 transitions. [2019-12-18 22:47:57,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:47:57,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:47:57,619 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:47:57,619 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-18 22:47:57,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:47:57,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1470531628, now seen corresponding path program 1 times [2019-12-18 22:47:57,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:47:57,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115725873] [2019-12-18 22:47:57,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:47:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:47:57,781 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-18 22:47:57,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115725873] [2019-12-18 22:47:57,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:47:57,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:47:57,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394227050] [2019-12-18 22:47:57,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:47:57,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:47:57,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:47:57,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:47:57,785 INFO L87 Difference]: Start difference. First operand 99639 states and 425116 transitions. Second operand 4 states. [2019-12-18 22:48:02,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:02,764 INFO L93 Difference]: Finished difference Result 159197 states and 650077 transitions. [2019-12-18 22:48:02,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:48:02,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:48:02,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:03,542 INFO L225 Difference]: With dead ends: 159197 [2019-12-18 22:48:03,542 INFO L226 Difference]: Without dead ends: 159148 [2019-12-18 22:48:03,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:48:11,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159148 states. [2019-12-18 22:48:14,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159148 to 145638. [2019-12-18 22:48:14,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145638 states. [2019-12-18 22:48:15,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145638 states to 145638 states and 602196 transitions. [2019-12-18 22:48:15,818 INFO L78 Accepts]: Start accepts. Automaton has 145638 states and 602196 transitions. Word has length 11 [2019-12-18 22:48:15,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:15,818 INFO L462 AbstractCegarLoop]: Abstraction has 145638 states and 602196 transitions. [2019-12-18 22:48:15,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:48:15,818 INFO L276 IsEmpty]: Start isEmpty. Operand 145638 states and 602196 transitions. [2019-12-18 22:48:15,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:48:15,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:15,825 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:15,825 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-18 22:48:15,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:15,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1074387989, now seen corresponding path program 1 times [2019-12-18 22:48:15,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:15,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075770572] [2019-12-18 22:48:15,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:15,891 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-18 22:48:15,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075770572] [2019-12-18 22:48:15,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:15,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:48:15,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94085627] [2019-12-18 22:48:15,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:48:15,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:15,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:48:15,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:48:15,893 INFO L87 Difference]: Start difference. First operand 145638 states and 602196 transitions. Second operand 3 states. [2019-12-18 22:48:16,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:16,015 INFO L93 Difference]: Finished difference Result 32092 states and 104170 transitions. [2019-12-18 22:48:16,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:48:16,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 22:48:16,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:16,110 INFO L225 Difference]: With dead ends: 32092 [2019-12-18 22:48:16,110 INFO L226 Difference]: Without dead ends: 32092 [2019-12-18 22:48:16,111 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-18 22:48:16,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32092 states. [2019-12-18 22:48:16,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32092 to 32092. [2019-12-18 22:48:16,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32092 states. [2019-12-18 22:48:16,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32092 states to 32092 states and 104170 transitions. [2019-12-18 22:48:16,819 INFO L78 Accepts]: Start accepts. Automaton has 32092 states and 104170 transitions. Word has length 13 [2019-12-18 22:48:16,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:16,819 INFO L462 AbstractCegarLoop]: Abstraction has 32092 states and 104170 transitions. [2019-12-18 22:48:16,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:48:16,819 INFO L276 IsEmpty]: Start isEmpty. Operand 32092 states and 104170 transitions. [2019-12-18 22:48:16,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 22:48:16,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:16,822 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:16,822 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-18 22:48:16,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:16,822 INFO L82 PathProgramCache]: Analyzing trace with hash -625948887, now seen corresponding path program 1 times [2019-12-18 22:48:16,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:16,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122798262] [2019-12-18 22:48:16,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:16,925 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-18 22:48:16,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122798262] [2019-12-18 22:48:16,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:16,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:48:16,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538886673] [2019-12-18 22:48:16,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:48:16,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:16,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:48:16,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:48:16,927 INFO L87 Difference]: Start difference. First operand 32092 states and 104170 transitions. Second operand 5 states. [2019-12-18 22:48:19,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:19,695 INFO L93 Difference]: Finished difference Result 43827 states and 140462 transitions. [2019-12-18 22:48:19,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:48:19,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 22:48:19,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:19,798 INFO L225 Difference]: With dead ends: 43827 [2019-12-18 22:48:19,798 INFO L226 Difference]: Without dead ends: 43827 [2019-12-18 22:48:19,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:48:20,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43827 states. [2019-12-18 22:48:20,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43827 to 37110. [2019-12-18 22:48:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37110 states. [2019-12-18 22:48:20,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37110 states to 37110 states and 119926 transitions. [2019-12-18 22:48:20,590 INFO L78 Accepts]: Start accepts. Automaton has 37110 states and 119926 transitions. Word has length 16 [2019-12-18 22:48:20,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:20,591 INFO L462 AbstractCegarLoop]: Abstraction has 37110 states and 119926 transitions. [2019-12-18 22:48:20,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:48:20,591 INFO L276 IsEmpty]: Start isEmpty. Operand 37110 states and 119926 transitions. [2019-12-18 22:48:20,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 22:48:20,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:20,601 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-18 22:48:20,601 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-18 22:48:20,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:20,602 INFO L82 PathProgramCache]: Analyzing trace with hash 867934420, now seen corresponding path program 1 times [2019-12-18 22:48:20,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:20,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973506185] [2019-12-18 22:48:20,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:20,749 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-18 22:48:20,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973506185] [2019-12-18 22:48:20,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:20,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:48:20,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794526567] [2019-12-18 22:48:20,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:48:20,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:20,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:48:20,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:48:20,752 INFO L87 Difference]: Start difference. First operand 37110 states and 119926 transitions. Second operand 6 states. [2019-12-18 22:48:21,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:21,836 INFO L93 Difference]: Finished difference Result 56855 states and 178889 transitions. [2019-12-18 22:48:21,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 22:48:21,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 22:48:21,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:21,932 INFO L225 Difference]: With dead ends: 56855 [2019-12-18 22:48:21,932 INFO L226 Difference]: Without dead ends: 56848 [2019-12-18 22:48:21,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:48:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56848 states. [2019-12-18 22:48:22,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56848 to 38036. [2019-12-18 22:48:22,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38036 states. [2019-12-18 22:48:23,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38036 states to 38036 states and 122132 transitions. [2019-12-18 22:48:23,048 INFO L78 Accepts]: Start accepts. Automaton has 38036 states and 122132 transitions. Word has length 22 [2019-12-18 22:48:23,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:23,048 INFO L462 AbstractCegarLoop]: Abstraction has 38036 states and 122132 transitions. [2019-12-18 22:48:23,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:48:23,049 INFO L276 IsEmpty]: Start isEmpty. Operand 38036 states and 122132 transitions. [2019-12-18 22:48:23,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:48:23,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:23,063 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-18 22:48:23,063 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-18 22:48:23,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:23,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1491582791, now seen corresponding path program 1 times [2019-12-18 22:48:23,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:23,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988251166] [2019-12-18 22:48:23,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:23,127 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-18 22:48:23,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988251166] [2019-12-18 22:48:23,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:23,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:48:23,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616065869] [2019-12-18 22:48:23,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:48:23,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:23,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:48:23,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:48:23,129 INFO L87 Difference]: Start difference. First operand 38036 states and 122132 transitions. Second operand 4 states. [2019-12-18 22:48:23,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:23,203 INFO L93 Difference]: Finished difference Result 15569 states and 47210 transitions. [2019-12-18 22:48:23,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:48:23,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 22:48:23,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:23,226 INFO L225 Difference]: With dead ends: 15569 [2019-12-18 22:48:23,226 INFO L226 Difference]: Without dead ends: 15569 [2019-12-18 22:48:23,226 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-18 22:48:23,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15569 states. [2019-12-18 22:48:23,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15569 to 15311. [2019-12-18 22:48:23,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15311 states. [2019-12-18 22:48:23,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15311 states to 15311 states and 46474 transitions. [2019-12-18 22:48:23,469 INFO L78 Accepts]: Start accepts. Automaton has 15311 states and 46474 transitions. Word has length 25 [2019-12-18 22:48:23,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:23,470 INFO L462 AbstractCegarLoop]: Abstraction has 15311 states and 46474 transitions. [2019-12-18 22:48:23,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:48:23,470 INFO L276 IsEmpty]: Start isEmpty. Operand 15311 states and 46474 transitions. [2019-12-18 22:48:23,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 22:48:23,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:23,481 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-18 22:48:23,481 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-18 22:48:23,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:23,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1591310570, now seen corresponding path program 1 times [2019-12-18 22:48:23,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:23,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272541740] [2019-12-18 22:48:23,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:23,601 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-18 22:48:23,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272541740] [2019-12-18 22:48:23,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:23,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:48:23,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619618060] [2019-12-18 22:48:23,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:48:23,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:23,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:48:23,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:48:23,604 INFO L87 Difference]: Start difference. First operand 15311 states and 46474 transitions. Second operand 6 states. [2019-12-18 22:48:24,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:24,226 INFO L93 Difference]: Finished difference Result 21967 states and 64800 transitions. [2019-12-18 22:48:24,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:48:24,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 22:48:24,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:24,268 INFO L225 Difference]: With dead ends: 21967 [2019-12-18 22:48:24,268 INFO L226 Difference]: Without dead ends: 21967 [2019-12-18 22:48:24,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:48:24,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21967 states. [2019-12-18 22:48:24,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21967 to 17627. [2019-12-18 22:48:24,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17627 states. [2019-12-18 22:48:24,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17627 states to 17627 states and 53055 transitions. [2019-12-18 22:48:24,724 INFO L78 Accepts]: Start accepts. Automaton has 17627 states and 53055 transitions. Word has length 27 [2019-12-18 22:48:24,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:24,724 INFO L462 AbstractCegarLoop]: Abstraction has 17627 states and 53055 transitions. [2019-12-18 22:48:24,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:48:24,724 INFO L276 IsEmpty]: Start isEmpty. Operand 17627 states and 53055 transitions. [2019-12-18 22:48:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 22:48:24,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:24,751 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-18 22:48:24,751 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-18 22:48:24,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:24,752 INFO L82 PathProgramCache]: Analyzing trace with hash 174996949, now seen corresponding path program 1 times [2019-12-18 22:48:24,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:24,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844596111] [2019-12-18 22:48:24,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:24,946 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-18 22:48:24,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844596111] [2019-12-18 22:48:24,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:24,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:48:24,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073782118] [2019-12-18 22:48:24,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:48:24,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:24,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:48:24,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:48:24,949 INFO L87 Difference]: Start difference. First operand 17627 states and 53055 transitions. Second operand 8 states. [2019-12-18 22:48:26,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:26,173 INFO L93 Difference]: Finished difference Result 24849 states and 72852 transitions. [2019-12-18 22:48:26,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 22:48:26,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 22:48:26,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:26,209 INFO L225 Difference]: With dead ends: 24849 [2019-12-18 22:48:26,209 INFO L226 Difference]: Without dead ends: 24849 [2019-12-18 22:48:26,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-12-18 22:48:26,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24849 states. [2019-12-18 22:48:26,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24849 to 17725. [2019-12-18 22:48:26,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17725 states. [2019-12-18 22:48:26,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17725 states to 17725 states and 53335 transitions. [2019-12-18 22:48:26,671 INFO L78 Accepts]: Start accepts. Automaton has 17725 states and 53335 transitions. Word has length 33 [2019-12-18 22:48:26,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:26,671 INFO L462 AbstractCegarLoop]: Abstraction has 17725 states and 53335 transitions. [2019-12-18 22:48:26,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:48:26,671 INFO L276 IsEmpty]: Start isEmpty. Operand 17725 states and 53335 transitions. [2019-12-18 22:48:26,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 22:48:26,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:26,691 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-18 22:48:26,691 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-18 22:48:26,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:26,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1052383531, now seen corresponding path program 2 times [2019-12-18 22:48:26,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:26,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010806410] [2019-12-18 22:48:26,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:26,820 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-18 22:48:26,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010806410] [2019-12-18 22:48:26,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:26,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:48:26,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733448843] [2019-12-18 22:48:26,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:48:26,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:26,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:48:26,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:48:26,823 INFO L87 Difference]: Start difference. First operand 17725 states and 53335 transitions. Second operand 8 states. [2019-12-18 22:48:28,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:28,077 INFO L93 Difference]: Finished difference Result 27470 states and 80799 transitions. [2019-12-18 22:48:28,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 22:48:28,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 22:48:28,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:28,116 INFO L225 Difference]: With dead ends: 27470 [2019-12-18 22:48:28,116 INFO L226 Difference]: Without dead ends: 27470 [2019-12-18 22:48:28,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2019-12-18 22:48:28,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27470 states. [2019-12-18 22:48:28,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27470 to 18666. [2019-12-18 22:48:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18666 states. [2019-12-18 22:48:28,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18666 states to 18666 states and 56148 transitions. [2019-12-18 22:48:28,453 INFO L78 Accepts]: Start accepts. Automaton has 18666 states and 56148 transitions. Word has length 33 [2019-12-18 22:48:28,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:28,453 INFO L462 AbstractCegarLoop]: Abstraction has 18666 states and 56148 transitions. [2019-12-18 22:48:28,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:48:28,453 INFO L276 IsEmpty]: Start isEmpty. Operand 18666 states and 56148 transitions. [2019-12-18 22:48:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 22:48:28,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:28,474 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-18 22:48:28,474 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-18 22:48:28,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:28,474 INFO L82 PathProgramCache]: Analyzing trace with hash -285626845, now seen corresponding path program 1 times [2019-12-18 22:48:28,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:28,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945482794] [2019-12-18 22:48:28,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:28,578 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-18 22:48:28,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945482794] [2019-12-18 22:48:28,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:28,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:48:28,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25988214] [2019-12-18 22:48:28,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:48:28,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:28,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:48:28,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:48:28,580 INFO L87 Difference]: Start difference. First operand 18666 states and 56148 transitions. Second operand 7 states. [2019-12-18 22:48:29,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:29,817 INFO L93 Difference]: Finished difference Result 24110 states and 70822 transitions. [2019-12-18 22:48:29,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 22:48:29,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 22:48:29,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:29,849 INFO L225 Difference]: With dead ends: 24110 [2019-12-18 22:48:29,849 INFO L226 Difference]: Without dead ends: 24110 [2019-12-18 22:48:29,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 22:48:29,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24110 states. [2019-12-18 22:48:30,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24110 to 17189. [2019-12-18 22:48:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17189 states. [2019-12-18 22:48:30,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17189 states to 17189 states and 51774 transitions. [2019-12-18 22:48:30,148 INFO L78 Accepts]: Start accepts. Automaton has 17189 states and 51774 transitions. Word has length 34 [2019-12-18 22:48:30,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:30,148 INFO L462 AbstractCegarLoop]: Abstraction has 17189 states and 51774 transitions. [2019-12-18 22:48:30,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:48:30,149 INFO L276 IsEmpty]: Start isEmpty. Operand 17189 states and 51774 transitions. [2019-12-18 22:48:30,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 22:48:30,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:30,169 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-18 22:48:30,170 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-18 22:48:30,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:30,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1438899484, now seen corresponding path program 1 times [2019-12-18 22:48:30,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:30,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285545305] [2019-12-18 22:48:30,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:30,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285545305] [2019-12-18 22:48:30,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:30,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:48:30,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246154685] [2019-12-18 22:48:30,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:48:30,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:30,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:48:30,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:48:30,228 INFO L87 Difference]: Start difference. First operand 17189 states and 51774 transitions. Second operand 3 states. [2019-12-18 22:48:30,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:30,293 INFO L93 Difference]: Finished difference Result 17188 states and 51772 transitions. [2019-12-18 22:48:30,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:48:30,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 22:48:30,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:30,320 INFO L225 Difference]: With dead ends: 17188 [2019-12-18 22:48:30,321 INFO L226 Difference]: Without dead ends: 17188 [2019-12-18 22:48:30,321 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-18 22:48:30,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17188 states. [2019-12-18 22:48:30,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17188 to 17188. [2019-12-18 22:48:30,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17188 states. [2019-12-18 22:48:30,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17188 states to 17188 states and 51772 transitions. [2019-12-18 22:48:30,674 INFO L78 Accepts]: Start accepts. Automaton has 17188 states and 51772 transitions. Word has length 39 [2019-12-18 22:48:30,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:30,674 INFO L462 AbstractCegarLoop]: Abstraction has 17188 states and 51772 transitions. [2019-12-18 22:48:30,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:48:30,674 INFO L276 IsEmpty]: Start isEmpty. Operand 17188 states and 51772 transitions. [2019-12-18 22:48:30,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 22:48:30,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:30,691 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-18 22:48:30,691 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-18 22:48:30,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:30,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1842516343, now seen corresponding path program 1 times [2019-12-18 22:48:30,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:30,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222904573] [2019-12-18 22:48:30,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:30,747 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-18 22:48:30,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222904573] [2019-12-18 22:48:30,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:30,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:48:30,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15096252] [2019-12-18 22:48:30,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:48:30,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:30,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:48:30,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:48:30,749 INFO L87 Difference]: Start difference. First operand 17188 states and 51772 transitions. Second operand 4 states. [2019-12-18 22:48:30,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:30,896 INFO L93 Difference]: Finished difference Result 32511 states and 97991 transitions. [2019-12-18 22:48:30,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:48:30,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-18 22:48:30,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:30,929 INFO L225 Difference]: With dead ends: 32511 [2019-12-18 22:48:30,929 INFO L226 Difference]: Without dead ends: 16834 [2019-12-18 22:48:30,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-18 22:48:31,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16834 states. [2019-12-18 22:48:31,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16834 to 16814. [2019-12-18 22:48:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16814 states. [2019-12-18 22:48:31,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16814 states to 16814 states and 49963 transitions. [2019-12-18 22:48:31,191 INFO L78 Accepts]: Start accepts. Automaton has 16814 states and 49963 transitions. Word has length 40 [2019-12-18 22:48:31,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:31,191 INFO L462 AbstractCegarLoop]: Abstraction has 16814 states and 49963 transitions. [2019-12-18 22:48:31,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:48:31,191 INFO L276 IsEmpty]: Start isEmpty. Operand 16814 states and 49963 transitions. [2019-12-18 22:48:31,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 22:48:31,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:31,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] [2019-12-18 22:48:31,207 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-18 22:48:31,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:31,208 INFO L82 PathProgramCache]: Analyzing trace with hash 559678541, now seen corresponding path program 2 times [2019-12-18 22:48:31,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:31,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113110157] [2019-12-18 22:48:31,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:31,277 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-18 22:48:31,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113110157] [2019-12-18 22:48:31,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:31,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:48:31,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952264880] [2019-12-18 22:48:31,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:48:31,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:31,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:48:31,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:48:31,279 INFO L87 Difference]: Start difference. First operand 16814 states and 49963 transitions. Second operand 5 states. [2019-12-18 22:48:32,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:32,050 INFO L93 Difference]: Finished difference Result 23212 states and 68706 transitions. [2019-12-18 22:48:32,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:48:32,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 22:48:32,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:32,096 INFO L225 Difference]: With dead ends: 23212 [2019-12-18 22:48:32,097 INFO L226 Difference]: Without dead ends: 23212 [2019-12-18 22:48:32,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:48:32,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23212 states. [2019-12-18 22:48:32,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23212 to 21606. [2019-12-18 22:48:32,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21606 states. [2019-12-18 22:48:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21606 states to 21606 states and 64286 transitions. [2019-12-18 22:48:32,510 INFO L78 Accepts]: Start accepts. Automaton has 21606 states and 64286 transitions. Word has length 40 [2019-12-18 22:48:32,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:32,510 INFO L462 AbstractCegarLoop]: Abstraction has 21606 states and 64286 transitions. [2019-12-18 22:48:32,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:48:32,511 INFO L276 IsEmpty]: Start isEmpty. Operand 21606 states and 64286 transitions. [2019-12-18 22:48:32,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 22:48:32,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:32,536 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-18 22:48:32,536 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-18 22:48:32,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:32,537 INFO L82 PathProgramCache]: Analyzing trace with hash 698759109, now seen corresponding path program 3 times [2019-12-18 22:48:32,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:32,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725993313] [2019-12-18 22:48:32,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:32,592 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-18 22:48:32,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725993313] [2019-12-18 22:48:32,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:32,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:48:32,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453171906] [2019-12-18 22:48:32,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:48:32,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:32,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:48:32,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:48:32,595 INFO L87 Difference]: Start difference. First operand 21606 states and 64286 transitions. Second operand 5 states. [2019-12-18 22:48:32,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:32,684 INFO L93 Difference]: Finished difference Result 20361 states and 61415 transitions. [2019-12-18 22:48:32,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:48:32,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 22:48:32,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:32,718 INFO L225 Difference]: With dead ends: 20361 [2019-12-18 22:48:32,718 INFO L226 Difference]: Without dead ends: 19867 [2019-12-18 22:48:32,719 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-18 22:48:32,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19867 states. [2019-12-18 22:48:32,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19867 to 19027. [2019-12-18 22:48:32,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19027 states. [2019-12-18 22:48:33,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19027 states to 19027 states and 58184 transitions. [2019-12-18 22:48:33,007 INFO L78 Accepts]: Start accepts. Automaton has 19027 states and 58184 transitions. Word has length 40 [2019-12-18 22:48:33,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:33,007 INFO L462 AbstractCegarLoop]: Abstraction has 19027 states and 58184 transitions. [2019-12-18 22:48:33,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:48:33,007 INFO L276 IsEmpty]: Start isEmpty. Operand 19027 states and 58184 transitions. [2019-12-18 22:48:33,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 22:48:33,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:33,033 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] [2019-12-18 22:48:33,033 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-18 22:48:33,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:33,033 INFO L82 PathProgramCache]: Analyzing trace with hash -19391093, now seen corresponding path program 1 times [2019-12-18 22:48:33,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:33,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430545210] [2019-12-18 22:48:33,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:33,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:33,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430545210] [2019-12-18 22:48:33,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:33,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:48:33,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607165497] [2019-12-18 22:48:33,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:48:33,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:33,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:48:33,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:48:33,073 INFO L87 Difference]: Start difference. First operand 19027 states and 58184 transitions. Second operand 3 states. [2019-12-18 22:48:33,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:33,181 INFO L93 Difference]: Finished difference Result 27818 states and 85120 transitions. [2019-12-18 22:48:33,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:48:33,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 22:48:33,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:33,229 INFO L225 Difference]: With dead ends: 27818 [2019-12-18 22:48:33,230 INFO L226 Difference]: Without dead ends: 27818 [2019-12-18 22:48:33,230 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-18 22:48:33,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27818 states. [2019-12-18 22:48:33,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27818 to 21381. [2019-12-18 22:48:33,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21381 states. [2019-12-18 22:48:33,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21381 states to 21381 states and 66143 transitions. [2019-12-18 22:48:33,709 INFO L78 Accepts]: Start accepts. Automaton has 21381 states and 66143 transitions. Word has length 64 [2019-12-18 22:48:33,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:33,709 INFO L462 AbstractCegarLoop]: Abstraction has 21381 states and 66143 transitions. [2019-12-18 22:48:33,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:48:33,709 INFO L276 IsEmpty]: Start isEmpty. Operand 21381 states and 66143 transitions. [2019-12-18 22:48:33,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 22:48:33,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:33,730 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] [2019-12-18 22:48:33,731 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-18 22:48:33,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:33,731 INFO L82 PathProgramCache]: Analyzing trace with hash -776574144, now seen corresponding path program 1 times [2019-12-18 22:48:33,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:33,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558811630] [2019-12-18 22:48:33,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:33,822 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-18 22:48:33,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558811630] [2019-12-18 22:48:33,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:33,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:48:33,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532487779] [2019-12-18 22:48:33,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:48:33,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:33,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:48:33,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:48:33,826 INFO L87 Difference]: Start difference. First operand 21381 states and 66143 transitions. Second operand 7 states. [2019-12-18 22:48:34,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:34,463 INFO L93 Difference]: Finished difference Result 62932 states and 192223 transitions. [2019-12-18 22:48:34,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 22:48:34,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 22:48:34,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:34,564 INFO L225 Difference]: With dead ends: 62932 [2019-12-18 22:48:34,564 INFO L226 Difference]: Without dead ends: 43259 [2019-12-18 22:48:34,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:48:34,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43259 states. [2019-12-18 22:48:35,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43259 to 24376. [2019-12-18 22:48:35,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24376 states. [2019-12-18 22:48:35,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24376 states to 24376 states and 75314 transitions. [2019-12-18 22:48:35,129 INFO L78 Accepts]: Start accepts. Automaton has 24376 states and 75314 transitions. Word has length 64 [2019-12-18 22:48:35,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:35,129 INFO L462 AbstractCegarLoop]: Abstraction has 24376 states and 75314 transitions. [2019-12-18 22:48:35,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:48:35,130 INFO L276 IsEmpty]: Start isEmpty. Operand 24376 states and 75314 transitions. [2019-12-18 22:48:35,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 22:48:35,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:35,163 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] [2019-12-18 22:48:35,163 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-18 22:48:35,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:35,163 INFO L82 PathProgramCache]: Analyzing trace with hash 4176110, now seen corresponding path program 2 times [2019-12-18 22:48:35,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:35,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750303429] [2019-12-18 22:48:35,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:35,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:35,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750303429] [2019-12-18 22:48:35,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:35,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:48:35,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320507296] [2019-12-18 22:48:35,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:48:35,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:35,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:48:35,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:48:35,252 INFO L87 Difference]: Start difference. First operand 24376 states and 75314 transitions. Second operand 7 states. [2019-12-18 22:48:35,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:35,871 INFO L93 Difference]: Finished difference Result 70430 states and 216693 transitions. [2019-12-18 22:48:35,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 22:48:35,872 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 22:48:35,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:35,957 INFO L225 Difference]: With dead ends: 70430 [2019-12-18 22:48:35,957 INFO L226 Difference]: Without dead ends: 53055 [2019-12-18 22:48:35,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:48:36,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53055 states. [2019-12-18 22:48:36,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53055 to 28503. [2019-12-18 22:48:36,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28503 states. [2019-12-18 22:48:36,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28503 states to 28503 states and 88629 transitions. [2019-12-18 22:48:36,883 INFO L78 Accepts]: Start accepts. Automaton has 28503 states and 88629 transitions. Word has length 64 [2019-12-18 22:48:36,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:36,883 INFO L462 AbstractCegarLoop]: Abstraction has 28503 states and 88629 transitions. [2019-12-18 22:48:36,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:48:36,883 INFO L276 IsEmpty]: Start isEmpty. Operand 28503 states and 88629 transitions. [2019-12-18 22:48:36,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 22:48:36,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:36,916 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] [2019-12-18 22:48:36,916 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-18 22:48:36,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:36,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1890015084, now seen corresponding path program 3 times [2019-12-18 22:48:36,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:36,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293882046] [2019-12-18 22:48:36,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:36,999 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-18 22:48:36,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293882046] [2019-12-18 22:48:37,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:37,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:48:37,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266548373] [2019-12-18 22:48:37,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:48:37,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:37,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:48:37,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:48:37,002 INFO L87 Difference]: Start difference. First operand 28503 states and 88629 transitions. Second operand 7 states. [2019-12-18 22:48:37,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:37,520 INFO L93 Difference]: Finished difference Result 60432 states and 185591 transitions. [2019-12-18 22:48:37,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:48:37,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 22:48:37,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:37,596 INFO L225 Difference]: With dead ends: 60432 [2019-12-18 22:48:37,596 INFO L226 Difference]: Without dead ends: 53073 [2019-12-18 22:48:37,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 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-18 22:48:37,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53073 states. [2019-12-18 22:48:38,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53073 to 28811. [2019-12-18 22:48:38,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28811 states. [2019-12-18 22:48:38,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28811 states to 28811 states and 89580 transitions. [2019-12-18 22:48:38,206 INFO L78 Accepts]: Start accepts. Automaton has 28811 states and 89580 transitions. Word has length 64 [2019-12-18 22:48:38,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:38,207 INFO L462 AbstractCegarLoop]: Abstraction has 28811 states and 89580 transitions. [2019-12-18 22:48:38,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:48:38,207 INFO L276 IsEmpty]: Start isEmpty. Operand 28811 states and 89580 transitions. [2019-12-18 22:48:38,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 22:48:38,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:38,237 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] [2019-12-18 22:48:38,237 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-18 22:48:38,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:38,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1583546656, now seen corresponding path program 4 times [2019-12-18 22:48:38,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:38,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498864374] [2019-12-18 22:48:38,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:38,293 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-18 22:48:38,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498864374] [2019-12-18 22:48:38,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:38,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:48:38,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098924466] [2019-12-18 22:48:38,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:48:38,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:38,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:48:38,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:48:38,295 INFO L87 Difference]: Start difference. First operand 28811 states and 89580 transitions. Second operand 3 states. [2019-12-18 22:48:38,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:38,446 INFO L93 Difference]: Finished difference Result 34368 states and 106111 transitions. [2019-12-18 22:48:38,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:48:38,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 22:48:38,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:38,493 INFO L225 Difference]: With dead ends: 34368 [2019-12-18 22:48:38,493 INFO L226 Difference]: Without dead ends: 34368 [2019-12-18 22:48:38,493 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-18 22:48:38,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34368 states. [2019-12-18 22:48:38,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34368 to 30218. [2019-12-18 22:48:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30218 states. [2019-12-18 22:48:38,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30218 states to 30218 states and 93973 transitions. [2019-12-18 22:48:38,986 INFO L78 Accepts]: Start accepts. Automaton has 30218 states and 93973 transitions. Word has length 64 [2019-12-18 22:48:38,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:38,987 INFO L462 AbstractCegarLoop]: Abstraction has 30218 states and 93973 transitions. [2019-12-18 22:48:38,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:48:38,987 INFO L276 IsEmpty]: Start isEmpty. Operand 30218 states and 93973 transitions. [2019-12-18 22:48:39,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:48:39,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:39,027 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-18 22:48:39,027 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-18 22:48:39,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:39,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1838532524, now seen corresponding path program 1 times [2019-12-18 22:48:39,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:39,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343131547] [2019-12-18 22:48:39,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:39,079 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-18 22:48:39,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343131547] [2019-12-18 22:48:39,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:39,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:48:39,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562793538] [2019-12-18 22:48:39,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:48:39,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:39,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:48:39,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:48:39,081 INFO L87 Difference]: Start difference. First operand 30218 states and 93973 transitions. Second operand 4 states. [2019-12-18 22:48:39,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:39,467 INFO L93 Difference]: Finished difference Result 38058 states and 117223 transitions. [2019-12-18 22:48:39,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:48:39,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 22:48:39,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:39,521 INFO L225 Difference]: With dead ends: 38058 [2019-12-18 22:48:39,521 INFO L226 Difference]: Without dead ends: 38058 [2019-12-18 22:48:39,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-18 22:48:39,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38058 states. [2019-12-18 22:48:40,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38058 to 30836. [2019-12-18 22:48:40,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30836 states. [2019-12-18 22:48:40,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30836 states to 30836 states and 95961 transitions. [2019-12-18 22:48:40,061 INFO L78 Accepts]: Start accepts. Automaton has 30836 states and 95961 transitions. Word has length 65 [2019-12-18 22:48:40,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:40,061 INFO L462 AbstractCegarLoop]: Abstraction has 30836 states and 95961 transitions. [2019-12-18 22:48:40,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:48:40,061 INFO L276 IsEmpty]: Start isEmpty. Operand 30836 states and 95961 transitions. [2019-12-18 22:48:40,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:48:40,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:40,094 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-18 22:48:40,094 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-18 22:48:40,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:40,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1450523796, now seen corresponding path program 2 times [2019-12-18 22:48:40,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:40,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788038344] [2019-12-18 22:48:40,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:40,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:40,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788038344] [2019-12-18 22:48:40,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:40,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:48:40,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200224758] [2019-12-18 22:48:40,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:48:40,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:40,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:48:40,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:48:40,149 INFO L87 Difference]: Start difference. First operand 30836 states and 95961 transitions. Second operand 4 states. [2019-12-18 22:48:40,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:40,490 INFO L93 Difference]: Finished difference Result 48141 states and 150231 transitions. [2019-12-18 22:48:40,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:48:40,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 22:48:40,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:40,564 INFO L225 Difference]: With dead ends: 48141 [2019-12-18 22:48:40,564 INFO L226 Difference]: Without dead ends: 48141 [2019-12-18 22:48:40,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-18 22:48:40,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48141 states. [2019-12-18 22:48:41,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48141 to 32995. [2019-12-18 22:48:41,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32995 states. [2019-12-18 22:48:41,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32995 states to 32995 states and 103746 transitions. [2019-12-18 22:48:41,197 INFO L78 Accepts]: Start accepts. Automaton has 32995 states and 103746 transitions. Word has length 65 [2019-12-18 22:48:41,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:41,197 INFO L462 AbstractCegarLoop]: Abstraction has 32995 states and 103746 transitions. [2019-12-18 22:48:41,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:48:41,197 INFO L276 IsEmpty]: Start isEmpty. Operand 32995 states and 103746 transitions. [2019-12-18 22:48:41,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:48:41,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:41,232 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-18 22:48:41,232 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-18 22:48:41,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:41,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1631986328, now seen corresponding path program 3 times [2019-12-18 22:48:41,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:41,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180557838] [2019-12-18 22:48:41,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:41,301 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-18 22:48:41,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180557838] [2019-12-18 22:48:41,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:41,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:48:41,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329203170] [2019-12-18 22:48:41,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:48:41,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:41,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:48:41,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:48:41,303 INFO L87 Difference]: Start difference. First operand 32995 states and 103746 transitions. Second operand 7 states. [2019-12-18 22:48:41,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:41,805 INFO L93 Difference]: Finished difference Result 72421 states and 224911 transitions. [2019-12-18 22:48:41,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:48:41,806 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 22:48:41,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:41,919 INFO L225 Difference]: With dead ends: 72421 [2019-12-18 22:48:41,920 INFO L226 Difference]: Without dead ends: 66202 [2019-12-18 22:48:41,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:48:42,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66202 states. [2019-12-18 22:48:42,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66202 to 33027. [2019-12-18 22:48:42,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33027 states. [2019-12-18 22:48:42,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33027 states to 33027 states and 103864 transitions. [2019-12-18 22:48:42,969 INFO L78 Accepts]: Start accepts. Automaton has 33027 states and 103864 transitions. Word has length 65 [2019-12-18 22:48:42,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:42,969 INFO L462 AbstractCegarLoop]: Abstraction has 33027 states and 103864 transitions. [2019-12-18 22:48:42,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:48:42,969 INFO L276 IsEmpty]: Start isEmpty. Operand 33027 states and 103864 transitions. [2019-12-18 22:48:43,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:48:43,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:43,005 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-18 22:48:43,006 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-18 22:48:43,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:43,006 INFO L82 PathProgramCache]: Analyzing trace with hash -855143256, now seen corresponding path program 4 times [2019-12-18 22:48:43,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:43,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146453468] [2019-12-18 22:48:43,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:43,114 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-18 22:48:43,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146453468] [2019-12-18 22:48:43,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:43,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:48:43,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982885147] [2019-12-18 22:48:43,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:48:43,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:43,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:48:43,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:48:43,116 INFO L87 Difference]: Start difference. First operand 33027 states and 103864 transitions. Second operand 7 states. [2019-12-18 22:48:43,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:43,688 INFO L93 Difference]: Finished difference Result 53845 states and 170272 transitions. [2019-12-18 22:48:43,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:48:43,688 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 22:48:43,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:43,773 INFO L225 Difference]: With dead ends: 53845 [2019-12-18 22:48:43,774 INFO L226 Difference]: Without dead ends: 53845 [2019-12-18 22:48:43,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:48:43,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53845 states. [2019-12-18 22:48:44,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53845 to 34199. [2019-12-18 22:48:44,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34199 states. [2019-12-18 22:48:44,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34199 states to 34199 states and 107426 transitions. [2019-12-18 22:48:44,505 INFO L78 Accepts]: Start accepts. Automaton has 34199 states and 107426 transitions. Word has length 65 [2019-12-18 22:48:44,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:44,505 INFO L462 AbstractCegarLoop]: Abstraction has 34199 states and 107426 transitions. [2019-12-18 22:48:44,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:48:44,508 INFO L276 IsEmpty]: Start isEmpty. Operand 34199 states and 107426 transitions. [2019-12-18 22:48:44,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:48:44,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:44,546 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-18 22:48:44,546 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-18 22:48:44,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:44,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1607407314, now seen corresponding path program 1 times [2019-12-18 22:48:44,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:44,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80408111] [2019-12-18 22:48:44,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:44,611 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-18 22:48:44,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80408111] [2019-12-18 22:48:44,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:44,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:48:44,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471695783] [2019-12-18 22:48:44,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:48:44,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:44,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:48:44,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:48:44,614 INFO L87 Difference]: Start difference. First operand 34199 states and 107426 transitions. Second operand 5 states. [2019-12-18 22:48:45,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:45,219 INFO L93 Difference]: Finished difference Result 49777 states and 152916 transitions. [2019-12-18 22:48:45,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:48:45,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 22:48:45,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:45,297 INFO L225 Difference]: With dead ends: 49777 [2019-12-18 22:48:45,297 INFO L226 Difference]: Without dead ends: 49557 [2019-12-18 22:48:45,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:48:45,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49557 states. [2019-12-18 22:48:46,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49557 to 39728. [2019-12-18 22:48:46,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39728 states. [2019-12-18 22:48:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39728 states to 39728 states and 124203 transitions. [2019-12-18 22:48:46,213 INFO L78 Accepts]: Start accepts. Automaton has 39728 states and 124203 transitions. Word has length 65 [2019-12-18 22:48:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:46,213 INFO L462 AbstractCegarLoop]: Abstraction has 39728 states and 124203 transitions. [2019-12-18 22:48:46,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:48:46,213 INFO L276 IsEmpty]: Start isEmpty. Operand 39728 states and 124203 transitions. [2019-12-18 22:48:46,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:48:46,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:46,257 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-18 22:48:46,257 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-18 22:48:46,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:46,258 INFO L82 PathProgramCache]: Analyzing trace with hash 99240326, now seen corresponding path program 2 times [2019-12-18 22:48:46,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:46,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680565842] [2019-12-18 22:48:46,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:46,459 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-18 22:48:46,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680565842] [2019-12-18 22:48:46,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:46,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 22:48:46,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952955710] [2019-12-18 22:48:46,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:48:46,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:46,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:48:46,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:48:46,461 INFO L87 Difference]: Start difference. First operand 39728 states and 124203 transitions. Second operand 11 states. [2019-12-18 22:48:48,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:48,960 INFO L93 Difference]: Finished difference Result 66182 states and 202868 transitions. [2019-12-18 22:48:48,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 22:48:48,961 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 22:48:48,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:49,065 INFO L225 Difference]: With dead ends: 66182 [2019-12-18 22:48:49,066 INFO L226 Difference]: Without dead ends: 66063 [2019-12-18 22:48:49,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2019-12-18 22:48:49,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66063 states. [2019-12-18 22:48:49,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66063 to 49486. [2019-12-18 22:48:49,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49486 states. [2019-12-18 22:48:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49486 states to 49486 states and 153569 transitions. [2019-12-18 22:48:50,070 INFO L78 Accepts]: Start accepts. Automaton has 49486 states and 153569 transitions. Word has length 65 [2019-12-18 22:48:50,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:50,070 INFO L462 AbstractCegarLoop]: Abstraction has 49486 states and 153569 transitions. [2019-12-18 22:48:50,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:48:50,070 INFO L276 IsEmpty]: Start isEmpty. Operand 49486 states and 153569 transitions. [2019-12-18 22:48:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:48:50,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:50,510 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-18 22:48:50,510 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-18 22:48:50,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:50,511 INFO L82 PathProgramCache]: Analyzing trace with hash -154311598, now seen corresponding path program 3 times [2019-12-18 22:48:50,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:50,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518040139] [2019-12-18 22:48:50,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:50,732 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-18 22:48:50,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518040139] [2019-12-18 22:48:50,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:50,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 22:48:50,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882616327] [2019-12-18 22:48:50,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:48:50,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:50,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:48:50,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:48:50,734 INFO L87 Difference]: Start difference. First operand 49486 states and 153569 transitions. Second operand 12 states. [2019-12-18 22:48:53,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:53,892 INFO L93 Difference]: Finished difference Result 80769 states and 246015 transitions. [2019-12-18 22:48:53,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 22:48:53,893 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-18 22:48:53,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:54,025 INFO L225 Difference]: With dead ends: 80769 [2019-12-18 22:48:54,025 INFO L226 Difference]: Without dead ends: 80473 [2019-12-18 22:48:54,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=891, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 22:48:54,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80473 states. [2019-12-18 22:48:55,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80473 to 52843. [2019-12-18 22:48:55,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52843 states. [2019-12-18 22:48:55,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52843 states to 52843 states and 163234 transitions. [2019-12-18 22:48:55,124 INFO L78 Accepts]: Start accepts. Automaton has 52843 states and 163234 transitions. Word has length 65 [2019-12-18 22:48:55,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:55,124 INFO L462 AbstractCegarLoop]: Abstraction has 52843 states and 163234 transitions. [2019-12-18 22:48:55,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:48:55,124 INFO L276 IsEmpty]: Start isEmpty. Operand 52843 states and 163234 transitions. [2019-12-18 22:48:55,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:48:55,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:55,189 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-18 22:48:55,189 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-18 22:48:55,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:55,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1583496514, now seen corresponding path program 4 times [2019-12-18 22:48:55,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:55,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668566320] [2019-12-18 22:48:55,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:55,245 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-18 22:48:55,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668566320] [2019-12-18 22:48:55,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:55,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:48:55,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873658834] [2019-12-18 22:48:55,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:48:55,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:55,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:48:55,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:48:55,247 INFO L87 Difference]: Start difference. First operand 52843 states and 163234 transitions. Second operand 3 states. [2019-12-18 22:48:55,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:55,495 INFO L93 Difference]: Finished difference Result 52843 states and 163233 transitions. [2019-12-18 22:48:55,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:48:55,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:48:55,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:55,609 INFO L225 Difference]: With dead ends: 52843 [2019-12-18 22:48:55,609 INFO L226 Difference]: Without dead ends: 52843 [2019-12-18 22:48:55,610 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-18 22:48:56,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52843 states. [2019-12-18 22:48:56,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52843 to 39255. [2019-12-18 22:48:56,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39255 states. [2019-12-18 22:48:56,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39255 states to 39255 states and 124025 transitions. [2019-12-18 22:48:56,693 INFO L78 Accepts]: Start accepts. Automaton has 39255 states and 124025 transitions. Word has length 65 [2019-12-18 22:48:56,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:56,693 INFO L462 AbstractCegarLoop]: Abstraction has 39255 states and 124025 transitions. [2019-12-18 22:48:56,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:48:56,693 INFO L276 IsEmpty]: Start isEmpty. Operand 39255 states and 124025 transitions. [2019-12-18 22:48:56,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:48:56,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:56,738 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-18 22:48:56,738 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-18 22:48:56,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:56,739 INFO L82 PathProgramCache]: Analyzing trace with hash -871413024, now seen corresponding path program 1 times [2019-12-18 22:48:56,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:56,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678938305] [2019-12-18 22:48:56,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:56,793 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-18 22:48:56,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678938305] [2019-12-18 22:48:56,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:56,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:48:56,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135647736] [2019-12-18 22:48:56,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:48:56,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:56,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:48:56,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:48:56,794 INFO L87 Difference]: Start difference. First operand 39255 states and 124025 transitions. Second operand 3 states. [2019-12-18 22:48:56,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:56,944 INFO L93 Difference]: Finished difference Result 29796 states and 92689 transitions. [2019-12-18 22:48:56,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:48:56,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 22:48:56,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:57,006 INFO L225 Difference]: With dead ends: 29796 [2019-12-18 22:48:57,007 INFO L226 Difference]: Without dead ends: 29796 [2019-12-18 22:48:57,007 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-18 22:48:57,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29796 states. [2019-12-18 22:48:57,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29796 to 28150. [2019-12-18 22:48:57,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28150 states. [2019-12-18 22:48:57,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28150 states to 28150 states and 87484 transitions. [2019-12-18 22:48:57,454 INFO L78 Accepts]: Start accepts. Automaton has 28150 states and 87484 transitions. Word has length 66 [2019-12-18 22:48:57,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:57,454 INFO L462 AbstractCegarLoop]: Abstraction has 28150 states and 87484 transitions. [2019-12-18 22:48:57,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:48:57,454 INFO L276 IsEmpty]: Start isEmpty. Operand 28150 states and 87484 transitions. [2019-12-18 22:48:57,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:48:57,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:57,488 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-18 22:48:57,488 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-18 22:48:57,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:57,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1134321916, now seen corresponding path program 1 times [2019-12-18 22:48:57,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:57,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138755207] [2019-12-18 22:48:57,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:57,998 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-18 22:48:57,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138755207] [2019-12-18 22:48:57,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:57,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 22:48:58,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394382044] [2019-12-18 22:48:58,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 22:48:58,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:58,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 22:48:58,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:48:58,001 INFO L87 Difference]: Start difference. First operand 28150 states and 87484 transitions. Second operand 15 states. [2019-12-18 22:49:03,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:49:03,112 INFO L93 Difference]: Finished difference Result 61360 states and 188106 transitions. [2019-12-18 22:49:03,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-18 22:49:03,113 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 22:49:03,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:49:03,194 INFO L225 Difference]: With dead ends: 61360 [2019-12-18 22:49:03,194 INFO L226 Difference]: Without dead ends: 51596 [2019-12-18 22:49:03,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=620, Invalid=3412, Unknown=0, NotChecked=0, Total=4032 [2019-12-18 22:49:03,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51596 states. [2019-12-18 22:49:03,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51596 to 28910. [2019-12-18 22:49:03,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28910 states. [2019-12-18 22:49:03,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28910 states to 28910 states and 89377 transitions. [2019-12-18 22:49:03,793 INFO L78 Accepts]: Start accepts. Automaton has 28910 states and 89377 transitions. Word has length 67 [2019-12-18 22:49:03,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:49:03,794 INFO L462 AbstractCegarLoop]: Abstraction has 28910 states and 89377 transitions. [2019-12-18 22:49:03,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 22:49:03,794 INFO L276 IsEmpty]: Start isEmpty. Operand 28910 states and 89377 transitions. [2019-12-18 22:49:03,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:49:03,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:49:03,828 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-18 22:49:03,828 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-18 22:49:03,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:49:03,828 INFO L82 PathProgramCache]: Analyzing trace with hash 744299942, now seen corresponding path program 2 times [2019-12-18 22:49:03,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:49:03,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735578666] [2019-12-18 22:49:03,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:49:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:49:04,242 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-18 22:49:04,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735578666] [2019-12-18 22:49:04,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:49:04,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 22:49:04,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927472454] [2019-12-18 22:49:04,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 22:49:04,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:49:04,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 22:49:04,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:49:04,244 INFO L87 Difference]: Start difference. First operand 28910 states and 89377 transitions. Second operand 15 states. [2019-12-18 22:49:08,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:49:08,189 INFO L93 Difference]: Finished difference Result 51901 states and 158784 transitions. [2019-12-18 22:49:08,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 22:49:08,189 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 22:49:08,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:49:08,293 INFO L225 Difference]: With dead ends: 51901 [2019-12-18 22:49:08,294 INFO L226 Difference]: Without dead ends: 51242 [2019-12-18 22:49:08,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=497, Invalid=2473, Unknown=0, NotChecked=0, Total=2970 [2019-12-18 22:49:08,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51242 states. [2019-12-18 22:49:08,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51242 to 28670. [2019-12-18 22:49:08,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28670 states. [2019-12-18 22:49:08,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28670 states to 28670 states and 88721 transitions. [2019-12-18 22:49:08,923 INFO L78 Accepts]: Start accepts. Automaton has 28670 states and 88721 transitions. Word has length 67 [2019-12-18 22:49:08,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:49:08,924 INFO L462 AbstractCegarLoop]: Abstraction has 28670 states and 88721 transitions. [2019-12-18 22:49:08,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 22:49:08,924 INFO L276 IsEmpty]: Start isEmpty. Operand 28670 states and 88721 transitions. [2019-12-18 22:49:08,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:49:08,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:49:08,959 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-18 22:49:08,959 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-18 22:49:08,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:49:08,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1184662856, now seen corresponding path program 1 times [2019-12-18 22:49:08,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:49:08,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142896285] [2019-12-18 22:49:08,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:49:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:49:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:49:09,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142896285] [2019-12-18 22:49:09,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:49:09,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:49:09,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103397987] [2019-12-18 22:49:09,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:49:09,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:49:09,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:49:09,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:49:09,018 INFO L87 Difference]: Start difference. First operand 28670 states and 88721 transitions. Second operand 4 states. [2019-12-18 22:49:09,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:49:09,361 INFO L93 Difference]: Finished difference Result 28670 states and 88453 transitions. [2019-12-18 22:49:09,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:49:09,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-18 22:49:09,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:49:09,422 INFO L225 Difference]: With dead ends: 28670 [2019-12-18 22:49:09,422 INFO L226 Difference]: Without dead ends: 28670 [2019-12-18 22:49:09,423 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-18 22:49:09,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28670 states. [2019-12-18 22:49:10,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28670 to 24475. [2019-12-18 22:49:10,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24475 states. [2019-12-18 22:49:10,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24475 states to 24475 states and 75373 transitions. [2019-12-18 22:49:10,072 INFO L78 Accepts]: Start accepts. Automaton has 24475 states and 75373 transitions. Word has length 67 [2019-12-18 22:49:10,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:49:10,073 INFO L462 AbstractCegarLoop]: Abstraction has 24475 states and 75373 transitions. [2019-12-18 22:49:10,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:49:10,073 INFO L276 IsEmpty]: Start isEmpty. Operand 24475 states and 75373 transitions. [2019-12-18 22:49:10,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:49:10,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:49:10,102 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-18 22:49:10,102 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-18 22:49:10,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:49:10,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1579837296, now seen corresponding path program 3 times [2019-12-18 22:49:10,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:49:10,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262971247] [2019-12-18 22:49:10,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:49:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:49:10,512 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-18 22:49:10,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262971247] [2019-12-18 22:49:10,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:49:10,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 22:49:10,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949951944] [2019-12-18 22:49:10,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 22:49:10,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:49:10,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 22:49:10,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:49:10,514 INFO L87 Difference]: Start difference. First operand 24475 states and 75373 transitions. Second operand 15 states. [2019-12-18 22:49:16,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:49:16,418 INFO L93 Difference]: Finished difference Result 59213 states and 181344 transitions. [2019-12-18 22:49:16,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-18 22:49:16,419 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 22:49:16,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:49:16,507 INFO L225 Difference]: With dead ends: 59213 [2019-12-18 22:49:16,507 INFO L226 Difference]: Without dead ends: 56998 [2019-12-18 22:49:16,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=576, Invalid=3456, Unknown=0, NotChecked=0, Total=4032 [2019-12-18 22:49:16,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56998 states. [2019-12-18 22:49:17,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56998 to 30975. [2019-12-18 22:49:17,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30975 states. [2019-12-18 22:49:17,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30975 states to 30975 states and 95946 transitions. [2019-12-18 22:49:17,199 INFO L78 Accepts]: Start accepts. Automaton has 30975 states and 95946 transitions. Word has length 67 [2019-12-18 22:49:17,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:49:17,199 INFO L462 AbstractCegarLoop]: Abstraction has 30975 states and 95946 transitions. [2019-12-18 22:49:17,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 22:49:17,199 INFO L276 IsEmpty]: Start isEmpty. Operand 30975 states and 95946 transitions. [2019-12-18 22:49:17,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:49:17,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:49:17,233 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-18 22:49:17,233 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-18 22:49:17,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:49:17,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1338235554, now seen corresponding path program 4 times [2019-12-18 22:49:17,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:49:17,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896192232] [2019-12-18 22:49:17,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:49:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:49:17,844 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 7 [2019-12-18 22:49:17,902 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-18 22:49:17,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896192232] [2019-12-18 22:49:17,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:49:17,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 22:49:17,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493630260] [2019-12-18 22:49:17,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 22:49:17,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:49:17,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 22:49:17,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:49:17,904 INFO L87 Difference]: Start difference. First operand 30975 states and 95946 transitions. Second operand 15 states. [2019-12-18 22:49:23,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:49:23,581 INFO L93 Difference]: Finished difference Result 57916 states and 176704 transitions. [2019-12-18 22:49:23,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 22:49:23,582 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 22:49:23,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:49:23,644 INFO L225 Difference]: With dead ends: 57916 [2019-12-18 22:49:23,644 INFO L226 Difference]: Without dead ends: 43706 [2019-12-18 22:49:23,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=490, Invalid=2372, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 22:49:23,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43706 states. [2019-12-18 22:49:24,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43706 to 24384. [2019-12-18 22:49:24,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24384 states. [2019-12-18 22:49:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24384 states to 24384 states and 74776 transitions. [2019-12-18 22:49:24,156 INFO L78 Accepts]: Start accepts. Automaton has 24384 states and 74776 transitions. Word has length 67 [2019-12-18 22:49:24,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:49:24,156 INFO L462 AbstractCegarLoop]: Abstraction has 24384 states and 74776 transitions. [2019-12-18 22:49:24,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 22:49:24,156 INFO L276 IsEmpty]: Start isEmpty. Operand 24384 states and 74776 transitions. [2019-12-18 22:49:24,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:49:24,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:49:24,182 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-18 22:49:24,182 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-18 22:49:24,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:49:24,183 INFO L82 PathProgramCache]: Analyzing trace with hash 2122626696, now seen corresponding path program 5 times [2019-12-18 22:49:24,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:49:24,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858963526] [2019-12-18 22:49:24,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:49:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:49:24,576 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-18 22:49:24,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858963526] [2019-12-18 22:49:24,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:49:24,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 22:49:24,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778847777] [2019-12-18 22:49:24,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 22:49:24,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:49:24,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 22:49:24,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:49:24,578 INFO L87 Difference]: Start difference. First operand 24384 states and 74776 transitions. Second operand 16 states. [2019-12-18 22:49:29,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:49:29,254 INFO L93 Difference]: Finished difference Result 46453 states and 141230 transitions. [2019-12-18 22:49:29,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 22:49:29,255 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 22:49:29,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:49:29,322 INFO L225 Difference]: With dead ends: 46453 [2019-12-18 22:49:29,322 INFO L226 Difference]: Without dead ends: 45686 [2019-12-18 22:49:29,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=493, Invalid=2699, Unknown=0, NotChecked=0, Total=3192 [2019-12-18 22:49:29,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45686 states. [2019-12-18 22:49:29,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45686 to 26676. [2019-12-18 22:49:29,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26676 states. [2019-12-18 22:49:29,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26676 states to 26676 states and 81780 transitions. [2019-12-18 22:49:29,874 INFO L78 Accepts]: Start accepts. Automaton has 26676 states and 81780 transitions. Word has length 67 [2019-12-18 22:49:29,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:49:29,874 INFO L462 AbstractCegarLoop]: Abstraction has 26676 states and 81780 transitions. [2019-12-18 22:49:29,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 22:49:29,874 INFO L276 IsEmpty]: Start isEmpty. Operand 26676 states and 81780 transitions. [2019-12-18 22:49:29,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:49:29,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:49:29,905 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-18 22:49:29,905 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-18 22:49:29,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:49:29,905 INFO L82 PathProgramCache]: Analyzing trace with hash 745732250, now seen corresponding path program 6 times [2019-12-18 22:49:29,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:49:29,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169403142] [2019-12-18 22:49:29,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:49:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:49:30,308 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-18 22:49:30,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169403142] [2019-12-18 22:49:30,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:49:30,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 22:49:30,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184645261] [2019-12-18 22:49:30,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 22:49:30,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:49:30,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 22:49:30,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:49:30,310 INFO L87 Difference]: Start difference. First operand 26676 states and 81780 transitions. Second operand 16 states. [2019-12-18 22:49:34,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:49:34,475 INFO L93 Difference]: Finished difference Result 46273 states and 140211 transitions. [2019-12-18 22:49:34,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 22:49:34,476 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 22:49:34,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:49:34,540 INFO L225 Difference]: With dead ends: 46273 [2019-12-18 22:49:34,540 INFO L226 Difference]: Without dead ends: 43586 [2019-12-18 22:49:34,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=511, Invalid=2459, Unknown=0, NotChecked=0, Total=2970 [2019-12-18 22:49:34,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43586 states. [2019-12-18 22:49:35,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43586 to 24366. [2019-12-18 22:49:35,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24366 states. [2019-12-18 22:49:35,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24366 states to 24366 states and 74742 transitions. [2019-12-18 22:49:35,051 INFO L78 Accepts]: Start accepts. Automaton has 24366 states and 74742 transitions. Word has length 67 [2019-12-18 22:49:35,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:49:35,052 INFO L462 AbstractCegarLoop]: Abstraction has 24366 states and 74742 transitions. [2019-12-18 22:49:35,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 22:49:35,052 INFO L276 IsEmpty]: Start isEmpty. Operand 24366 states and 74742 transitions. [2019-12-18 22:49:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:49:35,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:49:35,078 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:49:35,079 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-18 22:49:35,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:49:35,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1590486634, now seen corresponding path program 7 times [2019-12-18 22:49:35,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:49:35,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921814865] [2019-12-18 22:49:35,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:49:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:49:35,171 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-18 22:49:35,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921814865] [2019-12-18 22:49:35,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:49:35,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:49:35,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214403298] [2019-12-18 22:49:35,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:49:35,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:49:35,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:49:35,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:49:35,172 INFO L87 Difference]: Start difference. First operand 24366 states and 74742 transitions. Second operand 9 states. [2019-12-18 22:49:36,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:49:36,584 INFO L93 Difference]: Finished difference Result 39510 states and 120208 transitions. [2019-12-18 22:49:36,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 22:49:36,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 22:49:36,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:49:36,633 INFO L225 Difference]: With dead ends: 39510 [2019-12-18 22:49:36,633 INFO L226 Difference]: Without dead ends: 32664 [2019-12-18 22:49:36,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 22:49:36,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32664 states. [2019-12-18 22:49:37,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32664 to 24260. [2019-12-18 22:49:37,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24260 states. [2019-12-18 22:49:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24260 states to 24260 states and 74311 transitions. [2019-12-18 22:49:37,200 INFO L78 Accepts]: Start accepts. Automaton has 24260 states and 74311 transitions. Word has length 67 [2019-12-18 22:49:37,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:49:37,200 INFO L462 AbstractCegarLoop]: Abstraction has 24260 states and 74311 transitions. [2019-12-18 22:49:37,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:49:37,201 INFO L276 IsEmpty]: Start isEmpty. Operand 24260 states and 74311 transitions. [2019-12-18 22:49:37,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:49:37,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:49:37,227 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:49:37,228 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:49:37,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:49:37,228 INFO L82 PathProgramCache]: Analyzing trace with hash 2065181176, now seen corresponding path program 8 times [2019-12-18 22:49:37,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:49:37,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271154866] [2019-12-18 22:49:37,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:49:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:49:37,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-18 22:49:37,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271154866] [2019-12-18 22:49:37,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:49:37,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:49:37,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458189596] [2019-12-18 22:49:37,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:49:37,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:49:37,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:49:37,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:49:37,392 INFO L87 Difference]: Start difference. First operand 24260 states and 74311 transitions. Second operand 11 states. [2019-12-18 22:49:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:49:38,528 INFO L93 Difference]: Finished difference Result 43796 states and 134440 transitions. [2019-12-18 22:49:38,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 22:49:38,529 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 22:49:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:49:38,589 INFO L225 Difference]: With dead ends: 43796 [2019-12-18 22:49:38,589 INFO L226 Difference]: Without dead ends: 41881 [2019-12-18 22:49:38,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2019-12-18 22:49:38,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41881 states. [2019-12-18 22:49:39,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41881 to 26830. [2019-12-18 22:49:39,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26830 states. [2019-12-18 22:49:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26830 states to 26830 states and 82384 transitions. [2019-12-18 22:49:39,106 INFO L78 Accepts]: Start accepts. Automaton has 26830 states and 82384 transitions. Word has length 67 [2019-12-18 22:49:39,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:49:39,106 INFO L462 AbstractCegarLoop]: Abstraction has 26830 states and 82384 transitions. [2019-12-18 22:49:39,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:49:39,106 INFO L276 IsEmpty]: Start isEmpty. Operand 26830 states and 82384 transitions. [2019-12-18 22:49:39,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:49:39,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:49:39,136 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-18 22:49:39,137 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:49:39,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:49:39,137 INFO L82 PathProgramCache]: Analyzing trace with hash 688286730, now seen corresponding path program 9 times [2019-12-18 22:49:39,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:49:39,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772675963] [2019-12-18 22:49:39,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:49:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:49:39,263 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-18 22:49:39,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772675963] [2019-12-18 22:49:39,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:49:39,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:49:39,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801576402] [2019-12-18 22:49:39,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:49:39,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:49:39,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:49:39,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:49:39,265 INFO L87 Difference]: Start difference. First operand 26830 states and 82384 transitions. Second operand 11 states. [2019-12-18 22:49:40,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:49:40,180 INFO L93 Difference]: Finished difference Result 42468 states and 129980 transitions. [2019-12-18 22:49:40,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 22:49:40,181 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 22:49:40,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:49:40,236 INFO L225 Difference]: With dead ends: 42468 [2019-12-18 22:49:40,237 INFO L226 Difference]: Without dead ends: 36479 [2019-12-18 22:49:40,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-12-18 22:49:40,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36479 states. [2019-12-18 22:49:40,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36479 to 23148. [2019-12-18 22:49:40,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23148 states. [2019-12-18 22:49:40,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23148 states to 23148 states and 71017 transitions. [2019-12-18 22:49:40,665 INFO L78 Accepts]: Start accepts. Automaton has 23148 states and 71017 transitions. Word has length 67 [2019-12-18 22:49:40,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:49:40,665 INFO L462 AbstractCegarLoop]: Abstraction has 23148 states and 71017 transitions. [2019-12-18 22:49:40,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:49:40,665 INFO L276 IsEmpty]: Start isEmpty. Operand 23148 states and 71017 transitions. [2019-12-18 22:49:40,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:49:40,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:49:40,687 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-18 22:49:40,687 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:49:40,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:49:40,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1450844730, now seen corresponding path program 10 times [2019-12-18 22:49:40,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:49:40,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112257384] [2019-12-18 22:49:40,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:49:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:49:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:49:40,794 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:49:40,794 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:49:40,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2293~0.base_23|) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$r_buff0_thd3~0_77 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$w_buff1_used~0_77) (= 0 v_~z$w_buff1~0_28) (= 0 v_~__unbuffered_cnt~0_21) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~z$r_buff0_thd2~0_19 0) (= 0 v_~weak$$choice2~0_32) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$r_buff1_thd2~0_18) (= 0 v_~z$mem_tmp~0_9) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p2_EAX~0_16) (= (store .cse0 |v_ULTIMATE.start_main_~#t2293~0.base_23| 1) |v_#valid_64|) (= 0 |v_#NULL.base_6|) (= v_~z$read_delayed_var~0.base_7 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2293~0.base_23| 4) |v_#length_23|) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_18 0) (= v_~z~0_27 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2293~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2293~0.base_23|) |v_ULTIMATE.start_main_~#t2293~0.offset_17| 0)) |v_#memory_int_21|) (= v_~z$r_buff0_thd1~0_22 0) (= 0 v_~z$flush_delayed~0_12) (= 0 v_~z$w_buff0~0_26) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 |v_ULTIMATE.start_main_~#t2293~0.offset_17|) (= 0 v_~z$r_buff1_thd1~0_16) (= (select .cse0 |v_ULTIMATE.start_main_~#t2293~0.base_23|) 0) (= v_~z$w_buff0_used~0_116 0) (= v_~x~0_16 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_23|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ULTIMATE.start_main_~#t2295~0.base=|v_ULTIMATE.start_main_~#t2295~0.base_18|, ULTIMATE.start_main_~#t2294~0.offset=|v_ULTIMATE.start_main_~#t2294~0.offset_17|, ULTIMATE.start_main_~#t2293~0.base=|v_ULTIMATE.start_main_~#t2293~0.base_23|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_77, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ULTIMATE.start_main_~#t2293~0.offset=|v_ULTIMATE.start_main_~#t2293~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_16, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_77, ULTIMATE.start_main_~#t2294~0.base=|v_ULTIMATE.start_main_~#t2294~0.base_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_16, ULTIMATE.start_main_~#t2295~0.offset=|v_ULTIMATE.start_main_~#t2295~0.offset_13|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_19, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_26, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2295~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2295~0.base, ~y~0, ULTIMATE.start_main_~#t2294~0.offset, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t2293~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2293~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t2294~0.base, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 22:49:40,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2294~0.base_9| 1)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2294~0.base_9|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2294~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2294~0.base_9|) |v_ULTIMATE.start_main_~#t2294~0.offset_8| 1))) (= 0 |v_ULTIMATE.start_main_~#t2294~0.offset_8|) (not (= |v_ULTIMATE.start_main_~#t2294~0.base_9| 0)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2294~0.base_9| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2294~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2294~0.base=|v_ULTIMATE.start_main_~#t2294~0.base_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2294~0.offset=|v_ULTIMATE.start_main_~#t2294~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t2294~0.base, #length, ULTIMATE.start_main_~#t2294~0.offset] because there is no mapped edge [2019-12-18 22:49:40,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] P0ENTRY-->L4-3: Formula: (and (= 0 (mod ~z$w_buff1_used~0_Out-1251561873 256)) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1251561873| 1) (= ~z$w_buff0~0_In-1251561873 ~z$w_buff1~0_Out-1251561873) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1251561873| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1251561873) (= 1 ~z$w_buff0~0_Out-1251561873) (= |P0Thread1of1ForFork0_#in~arg.offset_In-1251561873| P0Thread1of1ForFork0_~arg.offset_Out-1251561873) (= ~z$w_buff0_used~0_Out-1251561873 1) (= |P0Thread1of1ForFork0_#in~arg.base_In-1251561873| P0Thread1of1ForFork0_~arg.base_Out-1251561873) (= ~z$w_buff1_used~0_Out-1251561873 ~z$w_buff0_used~0_In-1251561873)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1251561873|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1251561873, ~z$w_buff0~0=~z$w_buff0~0_In-1251561873, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1251561873|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1251561873|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1251561873, ~z$w_buff0~0=~z$w_buff0~0_Out-1251561873, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1251561873, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1251561873, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1251561873|, ~z$w_buff1~0=~z$w_buff1~0_Out-1251561873, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-1251561873, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1251561873|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-1251561873} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 22:49:40,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L822-1-->L824: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2295~0.base_11|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2295~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2295~0.base_11|) |v_ULTIMATE.start_main_~#t2295~0.offset_9| 2)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t2295~0.offset_9|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t2295~0.base_11|)) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t2295~0.base_11| 1) |v_#valid_40|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2295~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t2295~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2295~0.offset=|v_ULTIMATE.start_main_~#t2295~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2295~0.base=|v_ULTIMATE.start_main_~#t2295~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2295~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t2295~0.base] because there is no mapped edge [2019-12-18 22:49:40,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1289888012 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out-1289888012| |P1Thread1of1ForFork1_#t~ite10_Out-1289888012|)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1289888012 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out-1289888012| ~z~0_In-1289888012)) (and (not .cse0) .cse2 (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-1289888012| ~z$w_buff1~0_In-1289888012)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1289888012, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1289888012, ~z$w_buff1~0=~z$w_buff1~0_In-1289888012, ~z~0=~z~0_In-1289888012} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1289888012|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1289888012, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1289888012, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1289888012|, ~z$w_buff1~0=~z$w_buff1~0_In-1289888012, ~z~0=~z~0_In-1289888012} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 22:49:40,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-666893180 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-666893180 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-666893180| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-666893180| ~z$w_buff0_used~0_In-666893180) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-666893180, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-666893180} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-666893180, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-666893180|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-666893180} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 22:49:40,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In659500239 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In659500239 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In659500239 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In659500239 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out659500239|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In659500239 |P1Thread1of1ForFork1_#t~ite12_Out659500239|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In659500239, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In659500239, ~z$w_buff1_used~0=~z$w_buff1_used~0_In659500239, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In659500239} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In659500239, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In659500239, ~z$w_buff1_used~0=~z$w_buff1_used~0_In659500239, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out659500239|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In659500239} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 22:49:40,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1282549039 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1282549039 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out-1282549039| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-1282549039| ~z$r_buff0_thd2~0_In-1282549039) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1282549039, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1282549039} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1282549039, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1282549039|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1282549039} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 22:49:40,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L787-->L787-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2077767534 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite23_In2077767534| |P2Thread1of1ForFork2_#t~ite23_Out2077767534|) (= ~z$w_buff1~0_In2077767534 |P2Thread1of1ForFork2_#t~ite24_Out2077767534|) (not .cse0)) (and .cse0 (= ~z$w_buff1~0_In2077767534 |P2Thread1of1ForFork2_#t~ite23_Out2077767534|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In2077767534 256) 0))) (or (and (= (mod ~z$r_buff1_thd3~0_In2077767534 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In2077767534 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In2077767534 256) 0)))) (= |P2Thread1of1ForFork2_#t~ite23_Out2077767534| |P2Thread1of1ForFork2_#t~ite24_Out2077767534|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In2077767534|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2077767534, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2077767534, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2077767534, ~z$w_buff1~0=~z$w_buff1~0_In2077767534, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2077767534, ~weak$$choice2~0=~weak$$choice2~0_In2077767534} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out2077767534|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out2077767534|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2077767534, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2077767534, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2077767534, ~z$w_buff1~0=~z$w_buff1~0_In2077767534, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2077767534, ~weak$$choice2~0=~weak$$choice2~0_In2077767534} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 22:49:40,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L788-->L788-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In430266421 256) 0))) (or (and (= ~z$w_buff0_used~0_In430266421 |P2Thread1of1ForFork2_#t~ite26_Out430266421|) (= |P2Thread1of1ForFork2_#t~ite27_Out430266421| |P2Thread1of1ForFork2_#t~ite26_Out430266421|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In430266421 256)))) (or (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In430266421 256))) (= 0 (mod ~z$w_buff0_used~0_In430266421 256)) (and (= 0 (mod ~z$w_buff1_used~0_In430266421 256)) .cse0))) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite27_Out430266421| ~z$w_buff0_used~0_In430266421) (= |P2Thread1of1ForFork2_#t~ite26_In430266421| |P2Thread1of1ForFork2_#t~ite26_Out430266421|)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In430266421|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In430266421, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In430266421, ~z$w_buff1_used~0=~z$w_buff1_used~0_In430266421, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In430266421, ~weak$$choice2~0=~weak$$choice2~0_In430266421} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out430266421|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In430266421, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In430266421, ~z$w_buff1_used~0=~z$w_buff1_used~0_In430266421, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In430266421, ~weak$$choice2~0=~weak$$choice2~0_In430266421, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out430266421|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-18 22:49:40,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-125012887 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-125012887 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-125012887 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-125012887 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-125012887| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out-125012887| ~z$r_buff1_thd2~0_In-125012887)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-125012887, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-125012887, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-125012887, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-125012887} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-125012887, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-125012887, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-125012887, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-125012887|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-125012887} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 22:49:40,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 22:49:40,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L789-->L789-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In102759287 256)))) (or (and (= ~z$w_buff1_used~0_In102759287 |P2Thread1of1ForFork2_#t~ite29_Out102759287|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In102759287 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In102759287 256)) .cse0) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In102759287 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In102759287 256)))) (= |P2Thread1of1ForFork2_#t~ite30_Out102759287| |P2Thread1of1ForFork2_#t~ite29_Out102759287|) .cse1) (and (= |P2Thread1of1ForFork2_#t~ite29_In102759287| |P2Thread1of1ForFork2_#t~ite29_Out102759287|) (not .cse1) (= ~z$w_buff1_used~0_In102759287 |P2Thread1of1ForFork2_#t~ite30_Out102759287|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In102759287, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In102759287, ~z$w_buff1_used~0=~z$w_buff1_used~0_In102759287, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In102759287, ~weak$$choice2~0=~weak$$choice2~0_In102759287, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In102759287|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out102759287|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In102759287, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In102759287, ~z$w_buff1_used~0=~z$w_buff1_used~0_In102759287, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In102759287, ~weak$$choice2~0=~weak$$choice2~0_In102759287, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out102759287|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 22:49:40,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff0_thd3~0_51)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 22:49:40,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= v_~z~0_18 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 22:49:40,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1167513280 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1167513280 256) 0))) (or (and (= ~z$w_buff0_used~0_In1167513280 |P0Thread1of1ForFork0_#t~ite5_Out1167513280|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1167513280|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1167513280, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1167513280} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1167513280|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1167513280, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1167513280} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 22:49:40,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1830534707 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In1830534707 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1830534707 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1830534707 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1830534707|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1830534707 |P0Thread1of1ForFork0_#t~ite6_Out1830534707|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1830534707, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1830534707, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1830534707, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1830534707} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1830534707|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1830534707, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1830534707, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1830534707, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1830534707} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 22:49:40,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1109550061 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1109550061 256)))) (or (and (= ~z$r_buff0_thd1~0_In-1109550061 ~z$r_buff0_thd1~0_Out-1109550061) (or .cse0 .cse1)) (and (not .cse0) (= ~z$r_buff0_thd1~0_Out-1109550061 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1109550061, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1109550061} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1109550061, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1109550061|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1109550061} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 22:49:40,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1837910828 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-1837910828 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1837910828 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-1837910828 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1837910828| ~z$r_buff1_thd1~0_In-1837910828) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1837910828| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1837910828, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1837910828, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1837910828, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1837910828} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1837910828, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1837910828|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1837910828, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1837910828, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1837910828} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 22:49:40,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 22:49:40,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork2_#t~ite39_Out-1573044469| |P2Thread1of1ForFork2_#t~ite38_Out-1573044469|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1573044469 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1573044469 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite38_Out-1573044469| ~z$w_buff1~0_In-1573044469) .cse0 (not .cse1) (not .cse2)) (and (= |P2Thread1of1ForFork2_#t~ite38_Out-1573044469| ~z~0_In-1573044469) .cse0 (or .cse2 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1573044469, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1573044469, ~z$w_buff1~0=~z$w_buff1~0_In-1573044469, ~z~0=~z~0_In-1573044469} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1573044469, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1573044469, ~z$w_buff1~0=~z$w_buff1~0_In-1573044469, ~z~0=~z~0_In-1573044469, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-1573044469|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-1573044469|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 22:49:40,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In541777512 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In541777512 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out541777512| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out541777512| ~z$w_buff0_used~0_In541777512)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In541777512, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In541777512} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In541777512, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In541777512, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out541777512|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-18 22:49:40,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1498552399 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1498552399 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1498552399 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-1498552399 256) 0))) (or (and (= ~z$w_buff1_used~0_In-1498552399 |P2Thread1of1ForFork2_#t~ite41_Out-1498552399|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-1498552399|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1498552399, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1498552399, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1498552399, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1498552399} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-1498552399|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1498552399, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1498552399, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1498552399, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1498552399} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-18 22:49:40,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In759192400 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In759192400 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out759192400| ~z$r_buff0_thd3~0_In759192400)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out759192400| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In759192400, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In759192400} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out759192400|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In759192400, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In759192400} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-18 22:49:40,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In460284209 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In460284209 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In460284209 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In460284209 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite43_Out460284209| ~z$r_buff1_thd3~0_In460284209) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite43_Out460284209| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In460284209, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In460284209, ~z$w_buff1_used~0=~z$w_buff1_used~0_In460284209, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In460284209} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In460284209, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In460284209, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out460284209|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In460284209, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In460284209} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 22:49:40,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_8| v_~z$r_buff1_thd3~0_42) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_42, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 22:49:40,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~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-18 22:49:40,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out1545441746| |ULTIMATE.start_main_#t~ite48_Out1545441746|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1545441746 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1545441746 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite47_Out1545441746| ~z$w_buff1~0_In1545441746) (not .cse1) (not .cse2)) (and .cse0 (= |ULTIMATE.start_main_#t~ite47_Out1545441746| ~z~0_In1545441746) (or .cse2 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1545441746, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1545441746, ~z$w_buff1~0=~z$w_buff1~0_In1545441746, ~z~0=~z~0_In1545441746} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1545441746, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1545441746|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1545441746, ~z$w_buff1~0=~z$w_buff1~0_In1545441746, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1545441746|, ~z~0=~z~0_In1545441746} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 22:49:40,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1899493931 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1899493931 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1899493931| 0)) (and (= ~z$w_buff0_used~0_In-1899493931 |ULTIMATE.start_main_#t~ite49_Out-1899493931|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1899493931, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1899493931} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1899493931, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1899493931, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1899493931|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 22:49:40,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1447513033 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1447513033 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1447513033 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In1447513033 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out1447513033| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In1447513033 |ULTIMATE.start_main_#t~ite50_Out1447513033|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1447513033, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1447513033, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1447513033, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1447513033} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1447513033|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1447513033, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1447513033, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1447513033, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1447513033} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 22:49:40,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2007003128 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-2007003128 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In-2007003128 |ULTIMATE.start_main_#t~ite51_Out-2007003128|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out-2007003128|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2007003128, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2007003128} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2007003128, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-2007003128|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2007003128} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 22:49:40,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1101829660 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1101829660 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1101829660 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1101829660 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In1101829660 |ULTIMATE.start_main_#t~ite52_Out1101829660|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1101829660|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1101829660, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1101829660, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1101829660, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1101829660} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1101829660|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1101829660, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1101829660, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1101829660, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1101829660} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 22:49:40,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= 2 v_~x~0_8) (= |v_ULTIMATE.start_main_#t~ite52_10| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:49:40,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:49:40 BasicIcfg [2019-12-18 22:49:40,937 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:49:40,940 INFO L168 Benchmark]: Toolchain (without parser) took 137811.50 ms. Allocated memory was 146.8 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.6 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 22:49:40,940 INFO L168 Benchmark]: CDTParser took 1.39 ms. Allocated memory is still 146.8 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 22:49:40,941 INFO L168 Benchmark]: CACSL2BoogieTranslator took 757.45 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 101.2 MB in the beginning and 157.6 MB in the end (delta: -56.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-18 22:49:40,941 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.53 ms. Allocated memory is still 203.9 MB. Free memory was 157.6 MB in the beginning and 155.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 22:49:40,942 INFO L168 Benchmark]: Boogie Preprocessor took 39.89 ms. Allocated memory is still 203.9 MB. Free memory was 155.0 MB in the beginning and 152.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 22:49:40,942 INFO L168 Benchmark]: RCFGBuilder took 867.18 ms. Allocated memory is still 203.9 MB. Free memory was 152.5 MB in the beginning and 102.7 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:49:40,943 INFO L168 Benchmark]: TraceAbstraction took 136078.01 ms. Allocated memory was 203.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 102.1 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 22:49:40,946 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.39 ms. Allocated memory is still 146.8 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 757.45 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 101.2 MB in the beginning and 157.6 MB in the end (delta: -56.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.53 ms. Allocated memory is still 203.9 MB. Free memory was 157.6 MB in the beginning and 155.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.89 ms. Allocated memory is still 203.9 MB. Free memory was 155.0 MB in the beginning and 152.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 867.18 ms. Allocated memory is still 203.9 MB. Free memory was 152.5 MB in the beginning and 102.7 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 136078.01 ms. Allocated memory was 203.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 102.1 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 6847 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80960 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2293, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t2294, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t2295, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 __unbuffered_p2_EAX = y [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 135.7s, OverallIterations: 39, TraceHistogramMax: 1, AutomataDifference: 63.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10593 SDtfs, 16122 SDslu, 45602 SDs, 0 SdLazy, 35717 SolverSat, 769 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 731 GetRequests, 58 SyntacticMatches, 46 SemanticMatches, 627 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6571 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145638occurred 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: 43.8s AutomataMinimizationTime, 38 MinimizatonAttempts, 461509 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 2019 NumberOfCodeBlocks, 2019 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1914 ConstructedInterpolants, 0 QuantifiedInterpolants, 512460 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...