/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/ldv-races/race-2_1-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 23:40:45,765 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 23:40:45,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 23:40:45,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 23:40:45,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 23:40:45,812 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 23:40:45,814 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 23:40:45,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 23:40:45,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 23:40:45,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 23:40:45,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 23:40:45,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 23:40:45,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 23:40:45,824 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 23:40:45,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 23:40:45,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 23:40:45,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 23:40:45,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 23:40:45,831 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 23:40:45,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 23:40:45,836 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 23:40:45,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 23:40:45,843 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 23:40:45,844 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 23:40:45,863 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 23:40:45,864 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 23:40:45,871 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 23:40:45,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 23:40:45,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 23:40:45,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 23:40:45,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 23:40:45,886 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 23:40:45,887 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 23:40:45,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 23:40:45,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 23:40:45,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 23:40:45,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 23:40:45,899 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 23:40:45,899 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 23:40:45,900 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 23:40:45,901 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 23:40:45,902 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 23:40:45,930 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 23:40:45,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 23:40:45,932 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 23:40:45,933 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 23:40:45,933 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 23:40:45,933 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 23:40:45,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 23:40:45,933 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 23:40:45,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 23:40:45,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 23:40:45,934 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 23:40:45,934 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 23:40:45,934 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 23:40:45,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 23:40:45,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 23:40:45,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 23:40:45,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 23:40:45,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 23:40:45,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 23:40:45,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 23:40:45,936 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 23:40:45,936 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 23:40:45,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 23:40:45,937 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 23:40:45,937 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 23:40:45,937 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 23:40:46,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 23:40:46,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 23:40:46,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 23:40:46,409 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 23:40:46,410 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 23:40:46,411 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2021-01-06 23:40:46,502 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4edb48d90/65f989920f78407ab34cb94a92f6228f/FLAG001279447 [2021-01-06 23:40:47,447 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 23:40:47,447 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2021-01-06 23:40:47,482 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4edb48d90/65f989920f78407ab34cb94a92f6228f/FLAG001279447 [2021-01-06 23:40:47,541 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4edb48d90/65f989920f78407ab34cb94a92f6228f [2021-01-06 23:40:47,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 23:40:47,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 23:40:47,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 23:40:47,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 23:40:47,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 23:40:47,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:40:47" (1/1) ... [2021-01-06 23:40:47,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6576f909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:47, skipping insertion in model container [2021-01-06 23:40:47,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:40:47" (1/1) ... [2021-01-06 23:40:47,571 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 23:40:47,658 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 23:40:48,858 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_1-container_of.i[76077,76090] left hand side expression in assignment: lhs: VariableLHS[~data~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~data~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~data~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~probe_ret~0,] left hand side expression in assignment: lhs: StructLHS[StructLHS[VariableLHS[~data~1,],shared],a] left hand side expression in assignment: lhs: StructLHS[StructLHS[VariableLHS[~data~1,],shared],b] [2021-01-06 23:40:48,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 23:40:48,953 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 23:40:49,064 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_1-container_of.i[76077,76090] left hand side expression in assignment: lhs: VariableLHS[~data~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~data~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~data~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~probe_ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#data~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#data~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#data~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~#data~1,],offset]]]] [2021-01-06 23:40:49,085 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 23:40:49,530 INFO L208 MainTranslator]: Completed translation [2021-01-06 23:40:49,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:49 WrapperNode [2021-01-06 23:40:49,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 23:40:49,533 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 23:40:49,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 23:40:49,533 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 23:40:49,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:49" (1/1) ... [2021-01-06 23:40:49,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:49" (1/1) ... [2021-01-06 23:40:49,644 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 23:40:49,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 23:40:49,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 23:40:49,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 23:40:49,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:49" (1/1) ... [2021-01-06 23:40:49,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:49" (1/1) ... [2021-01-06 23:40:49,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:49" (1/1) ... [2021-01-06 23:40:49,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:49" (1/1) ... [2021-01-06 23:40:49,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:49" (1/1) ... [2021-01-06 23:40:49,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:49" (1/1) ... [2021-01-06 23:40:49,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:49" (1/1) ... [2021-01-06 23:40:49,701 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 23:40:49,702 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 23:40:49,702 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 23:40:49,703 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 23:40:49,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:49" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 23:40:49,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 23:40:49,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 23:40:49,808 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-01-06 23:40:49,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 23:40:49,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 23:40:49,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 23:40:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2021-01-06 23:40:49,809 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2021-01-06 23:40:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 23:40:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 23:40:49,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 23:40:49,811 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-01-06 23:40:50,681 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 23:40:50,682 INFO L299 CfgBuilder]: Removed 24 assume(true) statements. [2021-01-06 23:40:50,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:40:50 BoogieIcfgContainer [2021-01-06 23:40:50,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 23:40:50,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 23:40:50,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 23:40:50,690 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 23:40:50,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:40:47" (1/3) ... [2021-01-06 23:40:50,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a068eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:40:50, skipping insertion in model container [2021-01-06 23:40:50,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:49" (2/3) ... [2021-01-06 23:40:50,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a068eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:40:50, skipping insertion in model container [2021-01-06 23:40:50,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:40:50" (3/3) ... [2021-01-06 23:40:50,693 INFO L111 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2021-01-06 23:40:50,701 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-01-06 23:40:50,701 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 23:40:50,706 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2021-01-06 23:40:50,708 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-01-06 23:40:50,752 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,752 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,752 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,753 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,753 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,753 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,754 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,754 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,754 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,754 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,755 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,755 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,755 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,755 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,755 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,756 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,756 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,756 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,756 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,756 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,757 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,757 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,757 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,757 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,758 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,758 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,758 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,758 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,758 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,759 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,759 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,759 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,759 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,760 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,760 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,760 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,760 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,760 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,761 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,761 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,761 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,761 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,762 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,762 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,762 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,762 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,763 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,763 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,763 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,763 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,764 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,764 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,764 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,764 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,764 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,765 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,765 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,765 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,765 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,766 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,766 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,766 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,766 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,766 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,767 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,767 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,767 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,767 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,767 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,768 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,768 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,768 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,768 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,768 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,769 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,769 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,769 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,769 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,770 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,770 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,770 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,770 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,770 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,770 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,770 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,771 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,771 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,771 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,771 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,771 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,772 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,772 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,772 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,772 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,772 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,772 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,773 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,773 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,773 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,773 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,773 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,773 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,774 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,774 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,774 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,774 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,774 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,775 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,775 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,775 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,775 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,775 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,776 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,776 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,776 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,776 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,776 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,777 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,777 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,777 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,777 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,778 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,778 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,779 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,779 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,779 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,780 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,780 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,780 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,780 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,781 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,781 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,781 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,781 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,781 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,781 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,782 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,782 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,782 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,782 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,785 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,785 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,786 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,786 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,786 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,786 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,786 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,787 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,787 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,787 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,787 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,787 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,793 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,793 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,793 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,793 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,793 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,794 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,794 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,794 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,794 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,794 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,794 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,795 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:40:50,804 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-01-06 23:40:50,822 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-01-06 23:40:50,844 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 23:40:50,845 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 23:40:50,845 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 23:40:50,845 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 23:40:50,845 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 23:40:50,845 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 23:40:50,846 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 23:40:50,846 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 23:40:50,863 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-01-06 23:40:50,865 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 165 transitions, 352 flow [2021-01-06 23:40:50,869 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 165 transitions, 352 flow [2021-01-06 23:40:50,871 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 161 places, 165 transitions, 352 flow [2021-01-06 23:40:50,946 INFO L129 PetriNetUnfolder]: 11/205 cut-off events. [2021-01-06 23:40:50,947 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-01-06 23:40:50,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 205 events. 11/205 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 418 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 115. Up to 4 conditions per place. [2021-01-06 23:40:50,959 INFO L116 LiptonReduction]: Number of co-enabled transitions 2996 [2021-01-06 23:40:51,206 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:40:51,230 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:40:51,238 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:40:51,257 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:40:51,260 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:40:51,260 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2021-01-06 23:40:51,292 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:40:51,315 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:40:51,323 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:40:51,343 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:40:51,345 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:40:51,345 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2021-01-06 23:40:53,424 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:40:53,449 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:40:53,458 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:40:53,477 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:40:53,479 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:40:53,480 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2021-01-06 23:40:53,498 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:40:53,529 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:40:53,538 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:40:53,562 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:40:53,564 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:40:53,565 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2021-01-06 23:40:56,302 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:40:56,343 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:40:56,351 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:40:56,383 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:40:56,385 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:40:56,386 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2021-01-06 23:40:56,406 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:40:56,438 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:40:56,444 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:40:56,470 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:40:56,472 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:40:56,472 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2021-01-06 23:40:59,086 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:40:59,115 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:40:59,122 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:40:59,145 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:40:59,146 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:40:59,147 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2021-01-06 23:40:59,164 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:40:59,191 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:40:59,198 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:40:59,218 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:40:59,220 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:40:59,221 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2021-01-06 23:41:01,718 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:01,748 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:01,761 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:01,790 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:01,793 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:01,793 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2021-01-06 23:41:01,810 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:01,841 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:01,850 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:01,874 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:01,877 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:01,877 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2021-01-06 23:41:03,909 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:03,933 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:03,939 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:03,958 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:03,961 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:03,961 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2021-01-06 23:41:03,982 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:04,007 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:04,016 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:04,037 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:04,038 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:04,039 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2021-01-06 23:41:06,061 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:06,084 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:06,089 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:06,109 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:06,111 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:06,111 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2021-01-06 23:41:06,130 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:06,159 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:06,164 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:06,185 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:06,187 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:06,188 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2021-01-06 23:41:09,166 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:09,192 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:09,197 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:09,214 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:09,215 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:09,216 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2021-01-06 23:41:09,236 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:09,259 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:09,267 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:09,284 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:09,285 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:09,286 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2021-01-06 23:41:11,660 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:11,687 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:11,693 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:11,711 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:11,713 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:11,714 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2021-01-06 23:41:11,746 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:11,772 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:11,776 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:11,796 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:11,797 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:11,797 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2021-01-06 23:41:14,137 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:14,161 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:14,167 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:14,188 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:14,195 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:14,195 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2021-01-06 23:41:14,214 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:14,236 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:14,243 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:14,264 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:14,265 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:14,266 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2021-01-06 23:41:16,396 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:16,423 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:16,431 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:16,454 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:16,455 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:16,456 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2021-01-06 23:41:16,483 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:16,514 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:16,523 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:16,548 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:16,550 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:16,550 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2021-01-06 23:41:18,770 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:18,793 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:18,799 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:18,819 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:18,820 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:18,820 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2021-01-06 23:41:18,837 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:18,860 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:18,865 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:18,884 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:18,886 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:18,886 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2021-01-06 23:41:20,972 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:20,990 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:20,995 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:21,014 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:21,016 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:21,016 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2021-01-06 23:41:21,028 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:21,052 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:21,057 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:21,076 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:21,077 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:21,078 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2021-01-06 23:41:23,911 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2021-01-06 23:41:24,095 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2021-01-06 23:41:24,301 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:24,329 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:24,335 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:24,355 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:24,357 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:24,357 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2021-01-06 23:41:24,371 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:24,397 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:24,401 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:24,420 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:24,422 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:24,422 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2021-01-06 23:41:26,808 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:26,833 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:26,838 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:26,858 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:26,859 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:26,860 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2021-01-06 23:41:26,872 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:26,896 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:26,901 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:26,919 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:26,921 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:26,921 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2021-01-06 23:41:26,936 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:26,959 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:26,967 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:26,989 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:26,991 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:26,991 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2021-01-06 23:41:27,005 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:27,029 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:27,033 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:27,051 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:27,069 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:27,070 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2021-01-06 23:41:29,540 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2021-01-06 23:41:29,802 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2021-01-06 23:41:29,919 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:29,944 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:29,951 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:29,972 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:29,973 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:29,973 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2021-01-06 23:41:29,986 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:30,008 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:30,013 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:30,032 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:30,034 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:30,034 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2021-01-06 23:41:32,625 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:32,648 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:32,653 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:32,673 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:32,675 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:32,675 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2021-01-06 23:41:32,688 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:32,712 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:32,716 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:32,735 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:32,737 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:32,737 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2021-01-06 23:41:35,159 WARN L197 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2021-01-06 23:41:35,292 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-01-06 23:41:35,662 WARN L197 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2021-01-06 23:41:35,819 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-01-06 23:41:37,753 WARN L197 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 145 [2021-01-06 23:41:38,107 WARN L197 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2021-01-06 23:41:38,872 WARN L197 SmtUtils]: Spent 763.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 148 [2021-01-06 23:41:39,238 WARN L197 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2021-01-06 23:41:40,644 WARN L197 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 162 DAG size of output: 160 [2021-01-06 23:41:41,149 WARN L197 SmtUtils]: Spent 502.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2021-01-06 23:41:42,121 WARN L197 SmtUtils]: Spent 970.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 166 [2021-01-06 23:41:42,615 WARN L197 SmtUtils]: Spent 491.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2021-01-06 23:41:44,620 WARN L197 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 168 DAG size of output: 166 [2021-01-06 23:41:45,571 WARN L197 SmtUtils]: Spent 949.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2021-01-06 23:41:47,801 WARN L197 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 174 DAG size of output: 172 [2021-01-06 23:41:48,945 WARN L197 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 162 [2021-01-06 23:41:49,531 WARN L197 SmtUtils]: Spent 542.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2021-01-06 23:41:50,106 WARN L197 SmtUtils]: Spent 573.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2021-01-06 23:41:50,713 WARN L197 SmtUtils]: Spent 605.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2021-01-06 23:41:51,240 WARN L197 SmtUtils]: Spent 525.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2021-01-06 23:41:52,347 WARN L197 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 158 [2021-01-06 23:41:53,382 WARN L197 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 156 [2021-01-06 23:41:54,817 WARN L197 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 169 [2021-01-06 23:41:56,065 WARN L197 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 167 [2021-01-06 23:41:56,073 INFO L131 LiptonReduction]: Checked pairs total: 6790 [2021-01-06 23:41:56,073 INFO L133 LiptonReduction]: Total number of compositions: 187 [2021-01-06 23:41:56,083 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 38 transitions, 98 flow [2021-01-06 23:41:56,130 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 388 states. [2021-01-06 23:41:56,132 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states. [2021-01-06 23:41:56,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2021-01-06 23:41:56,141 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:41:56,142 INFO L422 BasicCegarLoop]: trace histogram [1] [2021-01-06 23:41:56,143 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:41:56,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:41:56,156 INFO L82 PathProgramCache]: Analyzing trace with hash 598, now seen corresponding path program 1 times [2021-01-06 23:41:56,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:41:56,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807038982] [2021-01-06 23:41:56,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:41:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:41:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:41:56,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807038982] [2021-01-06 23:41:56,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:41:56,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2021-01-06 23:41:56,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797228139] [2021-01-06 23:41:56,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 23:41:56,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:41:56,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 23:41:56,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 23:41:56,472 INFO L87 Difference]: Start difference. First operand 388 states. Second operand 2 states. [2021-01-06 23:41:56,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:41:56,510 INFO L93 Difference]: Finished difference Result 386 states and 932 transitions. [2021-01-06 23:41:56,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 23:41:56,512 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2021-01-06 23:41:56,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:41:56,542 INFO L225 Difference]: With dead ends: 386 [2021-01-06 23:41:56,542 INFO L226 Difference]: Without dead ends: 348 [2021-01-06 23:41:56,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 23:41:56,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-01-06 23:41:56,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2021-01-06 23:41:56,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2021-01-06 23:41:56,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 834 transitions. [2021-01-06 23:41:56,666 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 834 transitions. Word has length 1 [2021-01-06 23:41:56,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:41:56,666 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 834 transitions. [2021-01-06 23:41:56,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 23:41:56,666 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 834 transitions. [2021-01-06 23:41:56,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-01-06 23:41:56,667 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:41:56,667 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-01-06 23:41:56,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 23:41:56,668 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:41:56,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:41:56,673 INFO L82 PathProgramCache]: Analyzing trace with hash 567801538, now seen corresponding path program 1 times [2021-01-06 23:41:56,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:41:56,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639514088] [2021-01-06 23:41:56,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:41:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:41:56,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:41:56,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639514088] [2021-01-06 23:41:56,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:41:56,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 23:41:56,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62786999] [2021-01-06 23:41:56,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 23:41:56,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:41:56,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 23:41:56,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 23:41:56,968 INFO L87 Difference]: Start difference. First operand 348 states and 834 transitions. Second operand 3 states. [2021-01-06 23:41:57,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:41:57,080 INFO L93 Difference]: Finished difference Result 439 states and 1041 transitions. [2021-01-06 23:41:57,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 23:41:57,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2021-01-06 23:41:57,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:41:57,086 INFO L225 Difference]: With dead ends: 439 [2021-01-06 23:41:57,087 INFO L226 Difference]: Without dead ends: 439 [2021-01-06 23:41:57,087 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 [2021-01-06 23:41:57,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2021-01-06 23:41:57,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 407. [2021-01-06 23:41:57,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2021-01-06 23:41:57,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 989 transitions. [2021-01-06 23:41:57,106 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 989 transitions. Word has length 5 [2021-01-06 23:41:57,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:41:57,106 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 989 transitions. [2021-01-06 23:41:57,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 23:41:57,107 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 989 transitions. [2021-01-06 23:41:57,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-01-06 23:41:57,107 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:41:57,107 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-01-06 23:41:57,107 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 23:41:57,107 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:41:57,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:41:57,108 INFO L82 PathProgramCache]: Analyzing trace with hash 567801495, now seen corresponding path program 1 times [2021-01-06 23:41:57,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:41:57,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210102413] [2021-01-06 23:41:57,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:41:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:41:57,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:41:57,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210102413] [2021-01-06 23:41:57,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:41:57,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 23:41:57,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623553466] [2021-01-06 23:41:57,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 23:41:57,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:41:57,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 23:41:57,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 23:41:57,209 INFO L87 Difference]: Start difference. First operand 407 states and 989 transitions. Second operand 4 states. [2021-01-06 23:41:57,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:41:57,394 INFO L93 Difference]: Finished difference Result 530 states and 1280 transitions. [2021-01-06 23:41:57,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 23:41:57,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2021-01-06 23:41:57,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:41:57,399 INFO L225 Difference]: With dead ends: 530 [2021-01-06 23:41:57,399 INFO L226 Difference]: Without dead ends: 514 [2021-01-06 23:41:57,400 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:41:57,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-01-06 23:41:57,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2021-01-06 23:41:57,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2021-01-06 23:41:57,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1251 transitions. [2021-01-06 23:41:57,420 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1251 transitions. Word has length 5 [2021-01-06 23:41:57,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:41:57,420 INFO L481 AbstractCegarLoop]: Abstraction has 514 states and 1251 transitions. [2021-01-06 23:41:57,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 23:41:57,420 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1251 transitions. [2021-01-06 23:41:57,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-06 23:41:57,423 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:41:57,423 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:41:57,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 23:41:57,424 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:41:57,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:41:57,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1504204791, now seen corresponding path program 1 times [2021-01-06 23:41:57,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:41:57,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243520124] [2021-01-06 23:41:57,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:41:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:41:57,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:41:57,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243520124] [2021-01-06 23:41:57,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:41:57,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 23:41:57,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647712956] [2021-01-06 23:41:57,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 23:41:57,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:41:57,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 23:41:57,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 23:41:57,557 INFO L87 Difference]: Start difference. First operand 514 states and 1251 transitions. Second operand 3 states. [2021-01-06 23:41:57,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:41:57,587 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2021-01-06 23:41:57,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 23:41:57,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2021-01-06 23:41:57,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:41:57,589 INFO L225 Difference]: With dead ends: 162 [2021-01-06 23:41:57,589 INFO L226 Difference]: Without dead ends: 162 [2021-01-06 23:41:57,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 23:41:57,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-01-06 23:41:57,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2021-01-06 23:41:57,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2021-01-06 23:41:57,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2021-01-06 23:41:57,594 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 11 [2021-01-06 23:41:57,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:41:57,597 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2021-01-06 23:41:57,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 23:41:57,597 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2021-01-06 23:41:57,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:41:57,605 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:41:57,605 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, 1] [2021-01-06 23:41:57,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 23:41:57,606 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:41:57,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:41:57,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1468152719, now seen corresponding path program 1 times [2021-01-06 23:41:57,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:41:57,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129459325] [2021-01-06 23:41:57,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:41:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:41:58,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:41:58,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129459325] [2021-01-06 23:41:58,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:41:58,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:41:58,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409579547] [2021-01-06 23:41:58,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:41:58,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:41:58,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:41:58,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:41:58,513 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 16 states. [2021-01-06 23:41:59,427 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2021-01-06 23:41:59,737 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2021-01-06 23:42:00,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:00,285 INFO L93 Difference]: Finished difference Result 284 states and 582 transitions. [2021-01-06 23:42:00,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 23:42:00,286 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2021-01-06 23:42:00,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:00,288 INFO L225 Difference]: With dead ends: 284 [2021-01-06 23:42:00,288 INFO L226 Difference]: Without dead ends: 284 [2021-01-06 23:42:00,288 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2021-01-06 23:42:00,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-01-06 23:42:00,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 204. [2021-01-06 23:42:00,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2021-01-06 23:42:00,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 429 transitions. [2021-01-06 23:42:00,296 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 429 transitions. Word has length 22 [2021-01-06 23:42:00,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:00,296 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 429 transitions. [2021-01-06 23:42:00,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:42:00,297 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 429 transitions. [2021-01-06 23:42:00,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:00,298 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:00,298 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, 1] [2021-01-06 23:42:00,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 23:42:00,298 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:00,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:00,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1468152705, now seen corresponding path program 1 times [2021-01-06 23:42:00,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:00,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883332835] [2021-01-06 23:42:00,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:00,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:00,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883332835] [2021-01-06 23:42:00,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:00,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 23:42:00,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600569994] [2021-01-06 23:42:00,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 23:42:00,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:00,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 23:42:00,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-01-06 23:42:00,604 INFO L87 Difference]: Start difference. First operand 204 states and 429 transitions. Second operand 10 states. [2021-01-06 23:42:01,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:01,134 INFO L93 Difference]: Finished difference Result 300 states and 598 transitions. [2021-01-06 23:42:01,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 23:42:01,136 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2021-01-06 23:42:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:01,138 INFO L225 Difference]: With dead ends: 300 [2021-01-06 23:42:01,138 INFO L226 Difference]: Without dead ends: 274 [2021-01-06 23:42:01,138 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-01-06 23:42:01,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-01-06 23:42:01,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 222. [2021-01-06 23:42:01,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2021-01-06 23:42:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 463 transitions. [2021-01-06 23:42:01,159 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 463 transitions. Word has length 22 [2021-01-06 23:42:01,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:01,160 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 463 transitions. [2021-01-06 23:42:01,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 23:42:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 463 transitions. [2021-01-06 23:42:01,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:01,161 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:01,161 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, 1] [2021-01-06 23:42:01,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 23:42:01,161 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:01,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:01,162 INFO L82 PathProgramCache]: Analyzing trace with hash 2031623019, now seen corresponding path program 2 times [2021-01-06 23:42:01,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:01,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933451340] [2021-01-06 23:42:01,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:01,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:01,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933451340] [2021-01-06 23:42:01,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:01,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:42:01,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214174673] [2021-01-06 23:42:01,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:42:01,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:01,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:42:01,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:42:01,974 INFO L87 Difference]: Start difference. First operand 222 states and 463 transitions. Second operand 16 states. [2021-01-06 23:42:03,029 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2021-01-06 23:42:03,319 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2021-01-06 23:42:03,596 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2021-01-06 23:42:03,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:03,967 INFO L93 Difference]: Finished difference Result 347 states and 688 transitions. [2021-01-06 23:42:03,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 23:42:03,968 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2021-01-06 23:42:03,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:03,970 INFO L225 Difference]: With dead ends: 347 [2021-01-06 23:42:03,970 INFO L226 Difference]: Without dead ends: 320 [2021-01-06 23:42:03,971 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2021-01-06 23:42:03,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-01-06 23:42:03,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 218. [2021-01-06 23:42:03,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2021-01-06 23:42:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 453 transitions. [2021-01-06 23:42:03,979 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 453 transitions. Word has length 22 [2021-01-06 23:42:03,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:03,979 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 453 transitions. [2021-01-06 23:42:03,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:42:03,980 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 453 transitions. [2021-01-06 23:42:03,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:03,980 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:03,981 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, 1] [2021-01-06 23:42:03,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 23:42:03,981 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:03,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:03,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1003175831, now seen corresponding path program 3 times [2021-01-06 23:42:03,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:03,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862278621] [2021-01-06 23:42:03,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:04,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:04,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862278621] [2021-01-06 23:42:04,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:04,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:42:04,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046987538] [2021-01-06 23:42:04,790 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:42:04,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:04,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:42:04,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:42:04,791 INFO L87 Difference]: Start difference. First operand 218 states and 453 transitions. Second operand 16 states. [2021-01-06 23:42:05,699 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2021-01-06 23:42:05,992 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2021-01-06 23:42:06,292 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2021-01-06 23:42:06,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:06,592 INFO L93 Difference]: Finished difference Result 342 states and 676 transitions. [2021-01-06 23:42:06,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 23:42:06,592 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2021-01-06 23:42:06,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:06,596 INFO L225 Difference]: With dead ends: 342 [2021-01-06 23:42:06,596 INFO L226 Difference]: Without dead ends: 310 [2021-01-06 23:42:06,597 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2021-01-06 23:42:06,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-01-06 23:42:06,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 247. [2021-01-06 23:42:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2021-01-06 23:42:06,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 496 transitions. [2021-01-06 23:42:06,605 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 496 transitions. Word has length 22 [2021-01-06 23:42:06,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:06,605 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 496 transitions. [2021-01-06 23:42:06,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:42:06,605 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 496 transitions. [2021-01-06 23:42:06,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:06,606 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:06,606 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, 1] [2021-01-06 23:42:06,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 23:42:06,607 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:06,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:06,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1627906499, now seen corresponding path program 2 times [2021-01-06 23:42:06,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:06,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857383942] [2021-01-06 23:42:06,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:06,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:06,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857383942] [2021-01-06 23:42:06,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:06,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 23:42:06,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192553341] [2021-01-06 23:42:06,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 23:42:06,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:06,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 23:42:06,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-01-06 23:42:06,882 INFO L87 Difference]: Start difference. First operand 247 states and 496 transitions. Second operand 10 states. [2021-01-06 23:42:07,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:07,448 INFO L93 Difference]: Finished difference Result 365 states and 691 transitions. [2021-01-06 23:42:07,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 23:42:07,448 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2021-01-06 23:42:07,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:07,450 INFO L225 Difference]: With dead ends: 365 [2021-01-06 23:42:07,451 INFO L226 Difference]: Without dead ends: 328 [2021-01-06 23:42:07,451 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:42:07,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-01-06 23:42:07,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 219. [2021-01-06 23:42:07,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2021-01-06 23:42:07,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 450 transitions. [2021-01-06 23:42:07,459 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 450 transitions. Word has length 22 [2021-01-06 23:42:07,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:07,459 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 450 transitions. [2021-01-06 23:42:07,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 23:42:07,459 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 450 transitions. [2021-01-06 23:42:07,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:07,460 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:07,460 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, 1] [2021-01-06 23:42:07,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 23:42:07,461 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:07,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:07,461 INFO L82 PathProgramCache]: Analyzing trace with hash 298127593, now seen corresponding path program 4 times [2021-01-06 23:42:07,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:07,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387044421] [2021-01-06 23:42:07,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:08,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:08,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387044421] [2021-01-06 23:42:08,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:08,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:42:08,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565017143] [2021-01-06 23:42:08,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:42:08,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:08,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:42:08,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:42:08,235 INFO L87 Difference]: Start difference. First operand 219 states and 450 transitions. Second operand 16 states. [2021-01-06 23:42:09,400 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2021-01-06 23:42:09,686 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2021-01-06 23:42:09,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:09,966 INFO L93 Difference]: Finished difference Result 308 states and 615 transitions. [2021-01-06 23:42:09,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 23:42:09,967 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2021-01-06 23:42:09,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:09,969 INFO L225 Difference]: With dead ends: 308 [2021-01-06 23:42:09,969 INFO L226 Difference]: Without dead ends: 308 [2021-01-06 23:42:09,970 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2021-01-06 23:42:09,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-01-06 23:42:09,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 257. [2021-01-06 23:42:09,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2021-01-06 23:42:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 512 transitions. [2021-01-06 23:42:09,979 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 512 transitions. Word has length 22 [2021-01-06 23:42:09,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:09,980 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 512 transitions. [2021-01-06 23:42:09,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:42:09,980 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 512 transitions. [2021-01-06 23:42:09,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:09,981 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:09,981 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, 1] [2021-01-06 23:42:09,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 23:42:09,982 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:09,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:09,982 INFO L82 PathProgramCache]: Analyzing trace with hash 298127579, now seen corresponding path program 3 times [2021-01-06 23:42:09,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:09,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317731364] [2021-01-06 23:42:09,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:10,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:10,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317731364] [2021-01-06 23:42:10,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:10,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 23:42:10,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663368295] [2021-01-06 23:42:10,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 23:42:10,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:10,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 23:42:10,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-01-06 23:42:10,235 INFO L87 Difference]: Start difference. First operand 257 states and 512 transitions. Second operand 10 states. [2021-01-06 23:42:10,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:10,777 INFO L93 Difference]: Finished difference Result 341 states and 652 transitions. [2021-01-06 23:42:10,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 23:42:10,777 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2021-01-06 23:42:10,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:10,779 INFO L225 Difference]: With dead ends: 341 [2021-01-06 23:42:10,780 INFO L226 Difference]: Without dead ends: 295 [2021-01-06 23:42:10,780 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:42:10,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-01-06 23:42:10,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 202. [2021-01-06 23:42:10,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2021-01-06 23:42:10,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 419 transitions. [2021-01-06 23:42:10,786 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 419 transitions. Word has length 22 [2021-01-06 23:42:10,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:10,786 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 419 transitions. [2021-01-06 23:42:10,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 23:42:10,787 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 419 transitions. [2021-01-06 23:42:10,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:10,787 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:10,788 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, 1] [2021-01-06 23:42:10,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 23:42:10,788 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:10,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:10,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1804694577, now seen corresponding path program 5 times [2021-01-06 23:42:10,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:10,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100453360] [2021-01-06 23:42:10,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:11,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:11,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100453360] [2021-01-06 23:42:11,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:11,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:42:11,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054526412] [2021-01-06 23:42:11,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:42:11,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:11,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:42:11,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:42:11,393 INFO L87 Difference]: Start difference. First operand 202 states and 419 transitions. Second operand 15 states. [2021-01-06 23:42:12,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:12,806 INFO L93 Difference]: Finished difference Result 351 states and 718 transitions. [2021-01-06 23:42:12,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 23:42:12,807 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2021-01-06 23:42:12,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:12,810 INFO L225 Difference]: With dead ends: 351 [2021-01-06 23:42:12,810 INFO L226 Difference]: Without dead ends: 325 [2021-01-06 23:42:12,811 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2021-01-06 23:42:12,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-01-06 23:42:12,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 221. [2021-01-06 23:42:12,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2021-01-06 23:42:12,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 462 transitions. [2021-01-06 23:42:12,819 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 462 transitions. Word has length 22 [2021-01-06 23:42:12,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:12,819 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 462 transitions. [2021-01-06 23:42:12,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:42:12,819 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 462 transitions. [2021-01-06 23:42:12,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:12,821 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:12,821 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, 1] [2021-01-06 23:42:12,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 23:42:12,821 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:12,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:12,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1241224277, now seen corresponding path program 6 times [2021-01-06 23:42:12,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:12,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430792257] [2021-01-06 23:42:12,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:13,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:13,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430792257] [2021-01-06 23:42:13,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:13,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:42:13,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127882046] [2021-01-06 23:42:13,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:42:13,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:13,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:42:13,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:42:13,440 INFO L87 Difference]: Start difference. First operand 221 states and 462 transitions. Second operand 15 states. [2021-01-06 23:42:14,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:14,859 INFO L93 Difference]: Finished difference Result 348 states and 707 transitions. [2021-01-06 23:42:14,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 23:42:14,860 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2021-01-06 23:42:14,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:14,863 INFO L225 Difference]: With dead ends: 348 [2021-01-06 23:42:14,864 INFO L226 Difference]: Without dead ends: 321 [2021-01-06 23:42:14,864 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2021-01-06 23:42:14,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2021-01-06 23:42:14,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 217. [2021-01-06 23:42:14,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2021-01-06 23:42:14,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 452 transitions. [2021-01-06 23:42:14,873 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 452 transitions. Word has length 22 [2021-01-06 23:42:14,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:14,873 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 452 transitions. [2021-01-06 23:42:14,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:42:14,874 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 452 transitions. [2021-01-06 23:42:14,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:14,875 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:14,875 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, 1] [2021-01-06 23:42:14,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 23:42:14,875 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:14,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:14,875 INFO L82 PathProgramCache]: Analyzing trace with hash 2025295831, now seen corresponding path program 7 times [2021-01-06 23:42:14,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:14,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369373194] [2021-01-06 23:42:14,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:15,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369373194] [2021-01-06 23:42:15,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:15,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:42:15,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140939739] [2021-01-06 23:42:15,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:42:15,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:15,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:42:15,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:42:15,474 INFO L87 Difference]: Start difference. First operand 217 states and 452 transitions. Second operand 15 states. [2021-01-06 23:42:16,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:16,817 INFO L93 Difference]: Finished difference Result 337 states and 689 transitions. [2021-01-06 23:42:16,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 23:42:16,817 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2021-01-06 23:42:16,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:16,821 INFO L225 Difference]: With dead ends: 337 [2021-01-06 23:42:16,821 INFO L226 Difference]: Without dead ends: 296 [2021-01-06 23:42:16,822 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2021-01-06 23:42:16,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-01-06 23:42:16,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 209. [2021-01-06 23:42:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2021-01-06 23:42:16,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 432 transitions. [2021-01-06 23:42:16,830 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 432 transitions. Word has length 22 [2021-01-06 23:42:16,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:16,830 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 432 transitions. [2021-01-06 23:42:16,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:42:16,830 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 432 transitions. [2021-01-06 23:42:16,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:16,831 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:16,831 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, 1] [2021-01-06 23:42:16,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 23:42:16,832 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:16,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:16,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1320247593, now seen corresponding path program 8 times [2021-01-06 23:42:16,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:16,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917840058] [2021-01-06 23:42:16,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:17,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:17,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917840058] [2021-01-06 23:42:17,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:17,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:42:17,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892370291] [2021-01-06 23:42:17,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:42:17,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:17,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:42:17,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:42:17,552 INFO L87 Difference]: Start difference. First operand 209 states and 432 transitions. Second operand 15 states. [2021-01-06 23:42:18,718 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2021-01-06 23:42:18,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:18,963 INFO L93 Difference]: Finished difference Result 370 states and 732 transitions. [2021-01-06 23:42:18,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 23:42:18,964 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2021-01-06 23:42:18,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:18,966 INFO L225 Difference]: With dead ends: 370 [2021-01-06 23:42:18,966 INFO L226 Difference]: Without dead ends: 328 [2021-01-06 23:42:18,967 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2021-01-06 23:42:18,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-01-06 23:42:18,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 205. [2021-01-06 23:42:18,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2021-01-06 23:42:18,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 424 transitions. [2021-01-06 23:42:18,974 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 424 transitions. Word has length 22 [2021-01-06 23:42:18,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:18,974 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 424 transitions. [2021-01-06 23:42:18,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:42:18,975 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 424 transitions. [2021-01-06 23:42:18,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:18,975 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:18,975 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, 1] [2021-01-06 23:42:18,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 23:42:18,976 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:18,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:18,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1368328049, now seen corresponding path program 9 times [2021-01-06 23:42:18,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:18,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658195827] [2021-01-06 23:42:18,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:19,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:19,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658195827] [2021-01-06 23:42:19,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:19,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 23:42:19,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554725501] [2021-01-06 23:42:19,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 23:42:19,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:19,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 23:42:19,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-06 23:42:19,211 INFO L87 Difference]: Start difference. First operand 205 states and 424 transitions. Second operand 7 states. [2021-01-06 23:42:19,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:19,565 INFO L93 Difference]: Finished difference Result 241 states and 486 transitions. [2021-01-06 23:42:19,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 23:42:19,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2021-01-06 23:42:19,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:19,568 INFO L225 Difference]: With dead ends: 241 [2021-01-06 23:42:19,568 INFO L226 Difference]: Without dead ends: 241 [2021-01-06 23:42:19,568 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-01-06 23:42:19,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-01-06 23:42:19,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 217. [2021-01-06 23:42:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2021-01-06 23:42:19,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 442 transitions. [2021-01-06 23:42:19,577 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 442 transitions. Word has length 22 [2021-01-06 23:42:19,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:19,578 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 442 transitions. [2021-01-06 23:42:19,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 23:42:19,579 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 442 transitions. [2021-01-06 23:42:19,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:19,579 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:19,580 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, 1] [2021-01-06 23:42:19,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 23:42:19,580 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:19,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:19,580 INFO L82 PathProgramCache]: Analyzing trace with hash 874605097, now seen corresponding path program 10 times [2021-01-06 23:42:19,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:19,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265422774] [2021-01-06 23:42:19,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:20,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:20,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265422774] [2021-01-06 23:42:20,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:20,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:42:20,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617770121] [2021-01-06 23:42:20,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:42:20,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:20,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:42:20,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:42:20,280 INFO L87 Difference]: Start difference. First operand 217 states and 442 transitions. Second operand 15 states. [2021-01-06 23:42:21,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:21,373 INFO L93 Difference]: Finished difference Result 248 states and 488 transitions. [2021-01-06 23:42:21,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 23:42:21,374 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2021-01-06 23:42:21,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:21,378 INFO L225 Difference]: With dead ends: 248 [2021-01-06 23:42:21,378 INFO L226 Difference]: Without dead ends: 213 [2021-01-06 23:42:21,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2021-01-06 23:42:21,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-01-06 23:42:21,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2021-01-06 23:42:21,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2021-01-06 23:42:21,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 437 transitions. [2021-01-06 23:42:21,388 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 437 transitions. Word has length 22 [2021-01-06 23:42:21,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:21,388 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 437 transitions. [2021-01-06 23:42:21,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:42:21,388 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 437 transitions. [2021-01-06 23:42:21,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:21,389 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:21,389 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, 1] [2021-01-06 23:42:21,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 23:42:21,390 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:21,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:21,390 INFO L82 PathProgramCache]: Analyzing trace with hash -129502719, now seen corresponding path program 11 times [2021-01-06 23:42:21,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:21,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034593365] [2021-01-06 23:42:21,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:21,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:21,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034593365] [2021-01-06 23:42:21,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:21,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:42:21,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009935825] [2021-01-06 23:42:21,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:42:21,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:21,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:42:21,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:42:21,987 INFO L87 Difference]: Start difference. First operand 213 states and 437 transitions. Second operand 15 states. [2021-01-06 23:42:23,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:23,377 INFO L93 Difference]: Finished difference Result 281 states and 556 transitions. [2021-01-06 23:42:23,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 23:42:23,377 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2021-01-06 23:42:23,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:23,379 INFO L225 Difference]: With dead ends: 281 [2021-01-06 23:42:23,379 INFO L226 Difference]: Without dead ends: 264 [2021-01-06 23:42:23,380 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2021-01-06 23:42:23,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-01-06 23:42:23,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 225. [2021-01-06 23:42:23,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2021-01-06 23:42:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 459 transitions. [2021-01-06 23:42:23,387 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 459 transitions. Word has length 22 [2021-01-06 23:42:23,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:23,387 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 459 transitions. [2021-01-06 23:42:23,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:42:23,388 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 459 transitions. [2021-01-06 23:42:23,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:23,388 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:23,388 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, 1] [2021-01-06 23:42:23,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 23:42:23,389 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:23,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:23,399 INFO L82 PathProgramCache]: Analyzing trace with hash 433967581, now seen corresponding path program 12 times [2021-01-06 23:42:23,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:23,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133633922] [2021-01-06 23:42:23,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:24,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:24,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133633922] [2021-01-06 23:42:24,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:24,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:42:24,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235883442] [2021-01-06 23:42:24,121 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:42:24,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:24,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:42:24,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:42:24,122 INFO L87 Difference]: Start difference. First operand 225 states and 459 transitions. Second operand 15 states. [2021-01-06 23:42:24,846 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2021-01-06 23:42:25,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:25,740 INFO L93 Difference]: Finished difference Result 281 states and 555 transitions. [2021-01-06 23:42:25,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 23:42:25,741 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2021-01-06 23:42:25,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:25,743 INFO L225 Difference]: With dead ends: 281 [2021-01-06 23:42:25,743 INFO L226 Difference]: Without dead ends: 262 [2021-01-06 23:42:25,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2021-01-06 23:42:25,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-01-06 23:42:25,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 223. [2021-01-06 23:42:25,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2021-01-06 23:42:25,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 455 transitions. [2021-01-06 23:42:25,750 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 455 transitions. Word has length 22 [2021-01-06 23:42:25,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:25,751 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 455 transitions. [2021-01-06 23:42:25,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:42:25,751 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 455 transitions. [2021-01-06 23:42:25,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:25,752 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:25,752 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, 1] [2021-01-06 23:42:25,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 23:42:25,752 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:25,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:25,753 INFO L82 PathProgramCache]: Analyzing trace with hash -594479607, now seen corresponding path program 13 times [2021-01-06 23:42:25,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:25,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357284156] [2021-01-06 23:42:25,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:26,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:26,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357284156] [2021-01-06 23:42:26,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:26,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:42:26,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669663988] [2021-01-06 23:42:26,400 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:42:26,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:26,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:42:26,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:42:26,401 INFO L87 Difference]: Start difference. First operand 223 states and 455 transitions. Second operand 15 states. [2021-01-06 23:42:27,068 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2021-01-06 23:42:27,583 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2021-01-06 23:42:27,792 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2021-01-06 23:42:28,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:28,071 INFO L93 Difference]: Finished difference Result 273 states and 545 transitions. [2021-01-06 23:42:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 23:42:28,072 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2021-01-06 23:42:28,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:28,073 INFO L225 Difference]: With dead ends: 273 [2021-01-06 23:42:28,073 INFO L226 Difference]: Without dead ends: 244 [2021-01-06 23:42:28,074 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2021-01-06 23:42:28,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-01-06 23:42:28,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 219. [2021-01-06 23:42:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2021-01-06 23:42:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 447 transitions. [2021-01-06 23:42:28,080 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 447 transitions. Word has length 22 [2021-01-06 23:42:28,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:28,080 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 447 transitions. [2021-01-06 23:42:28,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:42:28,081 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 447 transitions. [2021-01-06 23:42:28,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:28,081 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:28,081 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, 1] [2021-01-06 23:42:28,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 23:42:28,082 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:28,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:28,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1299527845, now seen corresponding path program 14 times [2021-01-06 23:42:28,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:28,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290259483] [2021-01-06 23:42:28,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:28,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290259483] [2021-01-06 23:42:28,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:28,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:42:28,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432747776] [2021-01-06 23:42:28,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:42:28,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:28,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:42:28,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:42:28,837 INFO L87 Difference]: Start difference. First operand 219 states and 447 transitions. Second operand 15 states. [2021-01-06 23:42:29,475 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2021-01-06 23:42:30,107 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2021-01-06 23:42:30,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:30,336 INFO L93 Difference]: Finished difference Result 274 states and 545 transitions. [2021-01-06 23:42:30,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 23:42:30,337 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2021-01-06 23:42:30,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:30,339 INFO L225 Difference]: With dead ends: 274 [2021-01-06 23:42:30,339 INFO L226 Difference]: Without dead ends: 240 [2021-01-06 23:42:30,340 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2021-01-06 23:42:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-01-06 23:42:30,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 215. [2021-01-06 23:42:30,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2021-01-06 23:42:30,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 439 transitions. [2021-01-06 23:42:30,346 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 439 transitions. Word has length 22 [2021-01-06 23:42:30,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:30,346 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 439 transitions. [2021-01-06 23:42:30,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:42:30,346 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 439 transitions. [2021-01-06 23:42:30,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:30,347 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:30,347 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, 1] [2021-01-06 23:42:30,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 23:42:30,347 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:30,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:30,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1745170341, now seen corresponding path program 15 times [2021-01-06 23:42:30,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:30,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262137605] [2021-01-06 23:42:30,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:31,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:31,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262137605] [2021-01-06 23:42:31,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:31,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:42:31,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307571182] [2021-01-06 23:42:31,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:42:31,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:31,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:42:31,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:42:31,086 INFO L87 Difference]: Start difference. First operand 215 states and 439 transitions. Second operand 15 states. [2021-01-06 23:42:31,729 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2021-01-06 23:42:31,965 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2021-01-06 23:42:32,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:32,555 INFO L93 Difference]: Finished difference Result 261 states and 520 transitions. [2021-01-06 23:42:32,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 23:42:32,556 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2021-01-06 23:42:32,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:32,558 INFO L225 Difference]: With dead ends: 261 [2021-01-06 23:42:32,558 INFO L226 Difference]: Without dead ends: 227 [2021-01-06 23:42:32,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2021-01-06 23:42:32,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-01-06 23:42:32,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 212. [2021-01-06 23:42:32,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2021-01-06 23:42:32,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 435 transitions. [2021-01-06 23:42:32,565 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 435 transitions. Word has length 22 [2021-01-06 23:42:32,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:32,565 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 435 transitions. [2021-01-06 23:42:32,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:42:32,565 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 435 transitions. [2021-01-06 23:42:32,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:32,566 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:32,566 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, 1] [2021-01-06 23:42:32,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 23:42:32,566 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:32,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:32,567 INFO L82 PathProgramCache]: Analyzing trace with hash -210766577, now seen corresponding path program 16 times [2021-01-06 23:42:32,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:32,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499014855] [2021-01-06 23:42:32,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:33,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:33,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499014855] [2021-01-06 23:42:33,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:33,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:42:33,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187452116] [2021-01-06 23:42:33,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:42:33,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:33,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:42:33,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:42:33,210 INFO L87 Difference]: Start difference. First operand 212 states and 435 transitions. Second operand 15 states. [2021-01-06 23:42:33,879 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2021-01-06 23:42:34,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:34,699 INFO L93 Difference]: Finished difference Result 259 states and 509 transitions. [2021-01-06 23:42:34,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 23:42:34,699 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2021-01-06 23:42:34,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:34,701 INFO L225 Difference]: With dead ends: 259 [2021-01-06 23:42:34,701 INFO L226 Difference]: Without dead ends: 242 [2021-01-06 23:42:34,702 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2021-01-06 23:42:34,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-01-06 23:42:34,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 220. [2021-01-06 23:42:34,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2021-01-06 23:42:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 449 transitions. [2021-01-06 23:42:34,708 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 449 transitions. Word has length 22 [2021-01-06 23:42:34,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:34,709 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 449 transitions. [2021-01-06 23:42:34,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:42:34,709 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 449 transitions. [2021-01-06 23:42:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:34,710 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:34,710 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, 1] [2021-01-06 23:42:34,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 23:42:34,710 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:34,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:34,710 INFO L82 PathProgramCache]: Analyzing trace with hash 352703723, now seen corresponding path program 17 times [2021-01-06 23:42:34,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:34,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536874641] [2021-01-06 23:42:34,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:35,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:35,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536874641] [2021-01-06 23:42:35,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:35,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:42:35,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396705862] [2021-01-06 23:42:35,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:42:35,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:35,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:42:35,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:42:35,391 INFO L87 Difference]: Start difference. First operand 220 states and 449 transitions. Second operand 15 states. [2021-01-06 23:42:36,066 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2021-01-06 23:42:36,634 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2021-01-06 23:42:36,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:36,901 INFO L93 Difference]: Finished difference Result 259 states and 508 transitions. [2021-01-06 23:42:36,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 23:42:36,902 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2021-01-06 23:42:36,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:36,904 INFO L225 Difference]: With dead ends: 259 [2021-01-06 23:42:36,905 INFO L226 Difference]: Without dead ends: 240 [2021-01-06 23:42:36,905 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2021-01-06 23:42:36,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-01-06 23:42:36,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 218. [2021-01-06 23:42:36,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2021-01-06 23:42:36,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 445 transitions. [2021-01-06 23:42:36,912 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 445 transitions. Word has length 22 [2021-01-06 23:42:36,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:36,912 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 445 transitions. [2021-01-06 23:42:36,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:42:36,912 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 445 transitions. [2021-01-06 23:42:36,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:36,913 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:36,913 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, 1] [2021-01-06 23:42:36,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 23:42:36,913 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:36,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:36,914 INFO L82 PathProgramCache]: Analyzing trace with hash -675743465, now seen corresponding path program 18 times [2021-01-06 23:42:36,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:36,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262527588] [2021-01-06 23:42:36,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:37,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262527588] [2021-01-06 23:42:37,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:37,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:42:37,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677232506] [2021-01-06 23:42:37,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:42:37,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:37,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:42:37,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:42:37,585 INFO L87 Difference]: Start difference. First operand 218 states and 445 transitions. Second operand 15 states. [2021-01-06 23:42:38,227 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2021-01-06 23:42:38,634 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2021-01-06 23:42:38,813 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2021-01-06 23:42:39,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:39,020 INFO L93 Difference]: Finished difference Result 251 states and 498 transitions. [2021-01-06 23:42:39,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 23:42:39,021 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2021-01-06 23:42:39,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:39,022 INFO L225 Difference]: With dead ends: 251 [2021-01-06 23:42:39,022 INFO L226 Difference]: Without dead ends: 222 [2021-01-06 23:42:39,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2021-01-06 23:42:39,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-01-06 23:42:39,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 214. [2021-01-06 23:42:39,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2021-01-06 23:42:39,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 437 transitions. [2021-01-06 23:42:39,029 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 437 transitions. Word has length 22 [2021-01-06 23:42:39,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:39,030 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 437 transitions. [2021-01-06 23:42:39,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:42:39,030 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 437 transitions. [2021-01-06 23:42:39,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:39,031 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:39,031 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, 1] [2021-01-06 23:42:39,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 23:42:39,031 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:39,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:39,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1380791703, now seen corresponding path program 19 times [2021-01-06 23:42:39,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:39,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747829647] [2021-01-06 23:42:39,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:39,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747829647] [2021-01-06 23:42:39,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:39,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:42:39,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324673211] [2021-01-06 23:42:39,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:42:39,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:39,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:42:39,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:42:39,795 INFO L87 Difference]: Start difference. First operand 214 states and 437 transitions. Second operand 15 states. [2021-01-06 23:42:40,334 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2021-01-06 23:42:40,555 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2021-01-06 23:42:40,946 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2021-01-06 23:42:41,142 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2021-01-06 23:42:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:41,369 INFO L93 Difference]: Finished difference Result 252 states and 498 transitions. [2021-01-06 23:42:41,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 23:42:41,372 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2021-01-06 23:42:41,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:41,373 INFO L225 Difference]: With dead ends: 252 [2021-01-06 23:42:41,373 INFO L226 Difference]: Without dead ends: 218 [2021-01-06 23:42:41,374 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2021-01-06 23:42:41,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-01-06 23:42:41,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2021-01-06 23:42:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2021-01-06 23:42:41,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 429 transitions. [2021-01-06 23:42:41,379 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 429 transitions. Word has length 22 [2021-01-06 23:42:41,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:41,380 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 429 transitions. [2021-01-06 23:42:41,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:42:41,380 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 429 transitions. [2021-01-06 23:42:41,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:41,381 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:41,381 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, 1] [2021-01-06 23:42:41,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 23:42:41,381 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:41,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:41,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1826434199, now seen corresponding path program 20 times [2021-01-06 23:42:41,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:41,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576713469] [2021-01-06 23:42:41,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:42,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:42,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576713469] [2021-01-06 23:42:42,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:42,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:42:42,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138361353] [2021-01-06 23:42:42,114 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:42:42,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:42,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:42:42,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:42:42,115 INFO L87 Difference]: Start difference. First operand 210 states and 429 transitions. Second operand 15 states. [2021-01-06 23:42:42,860 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2021-01-06 23:42:43,113 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2021-01-06 23:42:43,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:43,647 INFO L93 Difference]: Finished difference Result 241 states and 475 transitions. [2021-01-06 23:42:43,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 23:42:43,648 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2021-01-06 23:42:43,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:43,650 INFO L225 Difference]: With dead ends: 241 [2021-01-06 23:42:43,650 INFO L226 Difference]: Without dead ends: 208 [2021-01-06 23:42:43,651 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2021-01-06 23:42:43,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-01-06 23:42:43,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2021-01-06 23:42:43,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2021-01-06 23:42:43,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 425 transitions. [2021-01-06 23:42:43,658 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 425 transitions. Word has length 22 [2021-01-06 23:42:43,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:43,658 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 425 transitions. [2021-01-06 23:42:43,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:42:43,658 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 425 transitions. [2021-01-06 23:42:43,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:43,659 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:43,659 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, 1] [2021-01-06 23:42:43,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 23:42:43,659 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:43,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:43,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1246935151, now seen corresponding path program 21 times [2021-01-06 23:42:43,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:43,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031064837] [2021-01-06 23:42:43,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:44,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:44,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031064837] [2021-01-06 23:42:44,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:44,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:42:44,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289931768] [2021-01-06 23:42:44,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:42:44,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:44,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:42:44,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:42:44,506 INFO L87 Difference]: Start difference. First operand 208 states and 425 transitions. Second operand 15 states. [2021-01-06 23:42:44,978 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2021-01-06 23:42:45,205 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2021-01-06 23:42:45,461 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2021-01-06 23:42:45,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:45,974 INFO L93 Difference]: Finished difference Result 237 states and 469 transitions. [2021-01-06 23:42:45,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 23:42:45,975 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2021-01-06 23:42:45,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:45,976 INFO L225 Difference]: With dead ends: 237 [2021-01-06 23:42:45,976 INFO L226 Difference]: Without dead ends: 196 [2021-01-06 23:42:45,977 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2021-01-06 23:42:45,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-01-06 23:42:45,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2021-01-06 23:42:45,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2021-01-06 23:42:45,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 407 transitions. [2021-01-06 23:42:45,983 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 407 transitions. Word has length 22 [2021-01-06 23:42:45,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:45,984 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 407 transitions. [2021-01-06 23:42:45,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:42:45,984 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 407 transitions. [2021-01-06 23:42:45,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:45,985 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:45,985 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, 1] [2021-01-06 23:42:45,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 23:42:45,985 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:45,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:45,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1692787087, now seen corresponding path program 22 times [2021-01-06 23:42:45,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:45,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353887042] [2021-01-06 23:42:45,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:46,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:46,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353887042] [2021-01-06 23:42:46,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:46,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:42:46,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083756094] [2021-01-06 23:42:46,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:42:46,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:46,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:42:46,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:42:46,776 INFO L87 Difference]: Start difference. First operand 196 states and 407 transitions. Second operand 16 states. [2021-01-06 23:42:48,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:48,591 INFO L93 Difference]: Finished difference Result 310 states and 625 transitions. [2021-01-06 23:42:48,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 23:42:48,592 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2021-01-06 23:42:48,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:48,594 INFO L225 Difference]: With dead ends: 310 [2021-01-06 23:42:48,594 INFO L226 Difference]: Without dead ends: 284 [2021-01-06 23:42:48,595 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2021-01-06 23:42:48,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-01-06 23:42:48,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 208. [2021-01-06 23:42:48,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2021-01-06 23:42:48,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 433 transitions. [2021-01-06 23:42:48,601 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 433 transitions. Word has length 22 [2021-01-06 23:42:48,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:48,601 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 433 transitions. [2021-01-06 23:42:48,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:42:48,602 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 433 transitions. [2021-01-06 23:42:48,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:48,602 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:48,603 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, 1] [2021-01-06 23:42:48,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 23:42:48,603 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:48,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:48,603 INFO L82 PathProgramCache]: Analyzing trace with hash -2038709909, now seen corresponding path program 23 times [2021-01-06 23:42:48,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:48,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068705284] [2021-01-06 23:42:48,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:49,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:49,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068705284] [2021-01-06 23:42:49,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:49,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:42:49,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960234794] [2021-01-06 23:42:49,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:42:49,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:49,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:42:49,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:42:49,397 INFO L87 Difference]: Start difference. First operand 208 states and 433 transitions. Second operand 16 states. [2021-01-06 23:42:51,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:51,156 INFO L93 Difference]: Finished difference Result 307 states and 614 transitions. [2021-01-06 23:42:51,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 23:42:51,157 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2021-01-06 23:42:51,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:51,159 INFO L225 Difference]: With dead ends: 307 [2021-01-06 23:42:51,159 INFO L226 Difference]: Without dead ends: 280 [2021-01-06 23:42:51,160 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2021-01-06 23:42:51,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-01-06 23:42:51,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 204. [2021-01-06 23:42:51,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2021-01-06 23:42:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 423 transitions. [2021-01-06 23:42:51,174 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 423 transitions. Word has length 22 [2021-01-06 23:42:51,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:51,174 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 423 transitions. [2021-01-06 23:42:51,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:42:51,174 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 423 transitions. [2021-01-06 23:42:51,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:51,175 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:51,175 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, 1] [2021-01-06 23:42:51,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 23:42:51,175 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:51,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:51,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1227810199, now seen corresponding path program 24 times [2021-01-06 23:42:51,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:51,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834909948] [2021-01-06 23:42:51,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:51,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:51,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834909948] [2021-01-06 23:42:51,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:51,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:42:51,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657246085] [2021-01-06 23:42:51,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:42:51,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:51,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:42:51,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:42:51,907 INFO L87 Difference]: Start difference. First operand 204 states and 423 transitions. Second operand 16 states. [2021-01-06 23:42:52,545 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2021-01-06 23:42:53,281 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2021-01-06 23:42:53,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:53,614 INFO L93 Difference]: Finished difference Result 296 states and 596 transitions. [2021-01-06 23:42:53,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 23:42:53,615 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2021-01-06 23:42:53,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:53,617 INFO L225 Difference]: With dead ends: 296 [2021-01-06 23:42:53,617 INFO L226 Difference]: Without dead ends: 255 [2021-01-06 23:42:53,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2021-01-06 23:42:53,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-01-06 23:42:53,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 196. [2021-01-06 23:42:53,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2021-01-06 23:42:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 403 transitions. [2021-01-06 23:42:53,623 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 403 transitions. Word has length 22 [2021-01-06 23:42:53,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:53,623 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 403 transitions. [2021-01-06 23:42:53,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:42:53,624 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 403 transitions. [2021-01-06 23:42:53,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:53,624 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:53,625 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, 1] [2021-01-06 23:42:53,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 23:42:53,625 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:53,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:53,625 INFO L82 PathProgramCache]: Analyzing trace with hash 522761961, now seen corresponding path program 25 times [2021-01-06 23:42:53,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:53,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874186861] [2021-01-06 23:42:53,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:54,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:54,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874186861] [2021-01-06 23:42:54,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:54,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:42:54,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076891024] [2021-01-06 23:42:54,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:42:54,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:54,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:42:54,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:42:54,302 INFO L87 Difference]: Start difference. First operand 196 states and 403 transitions. Second operand 16 states. [2021-01-06 23:42:54,976 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2021-01-06 23:42:55,696 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2021-01-06 23:42:56,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:56,029 INFO L93 Difference]: Finished difference Result 329 states and 639 transitions. [2021-01-06 23:42:56,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 23:42:56,030 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2021-01-06 23:42:56,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:56,033 INFO L225 Difference]: With dead ends: 329 [2021-01-06 23:42:56,033 INFO L226 Difference]: Without dead ends: 287 [2021-01-06 23:42:56,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2021-01-06 23:42:56,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-01-06 23:42:56,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 192. [2021-01-06 23:42:56,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2021-01-06 23:42:56,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 395 transitions. [2021-01-06 23:42:56,039 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 395 transitions. Word has length 22 [2021-01-06 23:42:56,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:56,040 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 395 transitions. [2021-01-06 23:42:56,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:42:56,040 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 395 transitions. [2021-01-06 23:42:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:56,040 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:56,041 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, 1] [2021-01-06 23:42:56,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 23:42:56,041 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:56,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:56,042 INFO L82 PathProgramCache]: Analyzing trace with hash 2129153615, now seen corresponding path program 26 times [2021-01-06 23:42:56,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:56,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827804751] [2021-01-06 23:42:56,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:56,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:56,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827804751] [2021-01-06 23:42:56,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:56,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 23:42:56,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591104220] [2021-01-06 23:42:56,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 23:42:56,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:56,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 23:42:56,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 23:42:56,198 INFO L87 Difference]: Start difference. First operand 192 states and 395 transitions. Second operand 6 states. [2021-01-06 23:42:56,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:56,327 INFO L93 Difference]: Finished difference Result 216 states and 429 transitions. [2021-01-06 23:42:56,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 23:42:56,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2021-01-06 23:42:56,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:56,329 INFO L225 Difference]: With dead ends: 216 [2021-01-06 23:42:56,329 INFO L226 Difference]: Without dead ends: 216 [2021-01-06 23:42:56,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 23:42:56,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-01-06 23:42:56,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 192. [2021-01-06 23:42:56,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2021-01-06 23:42:56,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 385 transitions. [2021-01-06 23:42:56,335 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 385 transitions. Word has length 22 [2021-01-06 23:42:56,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:56,335 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 385 transitions. [2021-01-06 23:42:56,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 23:42:56,335 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 385 transitions. [2021-01-06 23:42:56,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:56,336 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:56,336 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, 1] [2021-01-06 23:42:56,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 23:42:56,337 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:56,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:56,337 INFO L82 PathProgramCache]: Analyzing trace with hash 77119465, now seen corresponding path program 27 times [2021-01-06 23:42:56,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:56,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478003474] [2021-01-06 23:42:56,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:56,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:56,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478003474] [2021-01-06 23:42:56,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:56,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:42:56,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365084244] [2021-01-06 23:42:56,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:42:56,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:56,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:42:56,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:42:56,973 INFO L87 Difference]: Start difference. First operand 192 states and 385 transitions. Second operand 16 states. [2021-01-06 23:42:57,765 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2021-01-06 23:42:58,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:58,623 INFO L93 Difference]: Finished difference Result 289 states and 553 transitions. [2021-01-06 23:42:58,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 23:42:58,623 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2021-01-06 23:42:58,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:58,625 INFO L225 Difference]: With dead ends: 289 [2021-01-06 23:42:58,626 INFO L226 Difference]: Without dead ends: 256 [2021-01-06 23:42:58,626 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2021-01-06 23:42:58,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-01-06 23:42:58,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 190. [2021-01-06 23:42:58,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2021-01-06 23:42:58,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 381 transitions. [2021-01-06 23:42:58,632 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 381 transitions. Word has length 22 [2021-01-06 23:42:58,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:58,632 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 381 transitions. [2021-01-06 23:42:58,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:42:58,632 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 381 transitions. [2021-01-06 23:42:58,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:42:58,633 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:58,633 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, 1] [2021-01-06 23:42:58,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 23:42:58,634 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:58,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:58,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1144478481, now seen corresponding path program 28 times [2021-01-06 23:42:58,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:58,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232646574] [2021-01-06 23:42:58,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:59,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232646574] [2021-01-06 23:42:59,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:59,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:42:59,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975224771] [2021-01-06 23:42:59,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:42:59,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:59,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:42:59,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:42:59,278 INFO L87 Difference]: Start difference. First operand 190 states and 381 transitions. Second operand 16 states. [2021-01-06 23:42:59,948 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2021-01-06 23:43:00,196 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2021-01-06 23:43:00,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:43:00,997 INFO L93 Difference]: Finished difference Result 277 states and 522 transitions. [2021-01-06 23:43:00,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 23:43:00,998 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2021-01-06 23:43:00,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:43:00,999 INFO L225 Difference]: With dead ends: 277 [2021-01-06 23:43:00,999 INFO L226 Difference]: Without dead ends: 240 [2021-01-06 23:43:01,000 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2021-01-06 23:43:01,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-01-06 23:43:01,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 186. [2021-01-06 23:43:01,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2021-01-06 23:43:01,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 373 transitions. [2021-01-06 23:43:01,005 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 373 transitions. Word has length 22 [2021-01-06 23:43:01,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:43:01,005 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 373 transitions. [2021-01-06 23:43:01,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:43:01,005 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 373 transitions. [2021-01-06 23:43:01,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:43:01,006 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:43:01,006 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, 1] [2021-01-06 23:43:01,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 23:43:01,006 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:43:01,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:43:01,007 INFO L82 PathProgramCache]: Analyzing trace with hash -330663373, now seen corresponding path program 29 times [2021-01-06 23:43:01,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:43:01,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963325002] [2021-01-06 23:43:01,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:43:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:43:01,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:43:01,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963325002] [2021-01-06 23:43:01,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:43:01,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 23:43:01,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59128017] [2021-01-06 23:43:01,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 23:43:01,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:43:01,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 23:43:01,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 23:43:01,152 INFO L87 Difference]: Start difference. First operand 186 states and 373 transitions. Second operand 6 states. [2021-01-06 23:43:01,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:43:01,280 INFO L93 Difference]: Finished difference Result 95 states and 147 transitions. [2021-01-06 23:43:01,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 23:43:01,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2021-01-06 23:43:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:43:01,282 INFO L225 Difference]: With dead ends: 95 [2021-01-06 23:43:01,282 INFO L226 Difference]: Without dead ends: 95 [2021-01-06 23:43:01,283 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 23:43:01,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-01-06 23:43:01,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-01-06 23:43:01,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2021-01-06 23:43:01,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 147 transitions. [2021-01-06 23:43:01,286 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 147 transitions. Word has length 22 [2021-01-06 23:43:01,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:43:01,286 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 147 transitions. [2021-01-06 23:43:01,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 23:43:01,286 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 147 transitions. [2021-01-06 23:43:01,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:43:01,287 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:43:01,287 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, 1] [2021-01-06 23:43:01,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 23:43:01,287 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:43:01,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:43:01,288 INFO L82 PathProgramCache]: Analyzing trace with hash -816663441, now seen corresponding path program 30 times [2021-01-06 23:43:01,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:43:01,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579804064] [2021-01-06 23:43:01,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:43:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:43:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:43:02,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579804064] [2021-01-06 23:43:02,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:43:02,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:43:02,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812048845] [2021-01-06 23:43:02,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:43:02,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:43:02,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:43:02,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:43:02,028 INFO L87 Difference]: Start difference. First operand 95 states and 147 transitions. Second operand 16 states. [2021-01-06 23:43:03,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:43:03,328 INFO L93 Difference]: Finished difference Result 116 states and 173 transitions. [2021-01-06 23:43:03,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 23:43:03,329 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2021-01-06 23:43:03,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:43:03,330 INFO L225 Difference]: With dead ends: 116 [2021-01-06 23:43:03,330 INFO L226 Difference]: Without dead ends: 116 [2021-01-06 23:43:03,331 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2021-01-06 23:43:03,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-01-06 23:43:03,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2021-01-06 23:43:03,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2021-01-06 23:43:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 164 transitions. [2021-01-06 23:43:03,334 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 164 transitions. Word has length 22 [2021-01-06 23:43:03,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:43:03,334 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 164 transitions. [2021-01-06 23:43:03,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:43:03,335 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 164 transitions. [2021-01-06 23:43:03,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:43:03,335 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:43:03,335 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, 1] [2021-01-06 23:43:03,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 23:43:03,336 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:43:03,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:43:03,336 INFO L82 PathProgramCache]: Analyzing trace with hash -816663455, now seen corresponding path program 4 times [2021-01-06 23:43:03,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:43:03,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090092911] [2021-01-06 23:43:03,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:43:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:43:03,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:43:03,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090092911] [2021-01-06 23:43:03,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:43:03,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 23:43:03,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605435224] [2021-01-06 23:43:03,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 23:43:03,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:43:03,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 23:43:03,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-01-06 23:43:03,526 INFO L87 Difference]: Start difference. First operand 108 states and 164 transitions. Second operand 9 states. [2021-01-06 23:43:03,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:43:03,976 INFO L93 Difference]: Finished difference Result 139 states and 206 transitions. [2021-01-06 23:43:03,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 23:43:03,977 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2021-01-06 23:43:03,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:43:03,978 INFO L225 Difference]: With dead ends: 139 [2021-01-06 23:43:03,978 INFO L226 Difference]: Without dead ends: 122 [2021-01-06 23:43:03,978 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-01-06 23:43:03,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-01-06 23:43:03,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 103. [2021-01-06 23:43:03,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2021-01-06 23:43:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 160 transitions. [2021-01-06 23:43:03,981 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 160 transitions. Word has length 22 [2021-01-06 23:43:03,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:43:03,982 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 160 transitions. [2021-01-06 23:43:03,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 23:43:03,982 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 160 transitions. [2021-01-06 23:43:03,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:43:03,982 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:43:03,983 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, 1] [2021-01-06 23:43:03,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 23:43:03,983 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:43:03,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:43:03,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1443902611, now seen corresponding path program 31 times [2021-01-06 23:43:03,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:43:03,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560093549] [2021-01-06 23:43:03,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:43:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:43:04,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:43:04,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560093549] [2021-01-06 23:43:04,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:43:04,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:43:04,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659963115] [2021-01-06 23:43:04,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:43:04,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:43:04,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:43:04,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:43:04,763 INFO L87 Difference]: Start difference. First operand 103 states and 160 transitions. Second operand 16 states. [2021-01-06 23:43:06,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:43:06,272 INFO L93 Difference]: Finished difference Result 137 states and 205 transitions. [2021-01-06 23:43:06,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 23:43:06,272 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2021-01-06 23:43:06,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:43:06,273 INFO L225 Difference]: With dead ends: 137 [2021-01-06 23:43:06,274 INFO L226 Difference]: Without dead ends: 118 [2021-01-06 23:43:06,274 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2021-01-06 23:43:06,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-01-06 23:43:06,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2021-01-06 23:43:06,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2021-01-06 23:43:06,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 156 transitions. [2021-01-06 23:43:06,277 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 156 transitions. Word has length 22 [2021-01-06 23:43:06,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:43:06,277 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 156 transitions. [2021-01-06 23:43:06,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:43:06,277 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 156 transitions. [2021-01-06 23:43:06,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:43:06,277 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:43:06,278 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, 1] [2021-01-06 23:43:06,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 23:43:06,278 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:43:06,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:43:06,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1394012867, now seen corresponding path program 32 times [2021-01-06 23:43:06,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:43:06,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335706840] [2021-01-06 23:43:06,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:43:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:43:07,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:43:07,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335706840] [2021-01-06 23:43:07,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:43:07,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:43:07,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272597443] [2021-01-06 23:43:07,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:43:07,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:43:07,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:43:07,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:43:07,055 INFO L87 Difference]: Start difference. First operand 101 states and 156 transitions. Second operand 16 states. [2021-01-06 23:43:08,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:43:08,503 INFO L93 Difference]: Finished difference Result 136 states and 203 transitions. [2021-01-06 23:43:08,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 23:43:08,504 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2021-01-06 23:43:08,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:43:08,505 INFO L225 Difference]: With dead ends: 136 [2021-01-06 23:43:08,505 INFO L226 Difference]: Without dead ends: 113 [2021-01-06 23:43:08,506 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2021-01-06 23:43:08,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-01-06 23:43:08,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2021-01-06 23:43:08,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2021-01-06 23:43:08,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 169 transitions. [2021-01-06 23:43:08,514 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 169 transitions. Word has length 22 [2021-01-06 23:43:08,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:43:08,514 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 169 transitions. [2021-01-06 23:43:08,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:43:08,514 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 169 transitions. [2021-01-06 23:43:08,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:43:08,515 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:43:08,515 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, 1] [2021-01-06 23:43:08,515 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 23:43:08,518 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:43:08,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:43:08,518 INFO L82 PathProgramCache]: Analyzing trace with hash -661421377, now seen corresponding path program 5 times [2021-01-06 23:43:08,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:43:08,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984515241] [2021-01-06 23:43:08,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:43:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:43:08,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:43:08,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984515241] [2021-01-06 23:43:08,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:43:08,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 23:43:08,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235117050] [2021-01-06 23:43:08,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 23:43:08,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:43:08,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 23:43:08,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-01-06 23:43:08,734 INFO L87 Difference]: Start difference. First operand 112 states and 169 transitions. Second operand 9 states. [2021-01-06 23:43:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:43:09,172 INFO L93 Difference]: Finished difference Result 121 states and 180 transitions. [2021-01-06 23:43:09,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 23:43:09,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2021-01-06 23:43:09,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:43:09,174 INFO L225 Difference]: With dead ends: 121 [2021-01-06 23:43:09,174 INFO L226 Difference]: Without dead ends: 94 [2021-01-06 23:43:09,175 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-01-06 23:43:09,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-01-06 23:43:09,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2021-01-06 23:43:09,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2021-01-06 23:43:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2021-01-06 23:43:09,177 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 22 [2021-01-06 23:43:09,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:43:09,177 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2021-01-06 23:43:09,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 23:43:09,177 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2021-01-06 23:43:09,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:43:09,178 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:43:09,178 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, 1] [2021-01-06 23:43:09,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-01-06 23:43:09,179 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:43:09,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:43:09,179 INFO L82 PathProgramCache]: Analyzing trace with hash 667276057, now seen corresponding path program 33 times [2021-01-06 23:43:09,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:43:09,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030298638] [2021-01-06 23:43:09,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:43:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:43:09,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:43:09,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030298638] [2021-01-06 23:43:09,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:43:09,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:43:09,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035084389] [2021-01-06 23:43:09,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:43:09,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:43:09,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:43:09,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:43:09,832 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand 16 states. [2021-01-06 23:43:11,223 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2021-01-06 23:43:11,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:43:11,490 INFO L93 Difference]: Finished difference Result 116 states and 173 transitions. [2021-01-06 23:43:11,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 23:43:11,491 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2021-01-06 23:43:11,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:43:11,492 INFO L225 Difference]: With dead ends: 116 [2021-01-06 23:43:11,492 INFO L226 Difference]: Without dead ends: 116 [2021-01-06 23:43:11,493 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2021-01-06 23:43:11,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-01-06 23:43:11,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2021-01-06 23:43:11,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2021-01-06 23:43:11,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 173 transitions. [2021-01-06 23:43:11,497 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 173 transitions. Word has length 22 [2021-01-06 23:43:11,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:43:11,497 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 173 transitions. [2021-01-06 23:43:11,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:43:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 173 transitions. [2021-01-06 23:43:11,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:43:11,498 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:43:11,498 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, 1] [2021-01-06 23:43:11,498 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-01-06 23:43:11,498 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:43:11,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:43:11,499 INFO L82 PathProgramCache]: Analyzing trace with hash 667276043, now seen corresponding path program 6 times [2021-01-06 23:43:11,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:43:11,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242895231] [2021-01-06 23:43:11,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:43:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:43:11,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:43:11,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242895231] [2021-01-06 23:43:11,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:43:11,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 23:43:11,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398982544] [2021-01-06 23:43:11,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 23:43:11,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:43:11,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 23:43:11,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-01-06 23:43:11,725 INFO L87 Difference]: Start difference. First operand 115 states and 173 transitions. Second operand 9 states. [2021-01-06 23:43:12,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:43:12,124 INFO L93 Difference]: Finished difference Result 114 states and 171 transitions. [2021-01-06 23:43:12,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 23:43:12,125 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2021-01-06 23:43:12,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:43:12,126 INFO L225 Difference]: With dead ends: 114 [2021-01-06 23:43:12,126 INFO L226 Difference]: Without dead ends: 80 [2021-01-06 23:43:12,127 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-01-06 23:43:12,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-01-06 23:43:12,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2021-01-06 23:43:12,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2021-01-06 23:43:12,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 108 transitions. [2021-01-06 23:43:12,129 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 108 transitions. Word has length 22 [2021-01-06 23:43:12,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:43:12,130 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 108 transitions. [2021-01-06 23:43:12,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 23:43:12,130 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 108 transitions. [2021-01-06 23:43:12,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:43:12,130 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:43:12,131 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, 1] [2021-01-06 23:43:12,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-01-06 23:43:12,131 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:43:12,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:43:12,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1150452547, now seen corresponding path program 34 times [2021-01-06 23:43:12,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:43:12,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796754980] [2021-01-06 23:43:12,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:43:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:43:12,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:43:12,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796754980] [2021-01-06 23:43:12,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:43:12,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:43:12,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053472683] [2021-01-06 23:43:12,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:43:12,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:43:12,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:43:12,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:43:12,806 INFO L87 Difference]: Start difference. First operand 71 states and 108 transitions. Second operand 16 states. [2021-01-06 23:43:14,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:43:14,211 INFO L93 Difference]: Finished difference Result 102 states and 154 transitions. [2021-01-06 23:43:14,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 23:43:14,214 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2021-01-06 23:43:14,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:43:14,214 INFO L225 Difference]: With dead ends: 102 [2021-01-06 23:43:14,214 INFO L226 Difference]: Without dead ends: 69 [2021-01-06 23:43:14,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2021-01-06 23:43:14,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-01-06 23:43:14,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-01-06 23:43:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2021-01-06 23:43:14,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 104 transitions. [2021-01-06 23:43:14,217 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 104 transitions. Word has length 22 [2021-01-06 23:43:14,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:43:14,217 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 104 transitions. [2021-01-06 23:43:14,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:43:14,217 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 104 transitions. [2021-01-06 23:43:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:43:14,218 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:43:14,218 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, 1] [2021-01-06 23:43:14,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-01-06 23:43:14,219 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:43:14,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:43:14,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1780880401, now seen corresponding path program 35 times [2021-01-06 23:43:14,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:43:14,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760938026] [2021-01-06 23:43:14,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:43:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:43:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:43:14,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760938026] [2021-01-06 23:43:14,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:43:14,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:43:14,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922370678] [2021-01-06 23:43:14,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:43:14,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:43:14,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:43:14,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:43:14,895 INFO L87 Difference]: Start difference. First operand 69 states and 104 transitions. Second operand 16 states. [2021-01-06 23:43:16,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:43:16,331 INFO L93 Difference]: Finished difference Result 102 states and 152 transitions. [2021-01-06 23:43:16,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 23:43:16,332 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2021-01-06 23:43:16,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:43:16,332 INFO L225 Difference]: With dead ends: 102 [2021-01-06 23:43:16,333 INFO L226 Difference]: Without dead ends: 65 [2021-01-06 23:43:16,333 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2021-01-06 23:43:16,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-01-06 23:43:16,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-01-06 23:43:16,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2021-01-06 23:43:16,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2021-01-06 23:43:16,334 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 22 [2021-01-06 23:43:16,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:43:16,335 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 96 transitions. [2021-01-06 23:43:16,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:43:16,335 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 96 transitions. [2021-01-06 23:43:16,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:43:16,335 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:43:16,335 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, 1] [2021-01-06 23:43:16,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-01-06 23:43:16,335 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:43:16,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:43:16,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1524191407, now seen corresponding path program 36 times [2021-01-06 23:43:16,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:43:16,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004983233] [2021-01-06 23:43:16,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:43:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:43:17,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:43:17,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004983233] [2021-01-06 23:43:17,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:43:17,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:43:17,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179788244] [2021-01-06 23:43:17,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:43:17,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:43:17,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:43:17,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:43:17,007 INFO L87 Difference]: Start difference. First operand 65 states and 96 transitions. Second operand 16 states. [2021-01-06 23:43:17,608 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2021-01-06 23:43:17,835 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2021-01-06 23:43:18,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:43:18,457 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2021-01-06 23:43:18,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 23:43:18,458 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2021-01-06 23:43:18,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:43:18,459 INFO L225 Difference]: With dead ends: 74 [2021-01-06 23:43:18,459 INFO L226 Difference]: Without dead ends: 41 [2021-01-06 23:43:18,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2021-01-06 23:43:18,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-01-06 23:43:18,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-01-06 23:43:18,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2021-01-06 23:43:18,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2021-01-06 23:43:18,462 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 22 [2021-01-06 23:43:18,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:43:18,462 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2021-01-06 23:43:18,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:43:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2021-01-06 23:43:18,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:43:18,463 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:43:18,463 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, 1] [2021-01-06 23:43:18,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-01-06 23:43:18,463 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:43:18,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:43:18,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1735113217, now seen corresponding path program 37 times [2021-01-06 23:43:18,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:43:18,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976127078] [2021-01-06 23:43:18,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:43:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:43:19,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:43:19,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976127078] [2021-01-06 23:43:19,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:43:19,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:43:19,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618622037] [2021-01-06 23:43:19,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:43:19,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:43:19,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:43:19,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:43:19,173 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. Second operand 16 states. [2021-01-06 23:43:20,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:43:20,497 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2021-01-06 23:43:20,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 23:43:20,499 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2021-01-06 23:43:20,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:43:20,499 INFO L225 Difference]: With dead ends: 40 [2021-01-06 23:43:20,499 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 23:43:20,500 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2021-01-06 23:43:20,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 23:43:20,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 23:43:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 23:43:20,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 23:43:20,500 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2021-01-06 23:43:20,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:43:20,500 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 23:43:20,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:43:20,501 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 23:43:20,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 23:43:20,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-01-06 23:43:20,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:43:20 BasicIcfg [2021-01-06 23:43:20,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 23:43:20,504 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 23:43:20,504 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 23:43:20,505 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 23:43:20,505 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:40:50" (3/4) ... [2021-01-06 23:43:20,508 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 23:43:20,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure my_callback [2021-01-06 23:43:20,522 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2021-01-06 23:43:20,523 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-01-06 23:43:20,523 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 23:43:20,523 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 23:43:20,579 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-races/race-2_1-container_of.i-witness.graphml [2021-01-06 23:43:20,580 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 23:43:20,581 INFO L168 Benchmark]: Toolchain (without parser) took 153032.39 ms. Allocated memory was 156.2 MB in the beginning and 256.9 MB in the end (delta: 100.7 MB). Free memory was 110.2 MB in the beginning and 117.2 MB in the end (delta: -6.9 MB). Peak memory consumption was 94.5 MB. Max. memory is 8.0 GB. [2021-01-06 23:43:20,581 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 156.2 MB. Free memory is still 129.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 23:43:20,582 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1980.55 ms. Allocated memory is still 156.2 MB. Free memory was 110.0 MB in the beginning and 72.0 MB in the end (delta: 38.0 MB). Peak memory consumption was 42.2 MB. Max. memory is 8.0 GB. [2021-01-06 23:43:20,582 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.99 ms. Allocated memory is still 156.2 MB. Free memory was 72.0 MB in the beginning and 68.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-01-06 23:43:20,582 INFO L168 Benchmark]: Boogie Preprocessor took 56.06 ms. Allocated memory was 156.2 MB in the beginning and 213.9 MB in the end (delta: 57.7 MB). Free memory was 68.3 MB in the beginning and 188.4 MB in the end (delta: -120.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 23:43:20,583 INFO L168 Benchmark]: RCFGBuilder took 982.16 ms. Allocated memory is still 213.9 MB. Free memory was 188.4 MB in the beginning and 140.7 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.2 MB. Max. memory is 8.0 GB. [2021-01-06 23:43:20,583 INFO L168 Benchmark]: TraceAbstraction took 149817.90 ms. Allocated memory was 213.9 MB in the beginning and 256.9 MB in the end (delta: 43.0 MB). Free memory was 140.2 MB in the beginning and 120.8 MB in the end (delta: 19.4 MB). Peak memory consumption was 61.8 MB. Max. memory is 8.0 GB. [2021-01-06 23:43:20,584 INFO L168 Benchmark]: Witness Printer took 75.52 ms. Allocated memory is still 256.9 MB. Free memory was 120.8 MB in the beginning and 117.2 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-01-06 23:43:20,586 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 156.2 MB. Free memory is still 129.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1980.55 ms. Allocated memory is still 156.2 MB. Free memory was 110.0 MB in the beginning and 72.0 MB in the end (delta: 38.0 MB). Peak memory consumption was 42.2 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 111.99 ms. Allocated memory is still 156.2 MB. Free memory was 72.0 MB in the beginning and 68.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 56.06 ms. Allocated memory was 156.2 MB in the beginning and 213.9 MB in the end (delta: 57.7 MB). Free memory was 68.3 MB in the beginning and 188.4 MB in the end (delta: -120.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 982.16 ms. Allocated memory is still 213.9 MB. Free memory was 188.4 MB in the beginning and 140.7 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 149817.90 ms. Allocated memory was 213.9 MB in the beginning and 256.9 MB in the end (delta: 43.0 MB). Free memory was 140.2 MB in the beginning and 120.8 MB in the end (delta: 19.4 MB). Peak memory consumption was 61.8 MB. Max. memory is 8.0 GB. * Witness Printer took 75.52 ms. Allocated memory is still 256.9 MB. Free memory was 120.8 MB in the beginning and 117.2 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1980 VarBasedMoverChecksPositive, 66 VarBasedMoverChecksNegative, 4 SemBasedMoverChecksPositive, 45 SemBasedMoverChecksNegative, 17 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 37.4s, 123 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 65.2s, 161 PlacesBefore, 40 PlacesAfterwards, 165 TransitionsBefore, 38 TransitionsAfterwards, 2996 CoEnabledTransitionPairs, 8 FixpointIterations, 99 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 17 ConcurrentYvCompositions, 6 ChoiceCompositions, 187 TotalNumberOfCompositions, 6790 MoverChecksTotal - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 140 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 149.6s, OverallIterations: 47, TraceHistogramMax: 1, AutomataDifference: 56.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 65.2s, HoareTripleCheckerStatistics: 1245 SDtfs, 2784 SDslu, 6357 SDs, 0 SdLazy, 17034 SolverSat, 1179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 953 GetRequests, 53 SyntacticMatches, 90 SemanticMatches, 810 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2057 ImplicationChecksByTransitivity, 44.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=514occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 47 MinimizatonAttempts, 1741 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 24.5s InterpolantComputationTime, 968 NumberOfCodeBlocks, 968 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 921 ConstructedInterpolants, 0 QuantifiedInterpolants, 458021 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 47 InterpolantComputations, 47 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 correct! Received shutdown request...