/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:11:42,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:11:42,704 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:11:42,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:11:42,745 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:11:42,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:11:42,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:11:42,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:11:42,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:11:42,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:11:42,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:11:42,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:11:42,767 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:11:42,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:11:42,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:11:42,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:11:42,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:11:42,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:11:42,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:11:42,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:11:42,791 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:11:42,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:11:42,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:11:42,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:11:42,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:11:42,805 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:11:42,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:11:42,806 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:11:42,807 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:11:42,810 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:11:42,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:11:42,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:11:42,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:11:42,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:11:42,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:11:42,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:11:42,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:11:42,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:11:42,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:11:42,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:11:42,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:11:42,820 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-16 12:11:42,865 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:11:42,865 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:11:42,867 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:11:42,868 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:11:42,868 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:11:42,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:11:42,869 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:11:42,869 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:11:42,869 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:11:42,869 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:11:42,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:11:42,871 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:11:42,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:11:42,871 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:11:42,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:11:42,872 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:11:42,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:11:42,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:11:42,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:11:42,872 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:11:42,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:11:42,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:11:42,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:11:42,873 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:11:42,873 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:11:42,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:11:42,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:11:42,874 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:11:42,874 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:11:43,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:11:43,167 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:11:43,171 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:11:43,175 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:11:43,176 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:11:43,176 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_rmo.oepc.i [2020-10-16 12:11:43,255 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/4f02767a3/df12411ba6324b9ab130cb76baa25acf/FLAGa4a17fcbd [2020-10-16 12:11:43,856 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:11:43,857 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe032_rmo.oepc.i [2020-10-16 12:11:43,875 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/4f02767a3/df12411ba6324b9ab130cb76baa25acf/FLAGa4a17fcbd [2020-10-16 12:11:44,140 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/4f02767a3/df12411ba6324b9ab130cb76baa25acf [2020-10-16 12:11:44,149 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:11:44,151 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:11:44,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:11:44,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:11:44,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:11:44,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:11:44" (1/1) ... [2020-10-16 12:11:44,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@663590a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:44, skipping insertion in model container [2020-10-16 12:11:44,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:11:44" (1/1) ... [2020-10-16 12:11:44,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:11:44,243 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:11:44,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:11:44,858 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:11:44,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:11:45,002 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:11:45,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:45 WrapperNode [2020-10-16 12:11:45,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:11:45,004 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:11:45,004 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:11:45,005 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:11:45,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:45" (1/1) ... [2020-10-16 12:11:45,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:45" (1/1) ... [2020-10-16 12:11:45,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:11:45,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:11:45,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:11:45,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:11:45,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:45" (1/1) ... [2020-10-16 12:11:45,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:45" (1/1) ... [2020-10-16 12:11:45,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:45" (1/1) ... [2020-10-16 12:11:45,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:45" (1/1) ... [2020-10-16 12:11:45,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:45" (1/1) ... [2020-10-16 12:11:45,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:45" (1/1) ... [2020-10-16 12:11:45,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:45" (1/1) ... [2020-10-16 12:11:45,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:11:45,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:11:45,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:11:45,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:11:45,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:45" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:11:45,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:11:45,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:11:45,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:11:45,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:11:45,218 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:11:45,218 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:11:45,218 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:11:45,218 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:11:45,218 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:11:45,219 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:11:45,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:11:45,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:11:45,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:11:45,222 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:11:48,768 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:11:48,768 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:11:48,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:11:48 BoogieIcfgContainer [2020-10-16 12:11:48,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:11:48,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:11:48,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:11:48,776 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:11:48,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:11:44" (1/3) ... [2020-10-16 12:11:48,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@83756dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:11:48, skipping insertion in model container [2020-10-16 12:11:48,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:45" (2/3) ... [2020-10-16 12:11:48,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@83756dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:11:48, skipping insertion in model container [2020-10-16 12:11:48,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:11:48" (3/3) ... [2020-10-16 12:11:48,780 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_rmo.oepc.i [2020-10-16 12:11:48,829 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:11:48,830 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:11:48,838 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:11:48,839 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:11:48,874 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,875 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,875 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,875 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,875 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,878 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,878 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,878 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,878 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,878 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,878 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,884 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,884 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,884 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,884 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,884 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,884 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,885 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,885 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,885 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,885 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,885 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,895 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,895 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,896 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,896 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,903 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,905 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,905 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,905 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,905 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,905 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,905 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,911 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,911 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,911 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,913 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,913 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,913 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,913 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,913 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,913 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,914 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,914 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,914 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,914 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,914 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,914 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,915 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,915 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,915 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,915 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,915 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,917 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,918 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,918 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,921 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,922 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,922 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,922 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,922 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,923 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,923 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,923 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,923 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,923 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,924 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,924 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:48,926 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:11:48,940 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 12:11:48,965 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:11:48,966 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:11:48,966 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:11:48,966 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:11:48,966 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:11:48,966 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:11:48,967 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:11:48,967 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:11:48,982 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:11:48,983 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-16 12:11:48,987 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-16 12:11:48,989 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-16 12:11:49,040 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-16 12:11:49,040 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:11:49,046 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 12:11:49,049 INFO L117 LiptonReduction]: Number of co-enabled transitions 1624 [2020-10-16 12:11:49,389 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-16 12:11:50,140 WARN L193 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 12:11:50,256 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 12:11:51,490 WARN L193 SmtUtils]: Spent 999.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2020-10-16 12:11:51,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-16 12:11:51,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:11:51,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 12:11:51,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:11:52,660 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 146 DAG size of output: 126 [2020-10-16 12:11:53,717 WARN L193 SmtUtils]: Spent 884.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2020-10-16 12:11:54,010 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-16 12:11:55,462 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 141 DAG size of output: 132 [2020-10-16 12:11:55,886 WARN L193 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-16 12:11:56,154 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-16 12:11:56,276 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 12:11:56,287 INFO L132 LiptonReduction]: Checked pairs total: 4248 [2020-10-16 12:11:56,288 INFO L134 LiptonReduction]: Total number of compositions: 76 [2020-10-16 12:11:56,295 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-16 12:11:56,359 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 778 states. [2020-10-16 12:11:56,361 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states. [2020-10-16 12:11:56,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-16 12:11:56,368 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:56,369 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:56,370 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:56,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:56,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1033422208, now seen corresponding path program 1 times [2020-10-16 12:11:56,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:56,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252024870] [2020-10-16 12:11:56,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:56,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252024870] [2020-10-16 12:11:56,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:56,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:11:56,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445046215] [2020-10-16 12:11:56,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:11:56,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:56,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:11:56,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:56,699 INFO L87 Difference]: Start difference. First operand 778 states. Second operand 3 states. [2020-10-16 12:11:56,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:56,838 INFO L93 Difference]: Finished difference Result 658 states and 2050 transitions. [2020-10-16 12:11:56,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:11:56,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-16 12:11:56,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:56,866 INFO L225 Difference]: With dead ends: 658 [2020-10-16 12:11:56,867 INFO L226 Difference]: Without dead ends: 538 [2020-10-16 12:11:56,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:56,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-10-16 12:11:56,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2020-10-16 12:11:57,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2020-10-16 12:11:57,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1644 transitions. [2020-10-16 12:11:57,007 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1644 transitions. Word has length 7 [2020-10-16 12:11:57,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:57,008 INFO L481 AbstractCegarLoop]: Abstraction has 538 states and 1644 transitions. [2020-10-16 12:11:57,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:11:57,009 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1644 transitions. [2020-10-16 12:11:57,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:11:57,010 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:57,011 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:57,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:11:57,011 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:57,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:57,012 INFO L82 PathProgramCache]: Analyzing trace with hash 981365630, now seen corresponding path program 1 times [2020-10-16 12:11:57,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:57,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318949845] [2020-10-16 12:11:57,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:57,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:57,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318949845] [2020-10-16 12:11:57,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:57,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:11:57,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724739412] [2020-10-16 12:11:57,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:11:57,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:57,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:11:57,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:57,113 INFO L87 Difference]: Start difference. First operand 538 states and 1644 transitions. Second operand 3 states. [2020-10-16 12:11:57,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:57,213 INFO L93 Difference]: Finished difference Result 532 states and 1621 transitions. [2020-10-16 12:11:57,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:11:57,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 12:11:57,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:57,223 INFO L225 Difference]: With dead ends: 532 [2020-10-16 12:11:57,223 INFO L226 Difference]: Without dead ends: 532 [2020-10-16 12:11:57,224 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:57,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-10-16 12:11:57,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2020-10-16 12:11:57,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2020-10-16 12:11:57,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1621 transitions. [2020-10-16 12:11:57,257 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 1621 transitions. Word has length 9 [2020-10-16 12:11:57,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:57,257 INFO L481 AbstractCegarLoop]: Abstraction has 532 states and 1621 transitions. [2020-10-16 12:11:57,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:11:57,257 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 1621 transitions. [2020-10-16 12:11:57,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 12:11:57,261 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:57,261 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:57,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:11:57,262 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:57,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:57,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1127615764, now seen corresponding path program 1 times [2020-10-16 12:11:57,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:57,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501392412] [2020-10-16 12:11:57,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:57,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:57,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501392412] [2020-10-16 12:11:57,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:57,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:11:57,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437588456] [2020-10-16 12:11:57,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:11:57,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:57,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:11:57,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:57,423 INFO L87 Difference]: Start difference. First operand 532 states and 1621 transitions. Second operand 3 states. [2020-10-16 12:11:57,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:57,483 INFO L93 Difference]: Finished difference Result 523 states and 1588 transitions. [2020-10-16 12:11:57,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:11:57,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-16 12:11:57,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:57,489 INFO L225 Difference]: With dead ends: 523 [2020-10-16 12:11:57,489 INFO L226 Difference]: Without dead ends: 523 [2020-10-16 12:11:57,490 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:57,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2020-10-16 12:11:57,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2020-10-16 12:11:57,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2020-10-16 12:11:57,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 1588 transitions. [2020-10-16 12:11:57,510 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 1588 transitions. Word has length 10 [2020-10-16 12:11:57,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:57,511 INFO L481 AbstractCegarLoop]: Abstraction has 523 states and 1588 transitions. [2020-10-16 12:11:57,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:11:57,511 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 1588 transitions. [2020-10-16 12:11:57,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 12:11:57,513 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:57,513 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:57,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:11:57,513 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:57,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:57,514 INFO L82 PathProgramCache]: Analyzing trace with hash 357008298, now seen corresponding path program 1 times [2020-10-16 12:11:57,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:57,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064562973] [2020-10-16 12:11:57,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:57,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:57,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064562973] [2020-10-16 12:11:57,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:57,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:11:57,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183815879] [2020-10-16 12:11:57,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:11:57,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:57,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:11:57,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:57,569 INFO L87 Difference]: Start difference. First operand 523 states and 1588 transitions. Second operand 3 states. [2020-10-16 12:11:57,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:57,582 INFO L93 Difference]: Finished difference Result 517 states and 1565 transitions. [2020-10-16 12:11:57,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:11:57,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-16 12:11:57,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:57,587 INFO L225 Difference]: With dead ends: 517 [2020-10-16 12:11:57,588 INFO L226 Difference]: Without dead ends: 517 [2020-10-16 12:11:57,588 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:57,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-10-16 12:11:57,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2020-10-16 12:11:57,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2020-10-16 12:11:57,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1565 transitions. [2020-10-16 12:11:57,607 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1565 transitions. Word has length 10 [2020-10-16 12:11:57,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:57,608 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 1565 transitions. [2020-10-16 12:11:57,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:11:57,608 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1565 transitions. [2020-10-16 12:11:57,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:11:57,609 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:57,610 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:57,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:11:57,610 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:57,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:57,610 INFO L82 PathProgramCache]: Analyzing trace with hash -596905476, now seen corresponding path program 1 times [2020-10-16 12:11:57,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:57,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835668279] [2020-10-16 12:11:57,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:57,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835668279] [2020-10-16 12:11:57,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:57,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:11:57,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168164994] [2020-10-16 12:11:57,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:11:57,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:57,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:11:57,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:57,662 INFO L87 Difference]: Start difference. First operand 517 states and 1565 transitions. Second operand 3 states. [2020-10-16 12:11:57,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:57,678 INFO L93 Difference]: Finished difference Result 472 states and 1409 transitions. [2020-10-16 12:11:57,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:11:57,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 12:11:57,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:57,683 INFO L225 Difference]: With dead ends: 472 [2020-10-16 12:11:57,684 INFO L226 Difference]: Without dead ends: 472 [2020-10-16 12:11:57,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:57,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2020-10-16 12:11:57,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2020-10-16 12:11:57,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2020-10-16 12:11:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1409 transitions. [2020-10-16 12:11:57,701 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1409 transitions. Word has length 11 [2020-10-16 12:11:57,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:57,702 INFO L481 AbstractCegarLoop]: Abstraction has 472 states and 1409 transitions. [2020-10-16 12:11:57,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:11:57,702 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1409 transitions. [2020-10-16 12:11:57,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:11:57,703 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:57,704 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:57,704 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:11:57,704 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:57,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:57,704 INFO L82 PathProgramCache]: Analyzing trace with hash 733241045, now seen corresponding path program 1 times [2020-10-16 12:11:57,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:57,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449958714] [2020-10-16 12:11:57,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:58,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449958714] [2020-10-16 12:11:58,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:58,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:11:58,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370683347] [2020-10-16 12:11:58,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:11:58,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:58,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:11:58,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:11:58,083 INFO L87 Difference]: Start difference. First operand 472 states and 1409 transitions. Second operand 6 states. [2020-10-16 12:11:58,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:58,514 INFO L93 Difference]: Finished difference Result 505 states and 1488 transitions. [2020-10-16 12:11:58,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:11:58,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-16 12:11:58,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:58,519 INFO L225 Difference]: With dead ends: 505 [2020-10-16 12:11:58,519 INFO L226 Difference]: Without dead ends: 505 [2020-10-16 12:11:58,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:11:58,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2020-10-16 12:11:58,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 481. [2020-10-16 12:11:58,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2020-10-16 12:11:58,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1418 transitions. [2020-10-16 12:11:58,538 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 1418 transitions. Word has length 13 [2020-10-16 12:11:58,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:58,538 INFO L481 AbstractCegarLoop]: Abstraction has 481 states and 1418 transitions. [2020-10-16 12:11:58,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:11:58,539 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 1418 transitions. [2020-10-16 12:11:58,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:11:58,541 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:58,541 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:58,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:11:58,541 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:58,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:58,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1255080755, now seen corresponding path program 1 times [2020-10-16 12:11:58,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:58,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452603956] [2020-10-16 12:11:58,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:58,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:58,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452603956] [2020-10-16 12:11:58,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:58,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:11:58,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016712913] [2020-10-16 12:11:58,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:11:58,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:58,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:11:58,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:11:58,772 INFO L87 Difference]: Start difference. First operand 481 states and 1418 transitions. Second operand 6 states. [2020-10-16 12:11:58,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:58,966 INFO L93 Difference]: Finished difference Result 534 states and 1593 transitions. [2020-10-16 12:11:58,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:11:58,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-16 12:11:58,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:58,971 INFO L225 Difference]: With dead ends: 534 [2020-10-16 12:11:58,971 INFO L226 Difference]: Without dead ends: 534 [2020-10-16 12:11:58,972 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:11:58,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-10-16 12:11:58,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 518. [2020-10-16 12:11:58,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2020-10-16 12:11:58,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 1537 transitions. [2020-10-16 12:11:58,990 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 1537 transitions. Word has length 14 [2020-10-16 12:11:58,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:58,991 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 1537 transitions. [2020-10-16 12:11:58,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:11:58,991 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 1537 transitions. [2020-10-16 12:11:58,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:11:58,992 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:58,993 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:58,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:11:58,993 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:58,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:58,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1255635965, now seen corresponding path program 2 times [2020-10-16 12:11:58,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:58,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678745314] [2020-10-16 12:11:58,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:59,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:59,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678745314] [2020-10-16 12:11:59,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:59,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:11:59,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126556264] [2020-10-16 12:11:59,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:11:59,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:59,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:11:59,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:11:59,153 INFO L87 Difference]: Start difference. First operand 518 states and 1537 transitions. Second operand 7 states. [2020-10-16 12:11:59,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:59,624 INFO L93 Difference]: Finished difference Result 556 states and 1647 transitions. [2020-10-16 12:11:59,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 12:11:59,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-16 12:11:59,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:59,629 INFO L225 Difference]: With dead ends: 556 [2020-10-16 12:11:59,629 INFO L226 Difference]: Without dead ends: 556 [2020-10-16 12:11:59,631 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-10-16 12:11:59,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-10-16 12:11:59,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 516. [2020-10-16 12:11:59,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2020-10-16 12:11:59,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 1531 transitions. [2020-10-16 12:11:59,649 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 1531 transitions. Word has length 14 [2020-10-16 12:11:59,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:59,649 INFO L481 AbstractCegarLoop]: Abstraction has 516 states and 1531 transitions. [2020-10-16 12:11:59,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:11:59,649 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 1531 transitions. [2020-10-16 12:11:59,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:11:59,651 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:59,651 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:59,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:11:59,651 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:59,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:59,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1659355165, now seen corresponding path program 3 times [2020-10-16 12:11:59,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:59,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438125184] [2020-10-16 12:11:59,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:59,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:59,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438125184] [2020-10-16 12:11:59,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:59,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:11:59,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956015381] [2020-10-16 12:11:59,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:11:59,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:59,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:11:59,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:11:59,861 INFO L87 Difference]: Start difference. First operand 516 states and 1531 transitions. Second operand 6 states. [2020-10-16 12:12:00,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:00,141 INFO L93 Difference]: Finished difference Result 678 states and 2042 transitions. [2020-10-16 12:12:00,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 12:12:00,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-16 12:12:00,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:00,147 INFO L225 Difference]: With dead ends: 678 [2020-10-16 12:12:00,147 INFO L226 Difference]: Without dead ends: 678 [2020-10-16 12:12:00,148 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:12:00,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2020-10-16 12:12:00,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 540. [2020-10-16 12:12:00,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2020-10-16 12:12:00,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 1613 transitions. [2020-10-16 12:12:00,167 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 1613 transitions. Word has length 14 [2020-10-16 12:12:00,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:00,167 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 1613 transitions. [2020-10-16 12:12:00,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:12:00,168 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 1613 transitions. [2020-10-16 12:12:00,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:12:00,169 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:00,169 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:00,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:12:00,170 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:00,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:00,170 INFO L82 PathProgramCache]: Analyzing trace with hash -70668655, now seen corresponding path program 4 times [2020-10-16 12:12:00,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:00,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728292144] [2020-10-16 12:12:00,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:00,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:00,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728292144] [2020-10-16 12:12:00,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:00,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:12:00,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730144951] [2020-10-16 12:12:00,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:12:00,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:00,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:12:00,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:12:00,358 INFO L87 Difference]: Start difference. First operand 540 states and 1613 transitions. Second operand 7 states. [2020-10-16 12:12:00,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:00,609 INFO L93 Difference]: Finished difference Result 706 states and 2136 transitions. [2020-10-16 12:12:00,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:12:00,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-16 12:12:00,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:00,618 INFO L225 Difference]: With dead ends: 706 [2020-10-16 12:12:00,618 INFO L226 Difference]: Without dead ends: 706 [2020-10-16 12:12:00,619 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:12:00,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2020-10-16 12:12:00,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 670. [2020-10-16 12:12:00,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2020-10-16 12:12:00,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 2028 transitions. [2020-10-16 12:12:00,650 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 2028 transitions. Word has length 14 [2020-10-16 12:12:00,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:00,650 INFO L481 AbstractCegarLoop]: Abstraction has 670 states and 2028 transitions. [2020-10-16 12:12:00,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:12:00,651 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 2028 transitions. [2020-10-16 12:12:00,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:12:00,653 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:00,654 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:00,654 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:12:00,654 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:00,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:00,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1373926981, now seen corresponding path program 5 times [2020-10-16 12:12:00,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:00,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404858516] [2020-10-16 12:12:00,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:00,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404858516] [2020-10-16 12:12:00,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:00,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:12:00,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122271063] [2020-10-16 12:12:00,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:12:00,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:00,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:12:00,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:12:00,927 INFO L87 Difference]: Start difference. First operand 670 states and 2028 transitions. Second operand 7 states. [2020-10-16 12:12:01,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:01,137 INFO L93 Difference]: Finished difference Result 1048 states and 3047 transitions. [2020-10-16 12:12:01,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:12:01,140 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-16 12:12:01,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:01,146 INFO L225 Difference]: With dead ends: 1048 [2020-10-16 12:12:01,146 INFO L226 Difference]: Without dead ends: 916 [2020-10-16 12:12:01,147 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:12:01,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2020-10-16 12:12:01,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 520. [2020-10-16 12:12:01,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2020-10-16 12:12:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1495 transitions. [2020-10-16 12:12:01,167 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1495 transitions. Word has length 14 [2020-10-16 12:12:01,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:01,167 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 1495 transitions. [2020-10-16 12:12:01,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:12:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1495 transitions. [2020-10-16 12:12:01,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:12:01,169 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:01,169 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:01,169 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:12:01,169 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:01,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:01,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1248077345, now seen corresponding path program 1 times [2020-10-16 12:12:01,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:01,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203074067] [2020-10-16 12:12:01,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:01,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:01,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203074067] [2020-10-16 12:12:01,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:01,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:12:01,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910061260] [2020-10-16 12:12:01,344 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:12:01,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:01,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:12:01,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:12:01,345 INFO L87 Difference]: Start difference. First operand 520 states and 1495 transitions. Second operand 7 states. [2020-10-16 12:12:01,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:01,793 INFO L93 Difference]: Finished difference Result 586 states and 1701 transitions. [2020-10-16 12:12:01,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 12:12:01,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-16 12:12:01,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:01,799 INFO L225 Difference]: With dead ends: 586 [2020-10-16 12:12:01,799 INFO L226 Difference]: Without dead ends: 586 [2020-10-16 12:12:01,800 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2020-10-16 12:12:01,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-10-16 12:12:01,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 548. [2020-10-16 12:12:01,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2020-10-16 12:12:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1588 transitions. [2020-10-16 12:12:01,816 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1588 transitions. Word has length 15 [2020-10-16 12:12:01,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:01,817 INFO L481 AbstractCegarLoop]: Abstraction has 548 states and 1588 transitions. [2020-10-16 12:12:01,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:12:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1588 transitions. [2020-10-16 12:12:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:12:01,819 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:01,819 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:01,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:12:01,819 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:01,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:01,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1248632555, now seen corresponding path program 2 times [2020-10-16 12:12:01,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:01,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066184056] [2020-10-16 12:12:01,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:01,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:01,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066184056] [2020-10-16 12:12:01,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:01,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:12:01,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279515515] [2020-10-16 12:12:01,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:12:01,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:01,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:12:01,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:12:01,979 INFO L87 Difference]: Start difference. First operand 548 states and 1588 transitions. Second operand 7 states. [2020-10-16 12:12:02,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:02,397 INFO L93 Difference]: Finished difference Result 568 states and 1648 transitions. [2020-10-16 12:12:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 12:12:02,398 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-16 12:12:02,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:02,402 INFO L225 Difference]: With dead ends: 568 [2020-10-16 12:12:02,402 INFO L226 Difference]: Without dead ends: 568 [2020-10-16 12:12:02,403 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-10-16 12:12:02,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-10-16 12:12:02,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 544. [2020-10-16 12:12:02,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2020-10-16 12:12:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1577 transitions. [2020-10-16 12:12:02,419 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1577 transitions. Word has length 15 [2020-10-16 12:12:02,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:02,419 INFO L481 AbstractCegarLoop]: Abstraction has 544 states and 1577 transitions. [2020-10-16 12:12:02,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:12:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1577 transitions. [2020-10-16 12:12:02,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:12:02,421 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:02,421 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:02,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:12:02,422 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:02,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:02,422 INFO L82 PathProgramCache]: Analyzing trace with hash 97791055, now seen corresponding path program 3 times [2020-10-16 12:12:02,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:02,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182067509] [2020-10-16 12:12:02,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:02,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:02,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182067509] [2020-10-16 12:12:02,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:02,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:12:02,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215949663] [2020-10-16 12:12:02,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:12:02,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:02,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:12:02,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:12:02,580 INFO L87 Difference]: Start difference. First operand 544 states and 1577 transitions. Second operand 8 states. [2020-10-16 12:12:02,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:02,806 INFO L93 Difference]: Finished difference Result 770 states and 2242 transitions. [2020-10-16 12:12:02,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:12:02,807 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-16 12:12:02,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:02,812 INFO L225 Difference]: With dead ends: 770 [2020-10-16 12:12:02,813 INFO L226 Difference]: Without dead ends: 770 [2020-10-16 12:12:02,813 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:12:02,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2020-10-16 12:12:02,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 560. [2020-10-16 12:12:02,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2020-10-16 12:12:02,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1649 transitions. [2020-10-16 12:12:02,830 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 1649 transitions. Word has length 15 [2020-10-16 12:12:02,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:02,831 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 1649 transitions. [2020-10-16 12:12:02,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:12:02,831 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 1649 transitions. [2020-10-16 12:12:02,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:12:02,832 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:02,833 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:02,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:12:02,833 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:02,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:02,833 INFO L82 PathProgramCache]: Analyzing trace with hash 2102432609, now seen corresponding path program 4 times [2020-10-16 12:12:02,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:02,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234303686] [2020-10-16 12:12:02,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:02,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234303686] [2020-10-16 12:12:02,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:02,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:12:02,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826442944] [2020-10-16 12:12:02,983 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:12:02,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:02,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:12:02,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:12:02,984 INFO L87 Difference]: Start difference. First operand 560 states and 1649 transitions. Second operand 8 states. [2020-10-16 12:12:03,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:03,317 INFO L93 Difference]: Finished difference Result 762 states and 2250 transitions. [2020-10-16 12:12:03,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:12:03,318 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-16 12:12:03,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:03,324 INFO L225 Difference]: With dead ends: 762 [2020-10-16 12:12:03,324 INFO L226 Difference]: Without dead ends: 762 [2020-10-16 12:12:03,324 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:12:03,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2020-10-16 12:12:03,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 596. [2020-10-16 12:12:03,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2020-10-16 12:12:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1781 transitions. [2020-10-16 12:12:03,341 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1781 transitions. Word has length 15 [2020-10-16 12:12:03,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:03,341 INFO L481 AbstractCegarLoop]: Abstraction has 596 states and 1781 transitions. [2020-10-16 12:12:03,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:12:03,341 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1781 transitions. [2020-10-16 12:12:03,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:12:03,343 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:03,343 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:03,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:12:03,343 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:03,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:03,344 INFO L82 PathProgramCache]: Analyzing trace with hash 356130167, now seen corresponding path program 5 times [2020-10-16 12:12:03,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:03,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808028926] [2020-10-16 12:12:03,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:03,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:03,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808028926] [2020-10-16 12:12:03,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:03,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:12:03,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913094001] [2020-10-16 12:12:03,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:12:03,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:03,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:12:03,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:12:03,466 INFO L87 Difference]: Start difference. First operand 596 states and 1781 transitions. Second operand 6 states. [2020-10-16 12:12:03,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:03,718 INFO L93 Difference]: Finished difference Result 674 states and 2012 transitions. [2020-10-16 12:12:03,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:12:03,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-16 12:12:03,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:03,724 INFO L225 Difference]: With dead ends: 674 [2020-10-16 12:12:03,724 INFO L226 Difference]: Without dead ends: 674 [2020-10-16 12:12:03,724 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:12:03,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2020-10-16 12:12:03,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 568. [2020-10-16 12:12:03,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2020-10-16 12:12:03,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 1673 transitions. [2020-10-16 12:12:03,740 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 1673 transitions. Word has length 15 [2020-10-16 12:12:03,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:03,740 INFO L481 AbstractCegarLoop]: Abstraction has 568 states and 1673 transitions. [2020-10-16 12:12:03,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:12:03,741 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 1673 transitions. [2020-10-16 12:12:03,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:12:03,742 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:03,742 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:03,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 12:12:03,743 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:03,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:03,743 INFO L82 PathProgramCache]: Analyzing trace with hash -2101548220, now seen corresponding path program 1 times [2020-10-16 12:12:03,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:03,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658045861] [2020-10-16 12:12:03,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:03,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658045861] [2020-10-16 12:12:03,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:03,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:12:03,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233137679] [2020-10-16 12:12:03,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:12:03,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:03,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:12:03,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:12:03,797 INFO L87 Difference]: Start difference. First operand 568 states and 1673 transitions. Second operand 3 states. [2020-10-16 12:12:03,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:03,809 INFO L93 Difference]: Finished difference Result 763 states and 2187 transitions. [2020-10-16 12:12:03,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:12:03,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-10-16 12:12:03,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:03,813 INFO L225 Difference]: With dead ends: 763 [2020-10-16 12:12:03,813 INFO L226 Difference]: Without dead ends: 458 [2020-10-16 12:12:03,813 INFO L677 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 [2020-10-16 12:12:03,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-10-16 12:12:03,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 446. [2020-10-16 12:12:03,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2020-10-16 12:12:03,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1217 transitions. [2020-10-16 12:12:03,825 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1217 transitions. Word has length 15 [2020-10-16 12:12:03,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:03,825 INFO L481 AbstractCegarLoop]: Abstraction has 446 states and 1217 transitions. [2020-10-16 12:12:03,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:12:03,826 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1217 transitions. [2020-10-16 12:12:03,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:12:03,827 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:03,827 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:03,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 12:12:03,827 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:03,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:03,828 INFO L82 PathProgramCache]: Analyzing trace with hash 34123977, now seen corresponding path program 1 times [2020-10-16 12:12:03,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:03,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466549486] [2020-10-16 12:12:03,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:04,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:04,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466549486] [2020-10-16 12:12:04,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:04,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:12:04,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781854452] [2020-10-16 12:12:04,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:12:04,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:04,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:12:04,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:12:04,008 INFO L87 Difference]: Start difference. First operand 446 states and 1217 transitions. Second operand 5 states. [2020-10-16 12:12:04,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:04,222 INFO L93 Difference]: Finished difference Result 472 states and 1266 transitions. [2020-10-16 12:12:04,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:12:04,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-16 12:12:04,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:04,226 INFO L225 Difference]: With dead ends: 472 [2020-10-16 12:12:04,226 INFO L226 Difference]: Without dead ends: 442 [2020-10-16 12:12:04,227 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:12:04,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-10-16 12:12:04,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2020-10-16 12:12:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-10-16 12:12:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1201 transitions. [2020-10-16 12:12:04,237 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1201 transitions. Word has length 16 [2020-10-16 12:12:04,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:04,238 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1201 transitions. [2020-10-16 12:12:04,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:12:04,238 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1201 transitions. [2020-10-16 12:12:04,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:12:04,239 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:04,239 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:04,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 12:12:04,240 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:04,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:04,240 INFO L82 PathProgramCache]: Analyzing trace with hash -810770517, now seen corresponding path program 2 times [2020-10-16 12:12:04,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:04,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962609443] [2020-10-16 12:12:04,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:04,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:04,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962609443] [2020-10-16 12:12:04,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:04,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:12:04,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114777558] [2020-10-16 12:12:04,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:12:04,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:04,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:12:04,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:12:04,390 INFO L87 Difference]: Start difference. First operand 440 states and 1201 transitions. Second operand 6 states. [2020-10-16 12:12:04,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:04,792 INFO L93 Difference]: Finished difference Result 632 states and 1704 transitions. [2020-10-16 12:12:04,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 12:12:04,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-16 12:12:04,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:04,798 INFO L225 Difference]: With dead ends: 632 [2020-10-16 12:12:04,799 INFO L226 Difference]: Without dead ends: 550 [2020-10-16 12:12:04,799 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:12:04,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-10-16 12:12:04,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 502. [2020-10-16 12:12:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2020-10-16 12:12:04,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1358 transitions. [2020-10-16 12:12:04,815 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 1358 transitions. Word has length 16 [2020-10-16 12:12:04,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:04,815 INFO L481 AbstractCegarLoop]: Abstraction has 502 states and 1358 transitions. [2020-10-16 12:12:04,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:12:04,816 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 1358 transitions. [2020-10-16 12:12:04,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:12:04,817 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:04,818 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:04,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 12:12:04,818 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:04,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:04,818 INFO L82 PathProgramCache]: Analyzing trace with hash -220898487, now seen corresponding path program 3 times [2020-10-16 12:12:04,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:04,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444636946] [2020-10-16 12:12:04,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:05,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:05,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444636946] [2020-10-16 12:12:05,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:05,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:12:05,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653051661] [2020-10-16 12:12:05,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:12:05,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:05,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:12:05,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:12:05,090 INFO L87 Difference]: Start difference. First operand 502 states and 1358 transitions. Second operand 7 states. [2020-10-16 12:12:05,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:05,316 INFO L93 Difference]: Finished difference Result 508 states and 1365 transitions. [2020-10-16 12:12:05,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:12:05,319 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-16 12:12:05,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:05,322 INFO L225 Difference]: With dead ends: 508 [2020-10-16 12:12:05,324 INFO L226 Difference]: Without dead ends: 500 [2020-10-16 12:12:05,324 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:12:05,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2020-10-16 12:12:05,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2020-10-16 12:12:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2020-10-16 12:12:05,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1354 transitions. [2020-10-16 12:12:05,337 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1354 transitions. Word has length 16 [2020-10-16 12:12:05,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:05,338 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 1354 transitions. [2020-10-16 12:12:05,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:12:05,338 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1354 transitions. [2020-10-16 12:12:05,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:12:05,341 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:05,341 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:05,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 12:12:05,341 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:05,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:05,342 INFO L82 PathProgramCache]: Analyzing trace with hash -219687627, now seen corresponding path program 4 times [2020-10-16 12:12:05,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:05,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243582643] [2020-10-16 12:12:05,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:05,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:05,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243582643] [2020-10-16 12:12:05,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:05,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:12:05,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634120567] [2020-10-16 12:12:05,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:12:05,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:05,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:12:05,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:12:05,758 INFO L87 Difference]: Start difference. First operand 500 states and 1354 transitions. Second operand 7 states. [2020-10-16 12:12:06,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:06,072 INFO L93 Difference]: Finished difference Result 540 states and 1431 transitions. [2020-10-16 12:12:06,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 12:12:06,074 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-16 12:12:06,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:06,077 INFO L225 Difference]: With dead ends: 540 [2020-10-16 12:12:06,078 INFO L226 Difference]: Without dead ends: 516 [2020-10-16 12:12:06,078 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:12:06,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2020-10-16 12:12:06,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 504. [2020-10-16 12:12:06,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2020-10-16 12:12:06,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1363 transitions. [2020-10-16 12:12:06,091 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1363 transitions. Word has length 16 [2020-10-16 12:12:06,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:06,093 INFO L481 AbstractCegarLoop]: Abstraction has 504 states and 1363 transitions. [2020-10-16 12:12:06,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:12:06,093 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1363 transitions. [2020-10-16 12:12:06,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:12:06,094 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:06,095 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:06,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 12:12:06,095 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:06,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:06,095 INFO L82 PathProgramCache]: Analyzing trace with hash -219680187, now seen corresponding path program 5 times [2020-10-16 12:12:06,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:06,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159430821] [2020-10-16 12:12:06,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:06,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:06,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159430821] [2020-10-16 12:12:06,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:06,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:12:06,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066866337] [2020-10-16 12:12:06,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:12:06,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:06,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:12:06,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:12:06,206 INFO L87 Difference]: Start difference. First operand 504 states and 1363 transitions. Second operand 5 states. [2020-10-16 12:12:06,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:06,370 INFO L93 Difference]: Finished difference Result 606 states and 1596 transitions. [2020-10-16 12:12:06,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:12:06,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-16 12:12:06,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:06,374 INFO L225 Difference]: With dead ends: 606 [2020-10-16 12:12:06,374 INFO L226 Difference]: Without dead ends: 534 [2020-10-16 12:12:06,374 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:12:06,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-10-16 12:12:06,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 390. [2020-10-16 12:12:06,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-10-16 12:12:06,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1016 transitions. [2020-10-16 12:12:06,384 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1016 transitions. Word has length 16 [2020-10-16 12:12:06,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:06,384 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 1016 transitions. [2020-10-16 12:12:06,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:12:06,385 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1016 transitions. [2020-10-16 12:12:06,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:12:06,386 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:06,386 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:06,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-16 12:12:06,386 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:06,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:06,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1265012645, now seen corresponding path program 6 times [2020-10-16 12:12:06,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:06,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424211941] [2020-10-16 12:12:06,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:06,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:06,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424211941] [2020-10-16 12:12:06,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:06,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:12:06,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063741820] [2020-10-16 12:12:06,717 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:12:06,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:06,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:12:06,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:12:06,717 INFO L87 Difference]: Start difference. First operand 390 states and 1016 transitions. Second operand 7 states. [2020-10-16 12:12:07,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:07,159 INFO L93 Difference]: Finished difference Result 442 states and 1134 transitions. [2020-10-16 12:12:07,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 12:12:07,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-16 12:12:07,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:07,161 INFO L225 Difference]: With dead ends: 442 [2020-10-16 12:12:07,162 INFO L226 Difference]: Without dead ends: 281 [2020-10-16 12:12:07,162 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-10-16 12:12:07,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-10-16 12:12:07,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 266. [2020-10-16 12:12:07,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2020-10-16 12:12:07,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 676 transitions. [2020-10-16 12:12:07,168 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 676 transitions. Word has length 16 [2020-10-16 12:12:07,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:07,169 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 676 transitions. [2020-10-16 12:12:07,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:12:07,169 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 676 transitions. [2020-10-16 12:12:07,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:12:07,170 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:07,170 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:07,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-16 12:12:07,170 INFO L429 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:07,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:07,170 INFO L82 PathProgramCache]: Analyzing trace with hash -723485020, now seen corresponding path program 1 times [2020-10-16 12:12:07,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:07,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373366197] [2020-10-16 12:12:07,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:07,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:07,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373366197] [2020-10-16 12:12:07,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:07,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:12:07,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340458173] [2020-10-16 12:12:07,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:12:07,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:07,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:12:07,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:12:07,257 INFO L87 Difference]: Start difference. First operand 266 states and 676 transitions. Second operand 4 states. [2020-10-16 12:12:07,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:07,289 INFO L93 Difference]: Finished difference Result 258 states and 576 transitions. [2020-10-16 12:12:07,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:12:07,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-16 12:12:07,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:07,291 INFO L225 Difference]: With dead ends: 258 [2020-10-16 12:12:07,291 INFO L226 Difference]: Without dead ends: 181 [2020-10-16 12:12:07,291 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:12:07,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-10-16 12:12:07,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2020-10-16 12:12:07,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-10-16 12:12:07,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 389 transitions. [2020-10-16 12:12:07,296 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 389 transitions. Word has length 16 [2020-10-16 12:12:07,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:07,296 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 389 transitions. [2020-10-16 12:12:07,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:12:07,296 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 389 transitions. [2020-10-16 12:12:07,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:12:07,297 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:07,297 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:07,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-16 12:12:07,298 INFO L429 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:07,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:07,298 INFO L82 PathProgramCache]: Analyzing trace with hash 233701298, now seen corresponding path program 1 times [2020-10-16 12:12:07,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:07,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064406942] [2020-10-16 12:12:07,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:07,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:07,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064406942] [2020-10-16 12:12:07,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:07,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:12:07,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991388142] [2020-10-16 12:12:07,387 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:12:07,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:07,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:12:07,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:12:07,388 INFO L87 Difference]: Start difference. First operand 181 states and 389 transitions. Second operand 5 states. [2020-10-16 12:12:07,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:07,430 INFO L93 Difference]: Finished difference Result 154 states and 297 transitions. [2020-10-16 12:12:07,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:12:07,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-16 12:12:07,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:07,432 INFO L225 Difference]: With dead ends: 154 [2020-10-16 12:12:07,432 INFO L226 Difference]: Without dead ends: 117 [2020-10-16 12:12:07,433 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:12:07,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-10-16 12:12:07,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2020-10-16 12:12:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-10-16 12:12:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 216 transitions. [2020-10-16 12:12:07,435 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 216 transitions. Word has length 17 [2020-10-16 12:12:07,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:07,436 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 216 transitions. [2020-10-16 12:12:07,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:12:07,436 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 216 transitions. [2020-10-16 12:12:07,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 12:12:07,436 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:07,437 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:07,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-16 12:12:07,437 INFO L429 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:07,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:07,437 INFO L82 PathProgramCache]: Analyzing trace with hash -499071186, now seen corresponding path program 1 times [2020-10-16 12:12:07,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:07,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045285628] [2020-10-16 12:12:07,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:07,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:07,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045285628] [2020-10-16 12:12:07,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:07,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:12:07,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353433234] [2020-10-16 12:12:07,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:12:07,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:07,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:12:07,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:12:07,533 INFO L87 Difference]: Start difference. First operand 117 states and 216 transitions. Second operand 6 states. [2020-10-16 12:12:07,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:07,586 INFO L93 Difference]: Finished difference Result 105 states and 191 transitions. [2020-10-16 12:12:07,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:12:07,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-16 12:12:07,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:07,587 INFO L225 Difference]: With dead ends: 105 [2020-10-16 12:12:07,587 INFO L226 Difference]: Without dead ends: 75 [2020-10-16 12:12:07,588 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:12:07,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-10-16 12:12:07,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2020-10-16 12:12:07,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-16 12:12:07,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 121 transitions. [2020-10-16 12:12:07,590 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 121 transitions. Word has length 19 [2020-10-16 12:12:07,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:07,590 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 121 transitions. [2020-10-16 12:12:07,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:12:07,590 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 121 transitions. [2020-10-16 12:12:07,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:07,591 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:07,591 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:07,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-16 12:12:07,591 INFO L429 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:07,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:07,592 INFO L82 PathProgramCache]: Analyzing trace with hash -697931189, now seen corresponding path program 1 times [2020-10-16 12:12:07,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:07,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812237987] [2020-10-16 12:12:07,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:07,870 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 22 [2020-10-16 12:12:08,039 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 28 [2020-10-16 12:12:08,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:08,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812237987] [2020-10-16 12:12:08,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:08,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 12:12:08,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815643294] [2020-10-16 12:12:08,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 12:12:08,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:08,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 12:12:08,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-10-16 12:12:08,313 INFO L87 Difference]: Start difference. First operand 71 states and 121 transitions. Second operand 12 states. [2020-10-16 12:12:08,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:08,831 INFO L93 Difference]: Finished difference Result 88 states and 142 transitions. [2020-10-16 12:12:08,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 12:12:08,832 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-10-16 12:12:08,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:08,833 INFO L225 Difference]: With dead ends: 88 [2020-10-16 12:12:08,833 INFO L226 Difference]: Without dead ends: 74 [2020-10-16 12:12:08,834 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2020-10-16 12:12:08,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-16 12:12:08,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2020-10-16 12:12:08,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-10-16 12:12:08,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 115 transitions. [2020-10-16 12:12:08,836 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 115 transitions. Word has length 21 [2020-10-16 12:12:08,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:08,836 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 115 transitions. [2020-10-16 12:12:08,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 12:12:08,836 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 115 transitions. [2020-10-16 12:12:08,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:08,837 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:08,837 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:08,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-16 12:12:08,837 INFO L429 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:08,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:08,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1113770657, now seen corresponding path program 2 times [2020-10-16 12:12:08,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:08,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410119854] [2020-10-16 12:12:08,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:09,211 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 28 [2020-10-16 12:12:09,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:09,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410119854] [2020-10-16 12:12:09,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:09,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 12:12:09,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840094281] [2020-10-16 12:12:09,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 12:12:09,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:09,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 12:12:09,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-10-16 12:12:09,690 INFO L87 Difference]: Start difference. First operand 68 states and 115 transitions. Second operand 12 states. [2020-10-16 12:12:09,848 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2020-10-16 12:12:09,990 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2020-10-16 12:12:10,213 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2020-10-16 12:12:10,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:10,702 INFO L93 Difference]: Finished difference Result 97 states and 156 transitions. [2020-10-16 12:12:10,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 12:12:10,703 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-10-16 12:12:10,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:10,704 INFO L225 Difference]: With dead ends: 97 [2020-10-16 12:12:10,704 INFO L226 Difference]: Without dead ends: 63 [2020-10-16 12:12:10,705 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2020-10-16 12:12:10,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-16 12:12:10,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2020-10-16 12:12:10,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-16 12:12:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 104 transitions. [2020-10-16 12:12:10,707 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 104 transitions. Word has length 21 [2020-10-16 12:12:10,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:10,707 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 104 transitions. [2020-10-16 12:12:10,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 12:12:10,707 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2020-10-16 12:12:10,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:10,708 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:10,708 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:10,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-16 12:12:10,708 INFO L429 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:10,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:10,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1387093443, now seen corresponding path program 3 times [2020-10-16 12:12:10,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:10,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894588558] [2020-10-16 12:12:10,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:11,279 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2020-10-16 12:12:11,495 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2020-10-16 12:12:11,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:11,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894588558] [2020-10-16 12:12:11,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:11,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 12:12:11,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445511148] [2020-10-16 12:12:11,957 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 12:12:11,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:11,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 12:12:11,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-10-16 12:12:11,958 INFO L87 Difference]: Start difference. First operand 62 states and 104 transitions. Second operand 14 states. [2020-10-16 12:12:12,393 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 24 [2020-10-16 12:12:12,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:12,979 INFO L93 Difference]: Finished difference Result 99 states and 166 transitions. [2020-10-16 12:12:12,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 12:12:12,980 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2020-10-16 12:12:12,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:12,981 INFO L225 Difference]: With dead ends: 99 [2020-10-16 12:12:12,981 INFO L226 Difference]: Without dead ends: 93 [2020-10-16 12:12:12,982 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2020-10-16 12:12:12,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-10-16 12:12:12,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2020-10-16 12:12:12,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-16 12:12:12,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 127 transitions. [2020-10-16 12:12:12,986 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 127 transitions. Word has length 21 [2020-10-16 12:12:12,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:12,986 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 127 transitions. [2020-10-16 12:12:12,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 12:12:12,986 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 127 transitions. [2020-10-16 12:12:12,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:12,987 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:12,987 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:12,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-16 12:12:12,987 INFO L429 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:12,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:12,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1439475463, now seen corresponding path program 4 times [2020-10-16 12:12:12,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:12,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324944630] [2020-10-16 12:12:12,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:13,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:13,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324944630] [2020-10-16 12:12:13,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:13,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 12:12:13,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696773645] [2020-10-16 12:12:13,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 12:12:13,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:13,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 12:12:13,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:12:13,648 INFO L87 Difference]: Start difference. First operand 75 states and 127 transitions. Second operand 10 states. [2020-10-16 12:12:14,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:14,166 INFO L93 Difference]: Finished difference Result 123 states and 208 transitions. [2020-10-16 12:12:14,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 12:12:14,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-10-16 12:12:14,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:14,168 INFO L225 Difference]: With dead ends: 123 [2020-10-16 12:12:14,168 INFO L226 Difference]: Without dead ends: 91 [2020-10-16 12:12:14,169 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-10-16 12:12:14,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-10-16 12:12:14,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 65. [2020-10-16 12:12:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-16 12:12:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 107 transitions. [2020-10-16 12:12:14,171 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 107 transitions. Word has length 21 [2020-10-16 12:12:14,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:14,171 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 107 transitions. [2020-10-16 12:12:14,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 12:12:14,171 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 107 transitions. [2020-10-16 12:12:14,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:14,171 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:14,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:14,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-16 12:12:14,172 INFO L429 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:14,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:14,172 INFO L82 PathProgramCache]: Analyzing trace with hash -284254259, now seen corresponding path program 5 times [2020-10-16 12:12:14,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:14,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963196286] [2020-10-16 12:12:14,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:14,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:14,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963196286] [2020-10-16 12:12:14,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:14,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 12:12:14,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330451435] [2020-10-16 12:12:14,437 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 12:12:14,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:14,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 12:12:14,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:12:14,437 INFO L87 Difference]: Start difference. First operand 65 states and 107 transitions. Second operand 11 states. [2020-10-16 12:12:14,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:14,935 INFO L93 Difference]: Finished difference Result 105 states and 183 transitions. [2020-10-16 12:12:14,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 12:12:14,936 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-16 12:12:14,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:14,937 INFO L225 Difference]: With dead ends: 105 [2020-10-16 12:12:14,937 INFO L226 Difference]: Without dead ends: 75 [2020-10-16 12:12:14,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-10-16 12:12:14,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-10-16 12:12:14,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2020-10-16 12:12:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-16 12:12:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 120 transitions. [2020-10-16 12:12:14,939 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 120 transitions. Word has length 21 [2020-10-16 12:12:14,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:14,939 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 120 transitions. [2020-10-16 12:12:14,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 12:12:14,940 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 120 transitions. [2020-10-16 12:12:14,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:14,940 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:14,940 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:14,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-16 12:12:14,941 INFO L429 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:14,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:14,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1634451855, now seen corresponding path program 6 times [2020-10-16 12:12:14,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:14,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195430911] [2020-10-16 12:12:14,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:15,487 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2020-10-16 12:12:16,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:16,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195430911] [2020-10-16 12:12:16,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:16,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-16 12:12:16,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802967887] [2020-10-16 12:12:16,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-16 12:12:16,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:16,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-16 12:12:16,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-10-16 12:12:16,112 INFO L87 Difference]: Start difference. First operand 71 states and 120 transitions. Second operand 13 states. [2020-10-16 12:12:16,759 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2020-10-16 12:12:16,985 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2020-10-16 12:12:17,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:17,405 INFO L93 Difference]: Finished difference Result 104 states and 166 transitions. [2020-10-16 12:12:17,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-16 12:12:17,406 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2020-10-16 12:12:17,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:17,406 INFO L225 Difference]: With dead ends: 104 [2020-10-16 12:12:17,407 INFO L226 Difference]: Without dead ends: 57 [2020-10-16 12:12:17,407 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2020-10-16 12:12:17,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-16 12:12:17,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2020-10-16 12:12:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-16 12:12:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 92 transitions. [2020-10-16 12:12:17,410 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 92 transitions. Word has length 21 [2020-10-16 12:12:17,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:17,410 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 92 transitions. [2020-10-16 12:12:17,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-16 12:12:17,410 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 92 transitions. [2020-10-16 12:12:17,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:17,411 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:17,411 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:17,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-16 12:12:17,411 INFO L429 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:17,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:17,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1310019483, now seen corresponding path program 7 times [2020-10-16 12:12:17,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:17,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245882371] [2020-10-16 12:12:17,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:17,766 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2020-10-16 12:12:17,945 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2020-10-16 12:12:18,186 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2020-10-16 12:12:18,325 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2020-10-16 12:12:18,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:18,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245882371] [2020-10-16 12:12:18,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:18,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-16 12:12:18,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245973239] [2020-10-16 12:12:18,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-16 12:12:18,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:18,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-16 12:12:18,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-10-16 12:12:18,603 INFO L87 Difference]: Start difference. First operand 56 states and 92 transitions. Second operand 13 states. [2020-10-16 12:12:18,900 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2020-10-16 12:12:19,281 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2020-10-16 12:12:19,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:19,942 INFO L93 Difference]: Finished difference Result 95 states and 158 transitions. [2020-10-16 12:12:19,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 12:12:19,943 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2020-10-16 12:12:19,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:19,944 INFO L225 Difference]: With dead ends: 95 [2020-10-16 12:12:19,944 INFO L226 Difference]: Without dead ends: 51 [2020-10-16 12:12:19,944 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2020-10-16 12:12:19,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-16 12:12:19,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2020-10-16 12:12:19,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-16 12:12:19,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2020-10-16 12:12:19,946 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 21 [2020-10-16 12:12:19,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:19,946 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2020-10-16 12:12:19,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-16 12:12:19,947 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2020-10-16 12:12:19,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:19,947 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:19,947 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:19,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-16 12:12:19,948 INFO L429 AbstractCegarLoop]: === Iteration 34 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:19,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:19,948 INFO L82 PathProgramCache]: Analyzing trace with hash -361328219, now seen corresponding path program 8 times [2020-10-16 12:12:19,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:19,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879014482] [2020-10-16 12:12:19,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:20,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:20,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879014482] [2020-10-16 12:12:20,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:20,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:12:20,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965541107] [2020-10-16 12:12:20,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:12:20,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:20,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:12:20,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:12:20,210 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 7 states. [2020-10-16 12:12:20,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:20,396 INFO L93 Difference]: Finished difference Result 67 states and 108 transitions. [2020-10-16 12:12:20,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:12:20,397 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-16 12:12:20,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:20,397 INFO L225 Difference]: With dead ends: 67 [2020-10-16 12:12:20,397 INFO L226 Difference]: Without dead ends: 37 [2020-10-16 12:12:20,398 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:12:20,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-16 12:12:20,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-16 12:12:20,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-16 12:12:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2020-10-16 12:12:20,399 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 21 [2020-10-16 12:12:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:20,399 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2020-10-16 12:12:20,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:12:20,400 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2020-10-16 12:12:20,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:20,400 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:20,400 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:20,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-16 12:12:20,400 INFO L429 AbstractCegarLoop]: === Iteration 35 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:20,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:20,401 INFO L82 PathProgramCache]: Analyzing trace with hash 559176997, now seen corresponding path program 9 times [2020-10-16 12:12:20,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:20,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220702381] [2020-10-16 12:12:20,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:12:20,447 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:12:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:12:20,498 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:12:20,537 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:12:20,537 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:12:20,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-16 12:12:20,538 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:12:20,553 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1649] [1649] L3-->L854: Formula: (let ((.cse6 (= (mod ~x$r_buff0_thd0~0_In283634403 256) 0)) (.cse7 (= (mod ~x$w_buff0_used~0_In283634403 256) 0)) (.cse9 (= 0 (mod ~x$w_buff1_used~0_In283634403 256))) (.cse8 (= (mod ~x$r_buff1_thd0~0_In283634403 256) 0))) (let ((.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse3 (or .cse6 .cse7))) (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In283634403| ULTIMATE.start_assume_abort_if_not_~cond_Out283634403) (= ~x$r_buff0_thd0~0_Out283634403 ~x$r_buff0_thd0~0_In283634403) (or (and .cse0 .cse1 (= ~x$w_buff1_used~0_Out283634403 0)) (and (= ~x$w_buff1_used~0_In283634403 ~x$w_buff1_used~0_Out283634403) .cse2)) (or (and .cse3 (or (and .cse2 (= ~x~0_In283634403 ~x~0_Out283634403)) (and .cse0 .cse1 (= ~x$w_buff1~0_In283634403 ~x~0_Out283634403)))) (and .cse4 (= ~x$w_buff0~0_In283634403 ~x~0_Out283634403) .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out283634403 0)) (= ~x$r_buff1_thd0~0_Out283634403 ~x$r_buff1_thd0~0_In283634403) (or (and (= ~x$w_buff0_used~0_Out283634403 0) .cse4 .cse5) (and (= ~x$w_buff0_used~0_In283634403 ~x$w_buff0_used~0_Out283634403) .cse3))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In283634403, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In283634403, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In283634403|, ~x$w_buff1~0=~x$w_buff1~0_In283634403, ~x$w_buff1_used~0=~x$w_buff1_used~0_In283634403, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In283634403, ~x~0=~x~0_In283634403, ~x$w_buff0_used~0=~x$w_buff0_used~0_In283634403} OutVars{~x$w_buff0~0=~x$w_buff0~0_In283634403, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out283634403, ~x$w_buff1~0=~x$w_buff1~0_In283634403, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out283634403, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out283634403|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out283634403, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out283634403, ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out283634403|, ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out283634403|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In283634403|, ULTIMATE.start_main_#t~ite71=|ULTIMATE.start_main_#t~ite71_Out283634403|, ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out283634403|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out283634403, ULTIMATE.start_main_#t~ite70=|ULTIMATE.start_main_#t~ite70_Out283634403|, ~x~0=~x~0_Out283634403} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite74, ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite70, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite69, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] because there is no mapped edge [2020-10-16 12:12:20,559 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,560 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,561 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,561 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,562 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,562 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,562 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,562 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,562 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,562 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,563 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,563 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,563 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,563 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,563 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,563 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,564 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,564 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,564 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,565 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,565 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,566 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,566 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,566 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,567 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,567 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,567 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,568 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,568 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,568 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,569 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,569 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,569 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,569 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,569 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,569 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,569 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,570 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,570 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,570 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,570 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,570 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,570 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,571 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,571 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,571 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,572 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,572 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,572 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,572 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,572 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,572 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,573 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,573 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,573 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,573 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,573 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,573 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,574 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,574 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,574 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,574 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,575 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,575 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,575 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,575 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,575 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,575 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,575 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,576 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,576 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,577 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,577 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,577 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,577 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,577 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,578 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,578 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,578 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,578 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,578 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,578 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,579 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,579 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,579 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,579 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,579 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,579 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,579 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,580 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,580 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,580 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,580 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,580 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:20,580 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:20,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:12:20 BasicIcfg [2020-10-16 12:12:20,679 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:12:20,680 INFO L168 Benchmark]: Toolchain (without parser) took 36529.96 ms. Allocated memory was 140.5 MB in the beginning and 606.6 MB in the end (delta: 466.1 MB). Free memory was 102.1 MB in the beginning and 326.1 MB in the end (delta: -224.1 MB). Peak memory consumption was 242.0 MB. Max. memory is 7.1 GB. [2020-10-16 12:12:20,681 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 12:12:20,681 INFO L168 Benchmark]: CACSL2BoogieTranslator took 851.89 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 101.9 MB in the beginning and 155.4 MB in the end (delta: -53.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2020-10-16 12:12:20,682 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.17 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:12:20,685 INFO L168 Benchmark]: Boogie Preprocessor took 65.70 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 148.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-16 12:12:20,686 INFO L168 Benchmark]: RCFGBuilder took 3626.22 ms. Allocated memory was 203.9 MB in the beginning and 247.5 MB in the end (delta: 43.5 MB). Free memory was 148.8 MB in the beginning and 89.1 MB in the end (delta: 59.6 MB). Peak memory consumption was 103.2 MB. Max. memory is 7.1 GB. [2020-10-16 12:12:20,686 INFO L168 Benchmark]: TraceAbstraction took 31906.46 ms. Allocated memory was 247.5 MB in the beginning and 606.6 MB in the end (delta: 359.1 MB). Free memory was 89.1 MB in the beginning and 326.1 MB in the end (delta: -237.0 MB). Peak memory consumption was 122.2 MB. Max. memory is 7.1 GB. [2020-10-16 12:12:20,689 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 851.89 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 101.9 MB in the beginning and 155.4 MB in the end (delta: -53.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.17 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.70 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 148.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3626.22 ms. Allocated memory was 203.9 MB in the beginning and 247.5 MB in the end (delta: 43.5 MB). Free memory was 148.8 MB in the beginning and 89.1 MB in the end (delta: 59.6 MB). Peak memory consumption was 103.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31906.46 ms. Allocated memory was 247.5 MB in the beginning and 606.6 MB in the end (delta: 359.1 MB). Free memory was 89.1 MB in the beginning and 326.1 MB in the end (delta: -237.0 MB). Peak memory consumption was 122.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 811 VarBasedMoverChecksPositive, 39 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 55 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.3s, 100 PlacesBefore, 36 PlacesAfterwards, 92 TransitionsBefore, 26 TransitionsAfterwards, 1624 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 76 TotalNumberOfCompositions, 4248 MoverChecksTotal - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p1_EAX = 0; [L704] 0 _Bool main$tmp_guard0; [L705] 0 _Bool main$tmp_guard1; [L707] 0 int x = 0; [L708] 0 _Bool x$flush_delayed; [L709] 0 int x$mem_tmp; [L710] 0 _Bool x$r_buff0_thd0; [L711] 0 _Bool x$r_buff0_thd1; [L712] 0 _Bool x$r_buff0_thd2; [L713] 0 _Bool x$r_buff0_thd3; [L714] 0 _Bool x$r_buff1_thd0; [L715] 0 _Bool x$r_buff1_thd1; [L716] 0 _Bool x$r_buff1_thd2; [L717] 0 _Bool x$r_buff1_thd3; [L718] 0 _Bool x$read_delayed; [L719] 0 int *x$read_delayed_var; [L720] 0 int x$w_buff0; [L721] 0 _Bool x$w_buff0_used; [L722] 0 int x$w_buff1; [L723] 0 _Bool x$w_buff1_used; [L725] 0 int y = 0; [L726] 0 _Bool weak$$choice0; [L727] 0 _Bool weak$$choice2; [L838] 0 pthread_t t2549; [L839] FCALL, FORK 0 pthread_create(&t2549, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L840] 0 pthread_t t2550; [L841] FCALL, FORK 0 pthread_create(&t2550, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L842] 0 pthread_t t2551; [L843] FCALL, FORK 0 pthread_create(&t2551, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] 3 x$w_buff1 = x$w_buff0 [L802] 3 x$w_buff0 = 2 [L803] 3 x$w_buff1_used = x$w_buff0_used [L804] 3 x$w_buff0_used = (_Bool)1 [L8] COND FALSE 3 !(!expression) [L806] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L807] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L808] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L809] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L810] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L813] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L737] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L738] 1 x$flush_delayed = weak$$choice2 [L739] 1 x$mem_tmp = x [L740] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 [L740] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L741] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L742] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L743] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L744] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L745] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L746] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L746] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 __unbuffered_p0_EAX = x [L748] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L748] 1 x = x$flush_delayed ? x$mem_tmp : x [L749] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L761] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L764] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L767] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L768] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 x$flush_delayed = weak$$choice2 [L774] 2 x$mem_tmp = x [L775] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L775] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L776] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L776] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L777] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1 [L777] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L777] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L778] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L778] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L780] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L780] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L780] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = x [L783] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L783] 2 x = x$flush_delayed ? x$mem_tmp : x [L784] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L816] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L817] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L818] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L819] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L820] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 x$flush_delayed = weak$$choice2 [L859] 0 x$mem_tmp = x [L860] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L860] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L860] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L861] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L861] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L862] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L862] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L862] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L862] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L863] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L863] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L863] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L863] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L864] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L865] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L866] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L866] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L868] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L868] 0 x = x$flush_delayed ? x$mem_tmp : x [L869] 0 x$flush_delayed = (_Bool)0 [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 31.5s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.3s, HoareTripleCheckerStatistics: 658 SDtfs, 1330 SDslu, 1595 SDs, 0 SdLazy, 2644 SolverSat, 779 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 12.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=778occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 34 MinimizatonAttempts, 1495 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 557 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 502 ConstructedInterpolants, 0 QuantifiedInterpolants, 153962 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...