./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/s3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/s3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d18b16a91281a6c3ff97c6a6bee0acf1ccb6bd91 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/s3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d18b16a91281a6c3ff97c6a6bee0acf1ccb6bd91 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 03:10:11,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 03:10:11,041 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 03:10:11,083 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 03:10:11,083 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 03:10:11,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 03:10:11,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 03:10:11,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 03:10:11,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 03:10:11,095 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 03:10:11,096 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 03:10:11,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 03:10:11,100 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 03:10:11,102 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 03:10:11,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 03:10:11,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 03:10:11,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 03:10:11,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 03:10:11,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 03:10:11,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 03:10:11,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 03:10:11,116 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 03:10:11,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 03:10:11,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 03:10:11,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 03:10:11,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 03:10:11,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 03:10:11,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 03:10:11,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 03:10:11,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 03:10:11,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 03:10:11,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 03:10:11,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 03:10:11,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 03:10:11,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 03:10:11,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 03:10:11,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 03:10:11,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 03:10:11,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 03:10:11,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 03:10:11,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 03:10:11,137 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 03:10:11,170 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 03:10:11,171 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 03:10:11,172 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 03:10:11,172 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 03:10:11,174 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 03:10:11,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 03:10:11,174 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 03:10:11,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 03:10:11,175 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 03:10:11,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 03:10:11,176 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 03:10:11,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 03:10:11,177 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 03:10:11,177 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 03:10:11,177 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 03:10:11,177 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 03:10:11,178 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 03:10:11,178 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 03:10:11,178 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 03:10:11,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 03:10:11,179 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 03:10:11,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 03:10:11,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 03:10:11,179 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 03:10:11,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 03:10:11,180 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 03:10:11,180 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 03:10:11,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 03:10:11,180 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 03:10:11,180 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 03:10:11,181 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/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d18b16a91281a6c3ff97c6a6bee0acf1ccb6bd91 [2021-08-26 03:10:11,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 03:10:11,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 03:10:11,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 03:10:11,474 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 03:10:11,474 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 03:10:11,475 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/s3.i [2021-08-26 03:10:11,514 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e323f44e/bbb0505bb9e6469083529e781ad33997/FLAGd2582b324 [2021-08-26 03:10:11,961 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 03:10:11,963 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/s3.i [2021-08-26 03:10:11,991 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e323f44e/bbb0505bb9e6469083529e781ad33997/FLAGd2582b324 [2021-08-26 03:10:12,502 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e323f44e/bbb0505bb9e6469083529e781ad33997 [2021-08-26 03:10:12,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 03:10:12,505 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 03:10:12,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 03:10:12,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 03:10:12,510 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 03:10:12,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:10:12" (1/1) ... [2021-08-26 03:10:12,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53214a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:12, skipping insertion in model container [2021-08-26 03:10:12,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:10:12" (1/1) ... [2021-08-26 03:10:12,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 03:10:12,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 03:10:12,767 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/s3.i[63567,63580] [2021-08-26 03:10:12,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 03:10:12,780 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 03:10:12,854 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/s3.i[63567,63580] [2021-08-26 03:10:12,856 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 03:10:12,866 INFO L208 MainTranslator]: Completed translation [2021-08-26 03:10:12,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:12 WrapperNode [2021-08-26 03:10:12,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 03:10:12,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 03:10:12,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 03:10:12,867 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 03:10:12,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:12" (1/1) ... [2021-08-26 03:10:12,883 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:12" (1/1) ... [2021-08-26 03:10:12,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 03:10:12,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 03:10:12,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 03:10:12,911 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 03:10:12,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:12" (1/1) ... [2021-08-26 03:10:12,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:12" (1/1) ... [2021-08-26 03:10:12,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:12" (1/1) ... [2021-08-26 03:10:12,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:12" (1/1) ... [2021-08-26 03:10:12,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:12" (1/1) ... [2021-08-26 03:10:12,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:12" (1/1) ... [2021-08-26 03:10:12,949 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:12" (1/1) ... [2021-08-26 03:10:12,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 03:10:12,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 03:10:12,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 03:10:12,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 03:10:12,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:12" (1/1) ... [2021-08-26 03:10:12,958 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 03:10:12,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:10:12,973 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 03:10:12,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 03:10:13,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-26 03:10:13,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 03:10:13,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-26 03:10:13,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-26 03:10:13,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-26 03:10:13,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 03:10:13,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-26 03:10:13,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 03:10:13,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 03:10:13,240 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-26 03:10:13,894 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-08-26 03:10:13,894 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-08-26 03:10:13,899 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 03:10:13,899 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-26 03:10:13,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:10:13 BoogieIcfgContainer [2021-08-26 03:10:13,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 03:10:13,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 03:10:13,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 03:10:13,903 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 03:10:13,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:10:12" (1/3) ... [2021-08-26 03:10:13,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205c2fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:10:13, skipping insertion in model container [2021-08-26 03:10:13,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:12" (2/3) ... [2021-08-26 03:10:13,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205c2fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:10:13, skipping insertion in model container [2021-08-26 03:10:13,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:10:13" (3/3) ... [2021-08-26 03:10:13,905 INFO L111 eAbstractionObserver]: Analyzing ICFG s3.i [2021-08-26 03:10:13,908 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 03:10:13,908 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 03:10:13,933 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 03:10:13,936 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 03:10:13,937 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 03:10:13,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:13,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-26 03:10:13,961 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:13,962 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:13,962 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:13,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:13,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2021-08-26 03:10:13,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:13,974 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004059278] [2021-08-26 03:10:13,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:13,975 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:14,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:10:14,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:14,153 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004059278] [2021-08-26 03:10:14,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004059278] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:14,153 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:14,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 03:10:14,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840924727] [2021-08-26 03:10:14,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 03:10:14,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:14,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 03:10:14,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 03:10:14,166 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:14,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:14,230 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2021-08-26 03:10:14,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 03:10:14,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-08-26 03:10:14,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:14,239 INFO L225 Difference]: With dead ends: 375 [2021-08-26 03:10:14,240 INFO L226 Difference]: Without dead ends: 217 [2021-08-26 03:10:14,242 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 03:10:14,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-08-26 03:10:14,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-08-26 03:10:14,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:14,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 321 transitions. [2021-08-26 03:10:14,281 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 321 transitions. Word has length 24 [2021-08-26 03:10:14,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:14,281 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 321 transitions. [2021-08-26 03:10:14,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:14,282 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 321 transitions. [2021-08-26 03:10:14,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-26 03:10:14,283 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:14,283 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:14,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 03:10:14,284 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:14,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:14,284 INFO L82 PathProgramCache]: Analyzing trace with hash 546953675, now seen corresponding path program 1 times [2021-08-26 03:10:14,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:14,285 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164051861] [2021-08-26 03:10:14,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:14,285 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:10:14,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:14,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164051861] [2021-08-26 03:10:14,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164051861] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:14,363 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:14,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:10:14,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883572792] [2021-08-26 03:10:14,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:14,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:14,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:14,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:14,366 INFO L87 Difference]: Start difference. First operand 217 states and 321 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:14,783 INFO L93 Difference]: Finished difference Result 359 states and 534 transitions. [2021-08-26 03:10:14,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:14,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-08-26 03:10:14,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:14,786 INFO L225 Difference]: With dead ends: 359 [2021-08-26 03:10:14,786 INFO L226 Difference]: Without dead ends: 252 [2021-08-26 03:10:14,787 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:14,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-08-26 03:10:14,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 235. [2021-08-26 03:10:14,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.5) internal successors, (351), 234 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:14,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 351 transitions. [2021-08-26 03:10:14,798 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 351 transitions. Word has length 39 [2021-08-26 03:10:14,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:14,799 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 351 transitions. [2021-08-26 03:10:14,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:14,799 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 351 transitions. [2021-08-26 03:10:14,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-26 03:10:14,800 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:14,801 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:14,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 03:10:14,801 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:14,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:14,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1468155038, now seen corresponding path program 1 times [2021-08-26 03:10:14,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:14,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361704628] [2021-08-26 03:10:14,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:14,803 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:14,928 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:10:14,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:14,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361704628] [2021-08-26 03:10:14,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361704628] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:14,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:14,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:10:14,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977691871] [2021-08-26 03:10:14,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:14,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:14,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:14,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:14,930 INFO L87 Difference]: Start difference. First operand 235 states and 351 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:15,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:15,246 INFO L93 Difference]: Finished difference Result 376 states and 562 transitions. [2021-08-26 03:10:15,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:15,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-08-26 03:10:15,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:15,248 INFO L225 Difference]: With dead ends: 376 [2021-08-26 03:10:15,248 INFO L226 Difference]: Without dead ends: 251 [2021-08-26 03:10:15,248 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:15,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-08-26 03:10:15,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2021-08-26 03:10:15,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.4957264957264957) internal successors, (350), 234 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:15,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 350 transitions. [2021-08-26 03:10:15,258 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 350 transitions. Word has length 54 [2021-08-26 03:10:15,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:15,258 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 350 transitions. [2021-08-26 03:10:15,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:15,258 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 350 transitions. [2021-08-26 03:10:15,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-26 03:10:15,260 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:15,260 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:15,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 03:10:15,260 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:15,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:15,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1486810496, now seen corresponding path program 1 times [2021-08-26 03:10:15,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:15,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395836118] [2021-08-26 03:10:15,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:15,261 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:15,317 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:10:15,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:15,317 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395836118] [2021-08-26 03:10:15,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395836118] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:15,318 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:15,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:10:15,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473353178] [2021-08-26 03:10:15,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:15,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:15,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:15,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:15,319 INFO L87 Difference]: Start difference. First operand 235 states and 350 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:15,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:15,577 INFO L93 Difference]: Finished difference Result 376 states and 560 transitions. [2021-08-26 03:10:15,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:15,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-08-26 03:10:15,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:15,579 INFO L225 Difference]: With dead ends: 376 [2021-08-26 03:10:15,579 INFO L226 Difference]: Without dead ends: 251 [2021-08-26 03:10:15,582 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:15,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-08-26 03:10:15,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2021-08-26 03:10:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.4914529914529915) internal successors, (349), 234 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 349 transitions. [2021-08-26 03:10:15,598 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 349 transitions. Word has length 54 [2021-08-26 03:10:15,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:15,598 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 349 transitions. [2021-08-26 03:10:15,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 349 transitions. [2021-08-26 03:10:15,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-26 03:10:15,600 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:15,600 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:15,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 03:10:15,600 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:15,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:15,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1014296481, now seen corresponding path program 1 times [2021-08-26 03:10:15,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:15,601 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336693313] [2021-08-26 03:10:15,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:15,601 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:10:15,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:15,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336693313] [2021-08-26 03:10:15,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336693313] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:15,663 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:15,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:10:15,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083803063] [2021-08-26 03:10:15,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:15,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:15,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:15,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:15,671 INFO L87 Difference]: Start difference. First operand 235 states and 349 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:15,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:15,993 INFO L93 Difference]: Finished difference Result 376 states and 558 transitions. [2021-08-26 03:10:15,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:15,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-08-26 03:10:15,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:15,998 INFO L225 Difference]: With dead ends: 376 [2021-08-26 03:10:15,998 INFO L226 Difference]: Without dead ends: 251 [2021-08-26 03:10:15,998 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:15,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-08-26 03:10:16,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2021-08-26 03:10:16,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.4871794871794872) internal successors, (348), 234 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:16,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 348 transitions. [2021-08-26 03:10:16,004 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 348 transitions. Word has length 55 [2021-08-26 03:10:16,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:16,004 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 348 transitions. [2021-08-26 03:10:16,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:16,004 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 348 transitions. [2021-08-26 03:10:16,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-08-26 03:10:16,006 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:16,006 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:16,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 03:10:16,006 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:16,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:16,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1792231515, now seen corresponding path program 1 times [2021-08-26 03:10:16,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:16,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485461955] [2021-08-26 03:10:16,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:16,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:16,129 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:10:16,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:16,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485461955] [2021-08-26 03:10:16,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485461955] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:16,130 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:16,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:10:16,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096916407] [2021-08-26 03:10:16,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:16,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:16,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:16,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:16,131 INFO L87 Difference]: Start difference. First operand 235 states and 348 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:16,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:16,394 INFO L93 Difference]: Finished difference Result 376 states and 556 transitions. [2021-08-26 03:10:16,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:16,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-08-26 03:10:16,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:16,396 INFO L225 Difference]: With dead ends: 376 [2021-08-26 03:10:16,396 INFO L226 Difference]: Without dead ends: 251 [2021-08-26 03:10:16,397 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:16,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-08-26 03:10:16,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2021-08-26 03:10:16,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.482905982905983) internal successors, (347), 234 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:16,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 347 transitions. [2021-08-26 03:10:16,403 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 347 transitions. Word has length 56 [2021-08-26 03:10:16,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:16,405 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 347 transitions. [2021-08-26 03:10:16,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:16,405 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 347 transitions. [2021-08-26 03:10:16,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-26 03:10:16,411 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:16,411 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:16,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 03:10:16,412 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:16,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:16,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1615585892, now seen corresponding path program 1 times [2021-08-26 03:10:16,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:16,413 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009518119] [2021-08-26 03:10:16,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:16,413 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:16,482 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:10:16,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:16,482 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009518119] [2021-08-26 03:10:16,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009518119] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:16,483 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:16,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:10:16,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86870806] [2021-08-26 03:10:16,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:16,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:16,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:16,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:16,485 INFO L87 Difference]: Start difference. First operand 235 states and 347 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:16,749 INFO L93 Difference]: Finished difference Result 367 states and 543 transitions. [2021-08-26 03:10:16,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:16,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-08-26 03:10:16,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:16,751 INFO L225 Difference]: With dead ends: 367 [2021-08-26 03:10:16,751 INFO L226 Difference]: Without dead ends: 242 [2021-08-26 03:10:16,751 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:16,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-08-26 03:10:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 235. [2021-08-26 03:10:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.4786324786324787) internal successors, (346), 234 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:16,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 346 transitions. [2021-08-26 03:10:16,757 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 346 transitions. Word has length 57 [2021-08-26 03:10:16,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:16,757 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 346 transitions. [2021-08-26 03:10:16,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:16,757 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 346 transitions. [2021-08-26 03:10:16,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-26 03:10:16,759 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:16,759 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:16,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 03:10:16,759 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:16,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:16,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1711683715, now seen corresponding path program 1 times [2021-08-26 03:10:16,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:16,760 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885576950] [2021-08-26 03:10:16,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:16,760 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:16,870 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-26 03:10:16,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:16,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885576950] [2021-08-26 03:10:16,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885576950] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:16,871 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:16,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 03:10:16,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721432147] [2021-08-26 03:10:16,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 03:10:16,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:16,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 03:10:16,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 03:10:16,873 INFO L87 Difference]: Start difference. First operand 235 states and 346 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:16,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:16,936 INFO L93 Difference]: Finished difference Result 482 states and 714 transitions. [2021-08-26 03:10:16,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 03:10:16,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-08-26 03:10:16,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:16,938 INFO L225 Difference]: With dead ends: 482 [2021-08-26 03:10:16,938 INFO L226 Difference]: Without dead ends: 357 [2021-08-26 03:10:16,938 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 03:10:16,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-08-26 03:10:16,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2021-08-26 03:10:16,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 1.4691011235955056) internal successors, (523), 356 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:16,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 523 transitions. [2021-08-26 03:10:16,962 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 523 transitions. Word has length 57 [2021-08-26 03:10:16,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:16,962 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 523 transitions. [2021-08-26 03:10:16,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:16,962 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 523 transitions. [2021-08-26 03:10:16,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-26 03:10:16,963 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:16,963 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:16,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 03:10:16,964 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:16,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:16,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1773723329, now seen corresponding path program 1 times [2021-08-26 03:10:16,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:16,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460513797] [2021-08-26 03:10:16,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:16,965 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:17,067 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:10:17,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:17,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460513797] [2021-08-26 03:10:17,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460513797] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:17,068 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:17,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 03:10:17,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471468570] [2021-08-26 03:10:17,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 03:10:17,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:17,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 03:10:17,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 03:10:17,073 INFO L87 Difference]: Start difference. First operand 357 states and 523 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:17,187 INFO L93 Difference]: Finished difference Result 628 states and 919 transitions. [2021-08-26 03:10:17,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 03:10:17,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-08-26 03:10:17,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:17,195 INFO L225 Difference]: With dead ends: 628 [2021-08-26 03:10:17,195 INFO L226 Difference]: Without dead ends: 381 [2021-08-26 03:10:17,196 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 03:10:17,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-08-26 03:10:17,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2021-08-26 03:10:17,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 1.4605263157894737) internal successors, (555), 380 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 555 transitions. [2021-08-26 03:10:17,204 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 555 transitions. Word has length 57 [2021-08-26 03:10:17,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:17,204 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 555 transitions. [2021-08-26 03:10:17,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:17,207 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 555 transitions. [2021-08-26 03:10:17,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-26 03:10:17,208 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:17,208 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:17,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-26 03:10:17,208 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:17,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:17,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1922596163, now seen corresponding path program 1 times [2021-08-26 03:10:17,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:17,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236802804] [2021-08-26 03:10:17,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:17,212 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:17,293 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-26 03:10:17,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:17,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236802804] [2021-08-26 03:10:17,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236802804] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:17,294 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:17,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:10:17,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455531271] [2021-08-26 03:10:17,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:17,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:17,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:17,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:17,296 INFO L87 Difference]: Start difference. First operand 381 states and 555 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:17,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:17,671 INFO L93 Difference]: Finished difference Result 1035 states and 1516 transitions. [2021-08-26 03:10:17,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:17,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-08-26 03:10:17,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:17,674 INFO L225 Difference]: With dead ends: 1035 [2021-08-26 03:10:17,674 INFO L226 Difference]: Without dead ends: 661 [2021-08-26 03:10:17,675 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:17,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2021-08-26 03:10:17,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 444. [2021-08-26 03:10:17,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 1.489841986455982) internal successors, (660), 443 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:17,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 660 transitions. [2021-08-26 03:10:17,687 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 660 transitions. Word has length 77 [2021-08-26 03:10:17,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:17,687 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 660 transitions. [2021-08-26 03:10:17,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:17,687 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 660 transitions. [2021-08-26 03:10:17,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-26 03:10:17,689 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:17,689 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:17,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 03:10:17,689 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:17,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:17,690 INFO L82 PathProgramCache]: Analyzing trace with hash -126791679, now seen corresponding path program 1 times [2021-08-26 03:10:17,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:17,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690533487] [2021-08-26 03:10:17,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:17,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:17,743 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-08-26 03:10:17,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:17,744 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690533487] [2021-08-26 03:10:17,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690533487] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:17,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:17,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:10:17,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823720702] [2021-08-26 03:10:17,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:17,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:17,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:17,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:17,746 INFO L87 Difference]: Start difference. First operand 444 states and 660 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:18,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:18,089 INFO L93 Difference]: Finished difference Result 1021 states and 1516 transitions. [2021-08-26 03:10:18,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:18,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-08-26 03:10:18,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:18,092 INFO L225 Difference]: With dead ends: 1021 [2021-08-26 03:10:18,092 INFO L226 Difference]: Without dead ends: 584 [2021-08-26 03:10:18,093 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:18,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2021-08-26 03:10:18,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 510. [2021-08-26 03:10:18,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.5206286836935168) internal successors, (774), 509 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 774 transitions. [2021-08-26 03:10:18,102 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 774 transitions. Word has length 77 [2021-08-26 03:10:18,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:18,102 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 774 transitions. [2021-08-26 03:10:18,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:18,102 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 774 transitions. [2021-08-26 03:10:18,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-08-26 03:10:18,103 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:18,103 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:18,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-26 03:10:18,104 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:18,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:18,104 INFO L82 PathProgramCache]: Analyzing trace with hash 416305772, now seen corresponding path program 1 times [2021-08-26 03:10:18,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:18,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947510559] [2021-08-26 03:10:18,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:18,105 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:18,146 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-08-26 03:10:18,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:18,147 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947510559] [2021-08-26 03:10:18,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947510559] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:18,147 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:18,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:10:18,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126328030] [2021-08-26 03:10:18,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:18,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:18,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:18,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:18,149 INFO L87 Difference]: Start difference. First operand 510 states and 774 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:18,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:18,485 INFO L93 Difference]: Finished difference Result 1084 states and 1624 transitions. [2021-08-26 03:10:18,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:18,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2021-08-26 03:10:18,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:18,489 INFO L225 Difference]: With dead ends: 1084 [2021-08-26 03:10:18,489 INFO L226 Difference]: Without dead ends: 581 [2021-08-26 03:10:18,490 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:18,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2021-08-26 03:10:18,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 510. [2021-08-26 03:10:18,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.5147347740667976) internal successors, (771), 509 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:18,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 771 transitions. [2021-08-26 03:10:18,505 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 771 transitions. Word has length 92 [2021-08-26 03:10:18,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:18,505 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 771 transitions. [2021-08-26 03:10:18,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:18,506 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 771 transitions. [2021-08-26 03:10:18,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-08-26 03:10:18,507 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:18,507 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:18,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-26 03:10:18,507 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:18,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:18,508 INFO L82 PathProgramCache]: Analyzing trace with hash 397650314, now seen corresponding path program 1 times [2021-08-26 03:10:18,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:18,508 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612972970] [2021-08-26 03:10:18,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:18,509 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:18,569 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-08-26 03:10:18,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:18,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612972970] [2021-08-26 03:10:18,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612972970] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:18,570 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:18,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:10:18,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393967148] [2021-08-26 03:10:18,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:18,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:18,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:18,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:18,571 INFO L87 Difference]: Start difference. First operand 510 states and 771 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:18,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:18,875 INFO L93 Difference]: Finished difference Result 1084 states and 1618 transitions. [2021-08-26 03:10:18,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:18,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2021-08-26 03:10:18,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:18,878 INFO L225 Difference]: With dead ends: 1084 [2021-08-26 03:10:18,878 INFO L226 Difference]: Without dead ends: 581 [2021-08-26 03:10:18,879 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:18,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2021-08-26 03:10:18,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 510. [2021-08-26 03:10:18,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.5088408644400786) internal successors, (768), 509 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 768 transitions. [2021-08-26 03:10:18,893 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 768 transitions. Word has length 92 [2021-08-26 03:10:18,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:18,893 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 768 transitions. [2021-08-26 03:10:18,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:18,894 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 768 transitions. [2021-08-26 03:10:18,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-08-26 03:10:18,895 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:18,895 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:18,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-26 03:10:18,895 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:18,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:18,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1569413781, now seen corresponding path program 1 times [2021-08-26 03:10:18,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:18,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744943599] [2021-08-26 03:10:18,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:18,896 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:18,973 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-08-26 03:10:18,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:18,974 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744943599] [2021-08-26 03:10:18,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744943599] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:18,974 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:18,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:10:18,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004827014] [2021-08-26 03:10:18,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:18,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:18,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:18,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:18,976 INFO L87 Difference]: Start difference. First operand 510 states and 768 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:19,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:19,251 INFO L93 Difference]: Finished difference Result 1084 states and 1612 transitions. [2021-08-26 03:10:19,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:19,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-08-26 03:10:19,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:19,254 INFO L225 Difference]: With dead ends: 1084 [2021-08-26 03:10:19,254 INFO L226 Difference]: Without dead ends: 581 [2021-08-26 03:10:19,255 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:19,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2021-08-26 03:10:19,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 510. [2021-08-26 03:10:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.5029469548133596) internal successors, (765), 509 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 765 transitions. [2021-08-26 03:10:19,269 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 765 transitions. Word has length 93 [2021-08-26 03:10:19,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:19,269 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 765 transitions. [2021-08-26 03:10:19,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:19,269 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 765 transitions. [2021-08-26 03:10:19,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-26 03:10:19,271 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:19,271 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:19,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-26 03:10:19,271 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:19,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:19,271 INFO L82 PathProgramCache]: Analyzing trace with hash 993375279, now seen corresponding path program 1 times [2021-08-26 03:10:19,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:19,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631269558] [2021-08-26 03:10:19,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:19,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-08-26 03:10:19,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:19,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631269558] [2021-08-26 03:10:19,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631269558] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:19,321 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:19,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:10:19,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686041099] [2021-08-26 03:10:19,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:19,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:19,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:19,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:19,322 INFO L87 Difference]: Start difference. First operand 510 states and 765 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:19,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:19,591 INFO L93 Difference]: Finished difference Result 1084 states and 1606 transitions. [2021-08-26 03:10:19,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:19,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-08-26 03:10:19,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:19,593 INFO L225 Difference]: With dead ends: 1084 [2021-08-26 03:10:19,593 INFO L226 Difference]: Without dead ends: 581 [2021-08-26 03:10:19,595 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:19,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2021-08-26 03:10:19,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 510. [2021-08-26 03:10:19,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.4970530451866404) internal successors, (762), 509 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:19,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 762 transitions. [2021-08-26 03:10:19,615 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 762 transitions. Word has length 94 [2021-08-26 03:10:19,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:19,615 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 762 transitions. [2021-08-26 03:10:19,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:19,616 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 762 transitions. [2021-08-26 03:10:19,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-08-26 03:10:19,631 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:19,631 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:19,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-26 03:10:19,632 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:19,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:19,632 INFO L82 PathProgramCache]: Analyzing trace with hash 2070050586, now seen corresponding path program 1 times [2021-08-26 03:10:19,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:19,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672693639] [2021-08-26 03:10:19,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:19,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:19,700 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-08-26 03:10:19,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:19,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672693639] [2021-08-26 03:10:19,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672693639] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:19,702 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:19,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:10:19,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338518825] [2021-08-26 03:10:19,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:19,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:19,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:19,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:19,714 INFO L87 Difference]: Start difference. First operand 510 states and 762 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:19,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:19,878 INFO L93 Difference]: Finished difference Result 1057 states and 1567 transitions. [2021-08-26 03:10:19,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:19,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-08-26 03:10:19,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:19,881 INFO L225 Difference]: With dead ends: 1057 [2021-08-26 03:10:19,881 INFO L226 Difference]: Without dead ends: 554 [2021-08-26 03:10:19,882 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:19,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2021-08-26 03:10:19,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 510. [2021-08-26 03:10:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.4911591355599214) internal successors, (759), 509 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:19,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 759 transitions. [2021-08-26 03:10:19,900 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 759 transitions. Word has length 95 [2021-08-26 03:10:19,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:19,900 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 759 transitions. [2021-08-26 03:10:19,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:19,900 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 759 transitions. [2021-08-26 03:10:19,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-08-26 03:10:19,901 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:19,901 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:19,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-26 03:10:19,901 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:19,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:19,902 INFO L82 PathProgramCache]: Analyzing trace with hash -2066779273, now seen corresponding path program 1 times [2021-08-26 03:10:19,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:19,902 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380787824] [2021-08-26 03:10:19,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:19,902 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:19,975 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-08-26 03:10:19,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:19,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380787824] [2021-08-26 03:10:19,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380787824] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:19,976 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:19,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:10:19,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008798278] [2021-08-26 03:10:19,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:19,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:19,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:19,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:19,977 INFO L87 Difference]: Start difference. First operand 510 states and 759 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:20,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:20,275 INFO L93 Difference]: Finished difference Result 1057 states and 1561 transitions. [2021-08-26 03:10:20,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:20,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-08-26 03:10:20,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:20,277 INFO L225 Difference]: With dead ends: 1057 [2021-08-26 03:10:20,277 INFO L226 Difference]: Without dead ends: 554 [2021-08-26 03:10:20,278 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:20,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2021-08-26 03:10:20,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 510. [2021-08-26 03:10:20,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.4852652259332024) internal successors, (756), 509 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 756 transitions. [2021-08-26 03:10:20,289 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 756 transitions. Word has length 95 [2021-08-26 03:10:20,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:20,289 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 756 transitions. [2021-08-26 03:10:20,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:20,289 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 756 transitions. [2021-08-26 03:10:20,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-08-26 03:10:20,290 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:20,290 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:20,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-26 03:10:20,291 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:20,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:20,300 INFO L82 PathProgramCache]: Analyzing trace with hash 952822956, now seen corresponding path program 1 times [2021-08-26 03:10:20,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:20,300 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058911052] [2021-08-26 03:10:20,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:20,300 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-08-26 03:10:20,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:20,352 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058911052] [2021-08-26 03:10:20,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058911052] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:20,352 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:20,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:10:20,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360105332] [2021-08-26 03:10:20,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:20,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:20,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:20,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:20,354 INFO L87 Difference]: Start difference. First operand 510 states and 756 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:20,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:20,565 INFO L93 Difference]: Finished difference Result 1045 states and 1539 transitions. [2021-08-26 03:10:20,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:20,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2021-08-26 03:10:20,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:20,567 INFO L225 Difference]: With dead ends: 1045 [2021-08-26 03:10:20,567 INFO L226 Difference]: Without dead ends: 542 [2021-08-26 03:10:20,568 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:20,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2021-08-26 03:10:20,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 510. [2021-08-26 03:10:20,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.4793713163064832) internal successors, (753), 509 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:20,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 753 transitions. [2021-08-26 03:10:20,576 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 753 transitions. Word has length 96 [2021-08-26 03:10:20,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:20,577 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 753 transitions. [2021-08-26 03:10:20,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:20,577 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 753 transitions. [2021-08-26 03:10:20,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-26 03:10:20,578 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:20,578 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:20,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-26 03:10:20,578 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:20,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:20,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1844388260, now seen corresponding path program 1 times [2021-08-26 03:10:20,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:20,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172000215] [2021-08-26 03:10:20,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:20,579 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:20,618 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-08-26 03:10:20,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:20,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172000215] [2021-08-26 03:10:20,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172000215] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:20,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:20,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 03:10:20,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624553921] [2021-08-26 03:10:20,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 03:10:20,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:20,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 03:10:20,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 03:10:20,621 INFO L87 Difference]: Start difference. First operand 510 states and 753 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:20,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:20,698 INFO L93 Difference]: Finished difference Result 1032 states and 1526 transitions. [2021-08-26 03:10:20,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 03:10:20,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-26 03:10:20,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:20,700 INFO L225 Difference]: With dead ends: 1032 [2021-08-26 03:10:20,700 INFO L226 Difference]: Without dead ends: 675 [2021-08-26 03:10:20,701 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 03:10:20,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2021-08-26 03:10:20,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 673. [2021-08-26 03:10:20,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 672 states have (on average 1.4776785714285714) internal successors, (993), 672 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:20,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 993 transitions. [2021-08-26 03:10:20,711 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 993 transitions. Word has length 98 [2021-08-26 03:10:20,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:20,711 INFO L470 AbstractCegarLoop]: Abstraction has 673 states and 993 transitions. [2021-08-26 03:10:20,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:20,711 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 993 transitions. [2021-08-26 03:10:20,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-26 03:10:20,712 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:20,712 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:20,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-26 03:10:20,712 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:20,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:20,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1703839650, now seen corresponding path program 1 times [2021-08-26 03:10:20,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:20,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305419451] [2021-08-26 03:10:20,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:20,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:20,750 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-08-26 03:10:20,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:20,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305419451] [2021-08-26 03:10:20,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305419451] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:20,751 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:20,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 03:10:20,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714800810] [2021-08-26 03:10:20,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 03:10:20,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:20,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 03:10:20,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 03:10:20,752 INFO L87 Difference]: Start difference. First operand 673 states and 993 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:20,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:20,795 INFO L93 Difference]: Finished difference Result 1191 states and 1757 transitions. [2021-08-26 03:10:20,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 03:10:20,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-26 03:10:20,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:20,797 INFO L225 Difference]: With dead ends: 1191 [2021-08-26 03:10:20,797 INFO L226 Difference]: Without dead ends: 671 [2021-08-26 03:10:20,798 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 03:10:20,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2021-08-26 03:10:20,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2021-08-26 03:10:20,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 670 states have (on average 1.4701492537313432) internal successors, (985), 670 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:20,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 985 transitions. [2021-08-26 03:10:20,822 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 985 transitions. Word has length 98 [2021-08-26 03:10:20,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:20,822 INFO L470 AbstractCegarLoop]: Abstraction has 671 states and 985 transitions. [2021-08-26 03:10:20,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:20,823 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 985 transitions. [2021-08-26 03:10:20,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-26 03:10:20,824 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:20,824 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:20,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-26 03:10:20,825 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:20,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:20,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1223162519, now seen corresponding path program 1 times [2021-08-26 03:10:20,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:20,825 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690416587] [2021-08-26 03:10:20,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:20,826 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:20,884 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-08-26 03:10:20,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:20,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690416587] [2021-08-26 03:10:20,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690416587] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:20,885 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:20,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:10:20,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079365778] [2021-08-26 03:10:20,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:20,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:20,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:20,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:20,887 INFO L87 Difference]: Start difference. First operand 671 states and 985 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:21,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:21,147 INFO L93 Difference]: Finished difference Result 1492 states and 2185 transitions. [2021-08-26 03:10:21,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:21,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-26 03:10:21,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:21,150 INFO L225 Difference]: With dead ends: 1492 [2021-08-26 03:10:21,150 INFO L226 Difference]: Without dead ends: 828 [2021-08-26 03:10:21,150 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:21,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2021-08-26 03:10:21,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 743. [2021-08-26 03:10:21,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 742 states have (on average 1.4973045822102427) internal successors, (1111), 742 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:21,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1111 transitions. [2021-08-26 03:10:21,164 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1111 transitions. Word has length 100 [2021-08-26 03:10:21,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:21,164 INFO L470 AbstractCegarLoop]: Abstraction has 743 states and 1111 transitions. [2021-08-26 03:10:21,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:21,164 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1111 transitions. [2021-08-26 03:10:21,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-08-26 03:10:21,166 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:21,166 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:21,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-26 03:10:21,166 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:21,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:21,167 INFO L82 PathProgramCache]: Analyzing trace with hash -517718612, now seen corresponding path program 1 times [2021-08-26 03:10:21,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:21,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112012760] [2021-08-26 03:10:21,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:21,167 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-08-26 03:10:21,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:21,216 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112012760] [2021-08-26 03:10:21,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112012760] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:21,216 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:21,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:10:21,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207157626] [2021-08-26 03:10:21,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:21,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:21,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:21,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:21,217 INFO L87 Difference]: Start difference. First operand 743 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:21,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:21,482 INFO L93 Difference]: Finished difference Result 1561 states and 2305 transitions. [2021-08-26 03:10:21,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:21,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2021-08-26 03:10:21,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:21,485 INFO L225 Difference]: With dead ends: 1561 [2021-08-26 03:10:21,485 INFO L226 Difference]: Without dead ends: 825 [2021-08-26 03:10:21,487 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2021-08-26 03:10:21,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 743. [2021-08-26 03:10:21,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 742 states have (on average 1.4932614555256065) internal successors, (1108), 742 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:21,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1108 transitions. [2021-08-26 03:10:21,503 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1108 transitions. Word has length 115 [2021-08-26 03:10:21,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:21,503 INFO L470 AbstractCegarLoop]: Abstraction has 743 states and 1108 transitions. [2021-08-26 03:10:21,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:21,503 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1108 transitions. [2021-08-26 03:10:21,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-08-26 03:10:21,505 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:21,505 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:21,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-26 03:10:21,505 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:21,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:21,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1265744566, now seen corresponding path program 1 times [2021-08-26 03:10:21,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:21,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557579305] [2021-08-26 03:10:21,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:21,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-08-26 03:10:21,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:21,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557579305] [2021-08-26 03:10:21,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557579305] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:21,560 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:21,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:10:21,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144105347] [2021-08-26 03:10:21,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:21,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:21,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:21,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:21,562 INFO L87 Difference]: Start difference. First operand 743 states and 1108 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:21,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:21,842 INFO L93 Difference]: Finished difference Result 1561 states and 2299 transitions. [2021-08-26 03:10:21,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:21,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2021-08-26 03:10:21,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:21,846 INFO L225 Difference]: With dead ends: 1561 [2021-08-26 03:10:21,846 INFO L226 Difference]: Without dead ends: 825 [2021-08-26 03:10:21,847 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:21,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2021-08-26 03:10:21,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 743. [2021-08-26 03:10:21,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 742 states have (on average 1.4892183288409704) internal successors, (1105), 742 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:21,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1105 transitions. [2021-08-26 03:10:21,868 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1105 transitions. Word has length 115 [2021-08-26 03:10:21,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:21,868 INFO L470 AbstractCegarLoop]: Abstraction has 743 states and 1105 transitions. [2021-08-26 03:10:21,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:21,869 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1105 transitions. [2021-08-26 03:10:21,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-08-26 03:10:21,870 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:21,870 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:21,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-26 03:10:21,870 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:21,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:21,871 INFO L82 PathProgramCache]: Analyzing trace with hash -849536469, now seen corresponding path program 1 times [2021-08-26 03:10:21,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:21,872 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68124708] [2021-08-26 03:10:21,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:21,872 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-08-26 03:10:21,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:21,916 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68124708] [2021-08-26 03:10:21,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68124708] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:21,916 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:21,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:10:21,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987086637] [2021-08-26 03:10:21,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:21,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:21,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:21,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:21,917 INFO L87 Difference]: Start difference. First operand 743 states and 1105 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:22,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:22,227 INFO L93 Difference]: Finished difference Result 1561 states and 2293 transitions. [2021-08-26 03:10:22,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:22,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2021-08-26 03:10:22,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:22,243 INFO L225 Difference]: With dead ends: 1561 [2021-08-26 03:10:22,243 INFO L226 Difference]: Without dead ends: 825 [2021-08-26 03:10:22,244 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:22,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2021-08-26 03:10:22,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 743. [2021-08-26 03:10:22,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 742 states have (on average 1.4851752021563343) internal successors, (1102), 742 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1102 transitions. [2021-08-26 03:10:22,274 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1102 transitions. Word has length 116 [2021-08-26 03:10:22,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:22,274 INFO L470 AbstractCegarLoop]: Abstraction has 743 states and 1102 transitions. [2021-08-26 03:10:22,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:22,274 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1102 transitions. [2021-08-26 03:10:22,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-08-26 03:10:22,276 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:22,276 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:22,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-26 03:10:22,276 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:22,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:22,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1134529903, now seen corresponding path program 1 times [2021-08-26 03:10:22,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:22,276 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813011969] [2021-08-26 03:10:22,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:22,277 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:22,352 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-08-26 03:10:22,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:22,353 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813011969] [2021-08-26 03:10:22,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813011969] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:22,353 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:22,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:10:22,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61875839] [2021-08-26 03:10:22,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:22,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:22,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:22,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:22,354 INFO L87 Difference]: Start difference. First operand 743 states and 1102 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:22,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:22,605 INFO L93 Difference]: Finished difference Result 1561 states and 2287 transitions. [2021-08-26 03:10:22,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:22,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2021-08-26 03:10:22,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:22,609 INFO L225 Difference]: With dead ends: 1561 [2021-08-26 03:10:22,609 INFO L226 Difference]: Without dead ends: 825 [2021-08-26 03:10:22,610 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:22,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2021-08-26 03:10:22,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 743. [2021-08-26 03:10:22,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 742 states have (on average 1.4811320754716981) internal successors, (1099), 742 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:22,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1099 transitions. [2021-08-26 03:10:22,627 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1099 transitions. Word has length 117 [2021-08-26 03:10:22,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:22,627 INFO L470 AbstractCegarLoop]: Abstraction has 743 states and 1099 transitions. [2021-08-26 03:10:22,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:22,628 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1099 transitions. [2021-08-26 03:10:22,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-08-26 03:10:22,629 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:22,629 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:22,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-26 03:10:22,629 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:22,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:22,631 INFO L82 PathProgramCache]: Analyzing trace with hash 182595248, now seen corresponding path program 1 times [2021-08-26 03:10:22,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:22,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998409204] [2021-08-26 03:10:22,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:22,631 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:22,674 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-08-26 03:10:22,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:22,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998409204] [2021-08-26 03:10:22,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998409204] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:22,675 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:22,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:10:22,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399789950] [2021-08-26 03:10:22,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:22,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:22,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:22,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:22,676 INFO L87 Difference]: Start difference. First operand 743 states and 1099 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:22,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:22,898 INFO L93 Difference]: Finished difference Result 1534 states and 2248 transitions. [2021-08-26 03:10:22,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:22,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2021-08-26 03:10:22,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:22,901 INFO L225 Difference]: With dead ends: 1534 [2021-08-26 03:10:22,901 INFO L226 Difference]: Without dead ends: 798 [2021-08-26 03:10:22,902 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:22,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2021-08-26 03:10:22,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 743. [2021-08-26 03:10:22,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 742 states have (on average 1.477088948787062) internal successors, (1096), 742 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:22,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1096 transitions. [2021-08-26 03:10:22,915 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1096 transitions. Word has length 118 [2021-08-26 03:10:22,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:22,915 INFO L470 AbstractCegarLoop]: Abstraction has 743 states and 1096 transitions. [2021-08-26 03:10:22,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:22,915 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1096 transitions. [2021-08-26 03:10:22,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-08-26 03:10:22,916 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:22,917 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:22,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-26 03:10:22,917 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:22,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:22,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1828816845, now seen corresponding path program 1 times [2021-08-26 03:10:22,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:22,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69264775] [2021-08-26 03:10:22,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:22,918 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:23,001 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 133 proven. 1 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-26 03:10:23,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:23,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69264775] [2021-08-26 03:10:23,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69264775] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:10:23,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207891367] [2021-08-26 03:10:23,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:23,002 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:10:23,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:10:23,004 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:10:23,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-26 03:10:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:23,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-26 03:10:23,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:10:23,338 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-26 03:10:23,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-26 03:10:23,455 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-26 03:10:23,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-08-26 03:10:23,584 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-26 03:10:23,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-26 03:10:23,683 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-26 03:10:23,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-08-26 03:10:23,744 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 113 proven. 39 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-08-26 03:10:23,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207891367] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:10:23,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:10:23,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2021-08-26 03:10:23,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385582702] [2021-08-26 03:10:23,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 03:10:23,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:23,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 03:10:23,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-08-26 03:10:23,746 INFO L87 Difference]: Start difference. First operand 743 states and 1096 transitions. Second operand has 9 states, 9 states have (on average 15.0) internal successors, (135), 9 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:25,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:25,262 INFO L93 Difference]: Finished difference Result 2253 states and 3254 transitions. [2021-08-26 03:10:25,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-26 03:10:25,263 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.0) internal successors, (135), 9 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2021-08-26 03:10:25,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:25,267 INFO L225 Difference]: With dead ends: 2253 [2021-08-26 03:10:25,267 INFO L226 Difference]: Without dead ends: 1517 [2021-08-26 03:10:25,268 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 160.8ms TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2021-08-26 03:10:25,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2021-08-26 03:10:25,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1303. [2021-08-26 03:10:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 1302 states have (on average 1.4746543778801844) internal successors, (1920), 1302 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:25,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 1920 transitions. [2021-08-26 03:10:25,291 INFO L78 Accepts]: Start accepts. Automaton has 1303 states and 1920 transitions. Word has length 118 [2021-08-26 03:10:25,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:25,291 INFO L470 AbstractCegarLoop]: Abstraction has 1303 states and 1920 transitions. [2021-08-26 03:10:25,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.0) internal successors, (135), 9 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:25,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1920 transitions. [2021-08-26 03:10:25,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-08-26 03:10:25,293 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:25,293 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:25,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-26 03:10:25,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-08-26 03:10:25,512 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:25,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:25,512 INFO L82 PathProgramCache]: Analyzing trace with hash 467198890, now seen corresponding path program 1 times [2021-08-26 03:10:25,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:25,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064068740] [2021-08-26 03:10:25,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:25,513 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2021-08-26 03:10:25,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:25,605 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064068740] [2021-08-26 03:10:25,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064068740] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:25,605 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:25,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:10:25,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927299102] [2021-08-26 03:10:25,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:25,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:25,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:25,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:25,607 INFO L87 Difference]: Start difference. First operand 1303 states and 1920 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:25,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:25,844 INFO L93 Difference]: Finished difference Result 2700 states and 3962 transitions. [2021-08-26 03:10:25,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:25,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-08-26 03:10:25,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:25,849 INFO L225 Difference]: With dead ends: 2700 [2021-08-26 03:10:25,849 INFO L226 Difference]: Without dead ends: 1404 [2021-08-26 03:10:25,851 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:25,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2021-08-26 03:10:25,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1317. [2021-08-26 03:10:25,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1316 states have (on average 1.4817629179331306) internal successors, (1950), 1316 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:25,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1950 transitions. [2021-08-26 03:10:25,875 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1950 transitions. Word has length 119 [2021-08-26 03:10:25,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:25,876 INFO L470 AbstractCegarLoop]: Abstraction has 1317 states and 1950 transitions. [2021-08-26 03:10:25,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1950 transitions. [2021-08-26 03:10:25,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-26 03:10:25,878 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:25,878 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:25,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-26 03:10:25,878 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:25,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:25,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1731483519, now seen corresponding path program 1 times [2021-08-26 03:10:25,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:25,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059301299] [2021-08-26 03:10:25,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:25,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:25,919 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-08-26 03:10:25,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:25,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059301299] [2021-08-26 03:10:25,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059301299] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:25,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:25,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:10:25,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629349147] [2021-08-26 03:10:25,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:25,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:25,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:25,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:25,921 INFO L87 Difference]: Start difference. First operand 1317 states and 1950 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:26,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:26,284 INFO L93 Difference]: Finished difference Result 2894 states and 4266 transitions. [2021-08-26 03:10:26,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:26,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2021-08-26 03:10:26,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:26,289 INFO L225 Difference]: With dead ends: 2894 [2021-08-26 03:10:26,289 INFO L226 Difference]: Without dead ends: 1584 [2021-08-26 03:10:26,292 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:26,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2021-08-26 03:10:26,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1321. [2021-08-26 03:10:26,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1320 states have (on average 1.4803030303030302) internal successors, (1954), 1320 states have internal predecessors, (1954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:26,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1954 transitions. [2021-08-26 03:10:26,318 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1954 transitions. Word has length 120 [2021-08-26 03:10:26,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:26,318 INFO L470 AbstractCegarLoop]: Abstraction has 1321 states and 1954 transitions. [2021-08-26 03:10:26,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:26,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1954 transitions. [2021-08-26 03:10:26,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-08-26 03:10:26,321 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:26,321 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:26,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-26 03:10:26,321 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:26,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:26,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1820752595, now seen corresponding path program 1 times [2021-08-26 03:10:26,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:26,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755523623] [2021-08-26 03:10:26,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:26,322 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:26,428 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2021-08-26 03:10:26,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:26,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755523623] [2021-08-26 03:10:26,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755523623] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:26,429 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:26,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:10:26,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147404760] [2021-08-26 03:10:26,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:26,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:26,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:26,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:26,430 INFO L87 Difference]: Start difference. First operand 1321 states and 1954 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:26,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:26,711 INFO L93 Difference]: Finished difference Result 2639 states and 3902 transitions. [2021-08-26 03:10:26,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:26,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2021-08-26 03:10:26,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:26,716 INFO L225 Difference]: With dead ends: 2639 [2021-08-26 03:10:26,716 INFO L226 Difference]: Without dead ends: 1325 [2021-08-26 03:10:26,717 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:26,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2021-08-26 03:10:26,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1324. [2021-08-26 03:10:26,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1323 states have (on average 1.4792139077853363) internal successors, (1957), 1323 states have internal predecessors, (1957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:26,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1957 transitions. [2021-08-26 03:10:26,738 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1957 transitions. Word has length 122 [2021-08-26 03:10:26,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:26,738 INFO L470 AbstractCegarLoop]: Abstraction has 1324 states and 1957 transitions. [2021-08-26 03:10:26,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:26,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1957 transitions. [2021-08-26 03:10:26,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-08-26 03:10:26,740 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:26,740 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:26,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-26 03:10:26,740 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:26,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:26,741 INFO L82 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2021-08-26 03:10:26,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:26,741 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827254155] [2021-08-26 03:10:26,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:26,741 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 03:10:26,833 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 03:10:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 03:10:27,067 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 03:10:27,067 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 03:10:27,068 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:10:27,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-26 03:10:27,075 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 03:10:27,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:10:27 BoogieIcfgContainer [2021-08-26 03:10:27,174 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 03:10:27,174 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 03:10:27,174 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 03:10:27,174 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 03:10:27,175 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:10:13" (3/4) ... [2021-08-26 03:10:27,177 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-26 03:10:27,177 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 03:10:27,178 INFO L168 Benchmark]: Toolchain (without parser) took 14672.66 ms. Allocated memory was 65.0 MB in the beginning and 272.6 MB in the end (delta: 207.6 MB). Free memory was 48.3 MB in the beginning and 197.8 MB in the end (delta: -149.4 MB). Peak memory consumption was 57.3 MB. Max. memory is 16.1 GB. [2021-08-26 03:10:27,179 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 50.3 MB. Free memory was 31.9 MB in the beginning and 31.9 MB in the end (delta: 21.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 03:10:27,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.73 ms. Allocated memory is still 65.0 MB. Free memory was 48.2 MB in the beginning and 43.0 MB in the end (delta: 5.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 16.1 GB. [2021-08-26 03:10:27,179 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.43 ms. Allocated memory is still 65.0 MB. Free memory was 43.0 MB in the beginning and 38.6 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 03:10:27,179 INFO L168 Benchmark]: Boogie Preprocessor took 42.49 ms. Allocated memory is still 65.0 MB. Free memory was 38.6 MB in the beginning and 32.0 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-26 03:10:27,179 INFO L168 Benchmark]: RCFGBuilder took 946.46 ms. Allocated memory was 65.0 MB in the beginning and 94.4 MB in the end (delta: 29.4 MB). Free memory was 32.0 MB in the beginning and 55.8 MB in the end (delta: -23.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 16.1 GB. [2021-08-26 03:10:27,180 INFO L168 Benchmark]: TraceAbstraction took 13272.84 ms. Allocated memory was 94.4 MB in the beginning and 272.6 MB in the end (delta: 178.3 MB). Free memory was 55.2 MB in the beginning and 197.8 MB in the end (delta: -142.6 MB). Peak memory consumption was 153.7 MB. Max. memory is 16.1 GB. [2021-08-26 03:10:27,180 INFO L168 Benchmark]: Witness Printer took 3.15 ms. Allocated memory is still 272.6 MB. Free memory is still 197.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 03:10:27,182 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.14 ms. Allocated memory is still 50.3 MB. Free memory was 31.9 MB in the beginning and 31.9 MB in the end (delta: 21.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 359.73 ms. Allocated memory is still 65.0 MB. Free memory was 48.2 MB in the beginning and 43.0 MB in the end (delta: 5.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 43.43 ms. Allocated memory is still 65.0 MB. Free memory was 43.0 MB in the beginning and 38.6 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 42.49 ms. Allocated memory is still 65.0 MB. Free memory was 38.6 MB in the beginning and 32.0 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 946.46 ms. Allocated memory was 65.0 MB in the beginning and 94.4 MB in the end (delta: 29.4 MB). Free memory was 32.0 MB in the beginning and 55.8 MB in the end (delta: -23.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 13272.84 ms. Allocated memory was 94.4 MB in the beginning and 272.6 MB in the end (delta: 178.3 MB). Free memory was 55.2 MB in the beginning and 197.8 MB in the end (delta: -142.6 MB). Peak memory consumption was 153.7 MB. Max. memory is 16.1 GB. * Witness Printer took 3.15 ms. Allocated memory is still 272.6 MB. Free memory is still 197.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1647]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1332. Possible FailurePath: [L1041] static int init = 1; [L1042] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={8:0}] [L1064] SSL *s ; [L1068] s = malloc (sizeof (SSL)) [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->state = 12292 [L1072] s->version = __VERIFIER_nondet_int() [L1079] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1080] unsigned long tmp ; [L1081] unsigned long l ; [L1082] long num1 ; [L1083] void (*cb)() ; [L1084] int ret ; [L1085] int new_state ; [L1086] int state ; [L1087] int skip ; [L1088] int *tmp___0 ; [L1089] int tmp___1 = __VERIFIER_nondet_int(); [L1090] int tmp___2 = __VERIFIER_nondet_int(); [L1091] int tmp___3 ; [L1092] int tmp___4 ; [L1093] int tmp___5 ; [L1094] int tmp___6 ; [L1095] int tmp___7 ; [L1096] int tmp___8 ; [L1097] long tmp___9 ; [L1099] int blastFlag ; [L1102] blastFlag = 0 [L1103] s->state = 12292 [L1104] s->hit = __VERIFIER_nondet_int() [L1106] tmp = __VERIFIER_nondet_int() [L1107] cb = (void (*)())((void *)0) [L1108] ret = -1 [L1109] skip = 0 [L1110] tmp___0 = (int*)malloc(sizeof(int)) [L1111] *tmp___0 = 0 [L1112] EXPR s->info_callback VAL [init=1, SSLv3_client_data={8:0}] [L1112] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1113] EXPR s->info_callback [L1113] cb = s->info_callback [L1121] EXPR s->in_handshake [L1121] s->in_handshake += 1 [L1122] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={8:0}] [L1132] COND TRUE 1 VAL [init=1, SSLv3_client_data={8:0}] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1135] COND TRUE s->state == 12292 [L1238] s->new_session = 1 [L1239] s->state = 4096 [L1240] EXPR s->ctx [L1240] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1240] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1245] s->server = 0 VAL [init=1, SSLv3_client_data={8:0}] [L1246] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={8:0}] [L1251] EXPR s->version VAL [init=1, SSLv3_client_data={8:0}] [L1251] COND FALSE !((s->version & 65280) != 768) [L1257] s->type = 4096 [L1258] EXPR s->init_buf VAL [init=1, SSLv3_client_data={8:0}] [L1258] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1270] tmp___4 = __VERIFIER_nondet_int() [L1271] COND FALSE !(! tmp___4) [L1277] tmp___5 = __VERIFIER_nondet_int() [L1278] COND FALSE !(! tmp___5) [L1284] s->state = 4368 [L1285] EXPR s->ctx [L1285] EXPR (s->ctx)->stats.sess_connect [L1285] (s->ctx)->stats.sess_connect += 1 [L1286] s->init_num = 0 VAL [init=1, SSLv3_client_data={8:0}] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={8:0}] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [init=1, SSLv3_client_data={8:0}] [L1132] COND TRUE 1 VAL [init=1, SSLv3_client_data={8:0}] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1150] COND TRUE s->state == 4368 [L1290] s->shutdown = 0 [L1291] ret = __VERIFIER_nondet_int() [L1292] COND TRUE blastFlag == 0 [L1293] blastFlag = 1 VAL [init=1, SSLv3_client_data={8:0}] [L1297] COND FALSE !(ret <= 0) [L1302] s->state = 4384 [L1303] s->init_num = 0 [L1304] EXPR s->bbio [L1304] EXPR s->wbio VAL [init=1, SSLv3_client_data={8:0}] [L1304] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={8:0}] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [init=1, SSLv3_client_data={8:0}] [L1132] COND TRUE 1 VAL [init=1, SSLv3_client_data={8:0}] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1156] COND TRUE s->state == 4384 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 1 [L1314] blastFlag = 2 VAL [init=1, SSLv3_client_data={8:0}] [L1318] COND FALSE !(ret <= 0) [L1323] s->hit VAL [init=1, SSLv3_client_data={8:0}] [L1323] COND FALSE !(s->hit) [L1326] s->state = 4400 VAL [init=1, SSLv3_client_data={8:0}] [L1328] s->init_num = 0 VAL [init=1, SSLv3_client_data={8:0}] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={8:0}] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [init=1, SSLv3_client_data={8:0}] [L1132] COND TRUE 1 VAL [init=1, SSLv3_client_data={8:0}] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1156] COND FALSE !(s->state == 4384) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1159] COND FALSE !(s->state == 4385) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1162] COND TRUE s->state == 4400 [L1332] EXPR s->s3 [L1332] EXPR (s->s3)->tmp.new_cipher [L1332] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={8:0}] [L1332] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1335] ret = __VERIFIER_nondet_int() [L1336] COND TRUE blastFlag == 2 [L1337] blastFlag = 3 VAL [init=1, SSLv3_client_data={8:0}] [L1341] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={8:0}] [L1347] s->state = 4416 [L1348] s->init_num = 0 VAL [init=1, SSLv3_client_data={8:0}] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={8:0}] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [init=1, SSLv3_client_data={8:0}] [L1132] COND TRUE 1 VAL [init=1, SSLv3_client_data={8:0}] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1156] COND FALSE !(s->state == 4384) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1159] COND FALSE !(s->state == 4385) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1162] COND FALSE !(s->state == 4400) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1165] COND FALSE !(s->state == 4401) [L1168] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1168] COND TRUE s->state == 4416 [L1352] ret = __VERIFIER_nondet_int() [L1353] COND TRUE blastFlag == 3 [L1354] blastFlag = 4 VAL [init=1, SSLv3_client_data={8:0}] [L1358] COND FALSE !(ret <= 0) [L1363] s->state = 4432 [L1364] s->init_num = 0 [L1365] tmp___6 = __VERIFIER_nondet_int() [L1366] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={8:0}] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={8:0}] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [init=1, SSLv3_client_data={8:0}] [L1132] COND TRUE 1 VAL [init=1, SSLv3_client_data={8:0}] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1156] COND FALSE !(s->state == 4384) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1159] COND FALSE !(s->state == 4385) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1162] COND FALSE !(s->state == 4400) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1165] COND FALSE !(s->state == 4401) [L1168] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1168] COND FALSE !(s->state == 4416) [L1171] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1171] COND FALSE !(s->state == 4417) [L1174] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1174] COND TRUE s->state == 4432 [L1375] ret = __VERIFIER_nondet_int() [L1376] COND FALSE !(blastFlag == 5) VAL [init=1, SSLv3_client_data={8:0}] [L1381] COND FALSE !(ret <= 0) [L1386] s->state = 4448 [L1387] s->init_num = 0 VAL [init=1, SSLv3_client_data={8:0}] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={8:0}] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [init=1, SSLv3_client_data={8:0}] [L1132] COND TRUE 1 VAL [init=1, SSLv3_client_data={8:0}] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1156] COND FALSE !(s->state == 4384) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1159] COND FALSE !(s->state == 4385) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1162] COND FALSE !(s->state == 4400) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1165] COND FALSE !(s->state == 4401) [L1168] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1168] COND FALSE !(s->state == 4416) [L1171] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1171] COND FALSE !(s->state == 4417) [L1174] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1174] COND FALSE !(s->state == 4432) [L1177] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1177] COND FALSE !(s->state == 4433) [L1180] EXPR s->state VAL [init=1, SSLv3_client_data={8:0}] [L1180] COND TRUE s->state == 4448 [L1391] ret = __VERIFIER_nondet_int() [L1392] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={8:0}] [L1647] reach_error() VAL [init=1, SSLv3_client_data={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13141.2ms, OverallIterations: 31, TraceHistogramMax: 7, EmptinessCheckTime: 72.9ms, AutomataDifference: 8948.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 6589 SDtfs, 1802 SDslu, 9420 SDs, 0 SdLazy, 5137 SolverSat, 177 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6705.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 176 SyntacticMatches, 7 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 433.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1324occurred in iteration=30, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 468.9ms AutomataMinimizationTime, 30 MinimizatonAttempts, 1818 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 176.9ms SsaConstructionTime, 765.9ms SatisfiabilityAnalysisTime, 1859.6ms InterpolantComputationTime, 2875 NumberOfCodeBlocks, 2875 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2707 ConstructedInterpolants, 0 QuantifiedInterpolants, 6452 SizeOfPredicates, 4 NumberOfNonLiveVariables, 493 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 31 InterpolantComputations, 29 PerfectInterpolantSequences, 3026/3066 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 could not prove your program: unable to determine feasibility of some traces [2021-08-26 03:10:27,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 03:10:29,163 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 03:10:29,165 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 03:10:29,198 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 03:10:29,199 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 03:10:29,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 03:10:29,203 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 03:10:29,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 03:10:29,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 03:10:29,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 03:10:29,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 03:10:29,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 03:10:29,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 03:10:29,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 03:10:29,225 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 03:10:29,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 03:10:29,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 03:10:29,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 03:10:29,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 03:10:29,233 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 03:10:29,236 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 03:10:29,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 03:10:29,238 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 03:10:29,239 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 03:10:29,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 03:10:29,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 03:10:29,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 03:10:29,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 03:10:29,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 03:10:29,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 03:10:29,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 03:10:29,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 03:10:29,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 03:10:29,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 03:10:29,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 03:10:29,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 03:10:29,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 03:10:29,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 03:10:29,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 03:10:29,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 03:10:29,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 03:10:29,253 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-08-26 03:10:29,280 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 03:10:29,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 03:10:29,281 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 03:10:29,281 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 03:10:29,282 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 03:10:29,283 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 03:10:29,283 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 03:10:29,283 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 03:10:29,283 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 03:10:29,283 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 03:10:29,284 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 03:10:29,284 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 03:10:29,284 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 03:10:29,284 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 03:10:29,285 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-26 03:10:29,285 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-26 03:10:29,285 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 03:10:29,285 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 03:10:29,285 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 03:10:29,285 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 03:10:29,285 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 03:10:29,286 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 03:10:29,286 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 03:10:29,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 03:10:29,286 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 03:10:29,286 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 03:10:29,286 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 03:10:29,287 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-26 03:10:29,287 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-26 03:10:29,287 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 03:10:29,287 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 03:10:29,287 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-26 03:10:29,287 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d18b16a91281a6c3ff97c6a6bee0acf1ccb6bd91 [2021-08-26 03:10:29,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 03:10:29,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 03:10:29,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 03:10:29,577 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 03:10:29,578 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 03:10:29,579 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/s3.i [2021-08-26 03:10:29,646 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/869db0fc6/cf410fa7f7f644708400fe6bf7068c0b/FLAGf40b6a3d1 [2021-08-26 03:10:30,087 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 03:10:30,095 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/s3.i [2021-08-26 03:10:30,115 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/869db0fc6/cf410fa7f7f644708400fe6bf7068c0b/FLAGf40b6a3d1 [2021-08-26 03:10:30,128 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/869db0fc6/cf410fa7f7f644708400fe6bf7068c0b [2021-08-26 03:10:30,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 03:10:30,132 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 03:10:30,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 03:10:30,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 03:10:30,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 03:10:30,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:10:30" (1/1) ... [2021-08-26 03:10:30,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31a58b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:30, skipping insertion in model container [2021-08-26 03:10:30,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:10:30" (1/1) ... [2021-08-26 03:10:30,141 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 03:10:30,181 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 03:10:30,456 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/s3.i[63567,63580] [2021-08-26 03:10:30,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 03:10:30,473 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 03:10:30,545 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/s3.i[63567,63580] [2021-08-26 03:10:30,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 03:10:30,559 INFO L208 MainTranslator]: Completed translation [2021-08-26 03:10:30,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:30 WrapperNode [2021-08-26 03:10:30,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 03:10:30,561 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 03:10:30,561 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 03:10:30,561 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 03:10:30,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:30" (1/1) ... [2021-08-26 03:10:30,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:30" (1/1) ... [2021-08-26 03:10:30,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 03:10:30,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 03:10:30,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 03:10:30,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 03:10:30,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:30" (1/1) ... [2021-08-26 03:10:30,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:30" (1/1) ... [2021-08-26 03:10:30,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:30" (1/1) ... [2021-08-26 03:10:30,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:30" (1/1) ... [2021-08-26 03:10:30,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:30" (1/1) ... [2021-08-26 03:10:30,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:30" (1/1) ... [2021-08-26 03:10:30,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:30" (1/1) ... [2021-08-26 03:10:30,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 03:10:30,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 03:10:30,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 03:10:30,664 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 03:10:30,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:30" (1/1) ... [2021-08-26 03:10:30,670 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 03:10:30,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:10:30,683 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 03:10:30,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 03:10:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-26 03:10:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-26 03:10:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 03:10:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-26 03:10:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-26 03:10:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-26 03:10:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 03:10:30,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 03:10:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-26 03:10:30,934 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-26 03:10:33,390 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-08-26 03:10:33,390 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-08-26 03:10:33,395 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 03:10:33,396 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-26 03:10:33,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:10:33 BoogieIcfgContainer [2021-08-26 03:10:33,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 03:10:33,399 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 03:10:33,399 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 03:10:33,401 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 03:10:33,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:10:30" (1/3) ... [2021-08-26 03:10:33,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321008a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:10:33, skipping insertion in model container [2021-08-26 03:10:33,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:30" (2/3) ... [2021-08-26 03:10:33,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321008a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:10:33, skipping insertion in model container [2021-08-26 03:10:33,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:10:33" (3/3) ... [2021-08-26 03:10:33,405 INFO L111 eAbstractionObserver]: Analyzing ICFG s3.i [2021-08-26 03:10:33,409 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 03:10:33,410 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 03:10:33,451 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 03:10:33,456 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 03:10:33,456 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 03:10:33,470 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:33,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-26 03:10:33,474 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:33,474 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:33,475 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:33,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:33,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2021-08-26 03:10:33,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 03:10:33,487 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790604823] [2021-08-26 03:10:33,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:33,488 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 03:10:33,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 03:10:33,491 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 03:10:33,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-26 03:10:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:33,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-26 03:10:33,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:10:33,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:10:33,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 03:10:34,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:10:34,081 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 03:10:34,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790604823] [2021-08-26 03:10:34,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790604823] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:34,083 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:34,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-26 03:10:34,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969402679] [2021-08-26 03:10:34,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:34,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 03:10:34,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:34,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:34,106 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:34,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:34,200 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2021-08-26 03:10:34,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:34,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-08-26 03:10:34,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:34,209 INFO L225 Difference]: With dead ends: 375 [2021-08-26 03:10:34,213 INFO L226 Difference]: Without dead ends: 217 [2021-08-26 03:10:34,216 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:34,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-08-26 03:10:34,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-08-26 03:10:34,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.4814814814814814) internal successors, (320), 216 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:34,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 320 transitions. [2021-08-26 03:10:34,254 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 320 transitions. Word has length 24 [2021-08-26 03:10:34,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:34,254 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 320 transitions. [2021-08-26 03:10:34,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:34,254 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 320 transitions. [2021-08-26 03:10:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-26 03:10:34,256 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:34,256 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:34,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-08-26 03:10:34,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 03:10:34,468 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:34,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:34,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1495258694, now seen corresponding path program 1 times [2021-08-26 03:10:34,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 03:10:34,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954825665] [2021-08-26 03:10:34,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:34,473 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 03:10:34,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 03:10:34,474 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 03:10:34,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-26 03:10:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:34,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-26 03:10:34,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:10:34,836 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:10:34,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 03:10:34,957 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:10:34,958 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 03:10:34,958 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954825665] [2021-08-26 03:10:34,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954825665] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:34,958 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:34,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-26 03:10:34,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257363493] [2021-08-26 03:10:34,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:34,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 03:10:34,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:34,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:34,961 INFO L87 Difference]: Start difference. First operand 217 states and 320 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:36,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:36,588 INFO L93 Difference]: Finished difference Result 528 states and 787 transitions. [2021-08-26 03:10:36,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:36,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-08-26 03:10:36,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:36,591 INFO L225 Difference]: With dead ends: 528 [2021-08-26 03:10:36,591 INFO L226 Difference]: Without dead ends: 421 [2021-08-26 03:10:36,592 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:36,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2021-08-26 03:10:36,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2021-08-26 03:10:36,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.480952380952381) internal successors, (622), 420 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:36,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 622 transitions. [2021-08-26 03:10:36,609 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 622 transitions. Word has length 41 [2021-08-26 03:10:36,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:36,609 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 622 transitions. [2021-08-26 03:10:36,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:36,610 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 622 transitions. [2021-08-26 03:10:36,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-26 03:10:36,612 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:36,612 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:36,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-08-26 03:10:36,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 03:10:36,821 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:36,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:36,821 INFO L82 PathProgramCache]: Analyzing trace with hash 924360661, now seen corresponding path program 1 times [2021-08-26 03:10:36,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 03:10:36,822 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029584780] [2021-08-26 03:10:36,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:36,822 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 03:10:36,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 03:10:36,828 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 03:10:36,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-26 03:10:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:37,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-26 03:10:37,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:10:37,258 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-26 03:10:37,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 03:10:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-26 03:10:37,465 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 03:10:37,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029584780] [2021-08-26 03:10:37,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029584780] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:37,466 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:37,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-26 03:10:37,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524286895] [2021-08-26 03:10:37,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:37,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 03:10:37,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:37,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:37,468 INFO L87 Difference]: Start difference. First operand 421 states and 622 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:39,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:39,553 INFO L93 Difference]: Finished difference Result 939 states and 1394 transitions. [2021-08-26 03:10:39,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:39,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-08-26 03:10:39,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:39,556 INFO L225 Difference]: With dead ends: 939 [2021-08-26 03:10:39,556 INFO L226 Difference]: Without dead ends: 628 [2021-08-26 03:10:39,557 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:39,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2021-08-26 03:10:39,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2021-08-26 03:10:39,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 1.4784688995215312) internal successors, (927), 627 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:39,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 927 transitions. [2021-08-26 03:10:39,576 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 927 transitions. Word has length 80 [2021-08-26 03:10:39,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:39,576 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 927 transitions. [2021-08-26 03:10:39,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:39,576 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 927 transitions. [2021-08-26 03:10:39,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-26 03:10:39,580 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:39,580 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:39,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-26 03:10:39,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 03:10:39,789 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:39,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:39,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1855651051, now seen corresponding path program 1 times [2021-08-26 03:10:39,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 03:10:39,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084957323] [2021-08-26 03:10:39,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:39,791 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 03:10:39,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 03:10:39,791 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 03:10:39,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-26 03:10:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:40,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-26 03:10:40,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:10:40,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-26 03:10:40,267 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-26 03:10:40,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-08-26 03:10:40,480 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-26 03:10:40,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-08-26 03:10:40,633 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-26 03:10:40,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 03:10:40,976 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-26 03:10:40,977 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 03:10:40,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084957323] [2021-08-26 03:10:40,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084957323] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:40,977 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:40,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2021-08-26 03:10:40,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91835188] [2021-08-26 03:10:40,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 03:10:40,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 03:10:40,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 03:10:40,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:10:40,979 INFO L87 Difference]: Start difference. First operand 628 states and 927 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:51,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:51,387 INFO L93 Difference]: Finished difference Result 2264 states and 3359 transitions. [2021-08-26 03:10:51,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 03:10:51,389 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-26 03:10:51,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:51,395 INFO L225 Difference]: With dead ends: 2264 [2021-08-26 03:10:51,395 INFO L226 Difference]: Without dead ends: 1643 [2021-08-26 03:10:51,399 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 80.0ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-26 03:10:51,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2021-08-26 03:10:51,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 753. [2021-08-26 03:10:51,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 752 states have (on average 1.5106382978723405) internal successors, (1136), 752 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1136 transitions. [2021-08-26 03:10:51,436 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1136 transitions. Word has length 100 [2021-08-26 03:10:51,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:51,438 INFO L470 AbstractCegarLoop]: Abstraction has 753 states and 1136 transitions. [2021-08-26 03:10:51,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:51,438 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1136 transitions. [2021-08-26 03:10:51,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-26 03:10:51,448 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:51,448 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:51,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-26 03:10:51,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 03:10:51,659 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:51,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:51,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1223162519, now seen corresponding path program 1 times [2021-08-26 03:10:51,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 03:10:51,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822601619] [2021-08-26 03:10:51,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:51,661 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 03:10:51,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 03:10:51,662 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 03:10:51,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-26 03:10:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:52,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 03:10:52,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:10:52,255 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-26 03:10:52,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-26 03:10:52,499 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-26 03:10:52,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-08-26 03:10:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-08-26 03:10:52,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 03:10:52,802 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-08-26 03:10:52,803 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 03:10:52,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822601619] [2021-08-26 03:10:52,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822601619] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:52,808 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:52,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-08-26 03:10:52,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336556505] [2021-08-26 03:10:52,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:10:52,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 03:10:52,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:10:52,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:52,810 INFO L87 Difference]: Start difference. First operand 753 states and 1136 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:56,367 INFO L93 Difference]: Finished difference Result 1757 states and 2634 transitions. [2021-08-26 03:10:56,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:56,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-26 03:10:56,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:56,374 INFO L225 Difference]: With dead ends: 1757 [2021-08-26 03:10:56,374 INFO L226 Difference]: Without dead ends: 1011 [2021-08-26 03:10:56,375 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.7ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:10:56,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2021-08-26 03:10:56,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 873. [2021-08-26 03:10:56,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 872 states have (on average 1.5378440366972477) internal successors, (1341), 872 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:56,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1341 transitions. [2021-08-26 03:10:56,410 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1341 transitions. Word has length 100 [2021-08-26 03:10:56,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:56,411 INFO L470 AbstractCegarLoop]: Abstraction has 873 states and 1341 transitions. [2021-08-26 03:10:56,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:56,412 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1341 transitions. [2021-08-26 03:10:56,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-08-26 03:10:56,414 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:56,414 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:56,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-26 03:10:56,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 03:10:56,625 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:56,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:56,625 INFO L82 PathProgramCache]: Analyzing trace with hash -517718612, now seen corresponding path program 1 times [2021-08-26 03:10:56,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 03:10:56,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787495727] [2021-08-26 03:10:56,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:56,626 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 03:10:56,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 03:10:56,627 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 03:10:56,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-26 03:10:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:57,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 03:10:57,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:10:57,292 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-26 03:10:57,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-26 03:10:57,373 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-26 03:10:57,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-08-26 03:10:57,472 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-08-26 03:10:57,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 03:10:57,775 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-08-26 03:10:57,776 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 03:10:57,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787495727] [2021-08-26 03:10:57,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1787495727] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:57,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:57,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 03:10:57,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039477253] [2021-08-26 03:10:57,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:10:57,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 03:10:57,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:10:57,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:10:57,778 INFO L87 Difference]: Start difference. First operand 873 states and 1341 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:11:03,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:11:03,721 INFO L93 Difference]: Finished difference Result 2405 states and 3628 transitions. [2021-08-26 03:11:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:11:03,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2021-08-26 03:11:03,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:11:03,726 INFO L225 Difference]: With dead ends: 2405 [2021-08-26 03:11:03,727 INFO L226 Difference]: Without dead ends: 1539 [2021-08-26 03:11:03,728 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 63.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:11:03,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2021-08-26 03:11:03,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 931. [2021-08-26 03:11:03,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 930 states have (on average 1.5204301075268818) internal successors, (1414), 930 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:11:03,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1414 transitions. [2021-08-26 03:11:03,771 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1414 transitions. Word has length 115 [2021-08-26 03:11:03,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:11:03,771 INFO L470 AbstractCegarLoop]: Abstraction has 931 states and 1414 transitions. [2021-08-26 03:11:03,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:11:03,771 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1414 transitions. [2021-08-26 03:11:03,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-08-26 03:11:03,773 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:11:03,773 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:11:03,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-26 03:11:03,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 03:11:03,984 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:11:03,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:11:03,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1265744566, now seen corresponding path program 1 times [2021-08-26 03:11:03,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 03:11:03,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495791363] [2021-08-26 03:11:03,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:11:03,985 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 03:11:03,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 03:11:03,986 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 03:11:03,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-26 03:11:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:11:04,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 03:11:04,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:11:04,715 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-26 03:11:04,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-26 03:11:04,822 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-26 03:11:04,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-08-26 03:11:04,904 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-08-26 03:11:04,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 03:11:05,187 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-08-26 03:11:05,188 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 03:11:05,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495791363] [2021-08-26 03:11:05,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495791363] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 03:11:05,188 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:11:05,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 03:11:05,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714711561] [2021-08-26 03:11:05,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:11:05,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 03:11:05,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:11:05,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:11:05,190 INFO L87 Difference]: Start difference. First operand 931 states and 1414 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:11:12,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:11:12,800 INFO L93 Difference]: Finished difference Result 2452 states and 3665 transitions. [2021-08-26 03:11:12,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:11:12,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2021-08-26 03:11:12,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:11:12,806 INFO L225 Difference]: With dead ends: 2452 [2021-08-26 03:11:12,806 INFO L226 Difference]: Without dead ends: 1531 [2021-08-26 03:11:12,809 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 54.1ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:11:12,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2021-08-26 03:11:12,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 936. [2021-08-26 03:11:12,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 935 states have (on average 1.5058823529411764) internal successors, (1408), 935 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:11:12,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1408 transitions. [2021-08-26 03:11:12,848 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1408 transitions. Word has length 115 [2021-08-26 03:11:12,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:11:12,848 INFO L470 AbstractCegarLoop]: Abstraction has 936 states and 1408 transitions. [2021-08-26 03:11:12,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:11:12,849 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1408 transitions. [2021-08-26 03:11:12,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-08-26 03:11:12,850 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:11:12,851 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:11:12,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-26 03:11:13,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 03:11:13,063 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:11:13,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:11:13,063 INFO L82 PathProgramCache]: Analyzing trace with hash -647023955, now seen corresponding path program 1 times [2021-08-26 03:11:13,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 03:11:13,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14338976] [2021-08-26 03:11:13,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:11:13,064 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 03:11:13,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 03:11:13,065 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 03:11:13,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-26 03:11:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:11:13,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 03:11:13,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:11:13,797 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-26 03:11:13,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-26 03:11:13,936 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-26 03:11:13,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-08-26 03:11:14,018 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-08-26 03:11:14,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 03:11:14,312 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-08-26 03:11:14,312 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 03:11:14,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [14338976] [2021-08-26 03:11:14,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [14338976] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 03:11:14,312 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:11:14,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 03:11:14,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902615475] [2021-08-26 03:11:14,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:11:14,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 03:11:14,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:11:14,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:11:14,314 INFO L87 Difference]: Start difference. First operand 936 states and 1408 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:11:21,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:11:21,274 INFO L93 Difference]: Finished difference Result 2419 states and 3598 transitions. [2021-08-26 03:11:21,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:11:21,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2021-08-26 03:11:21,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:11:21,281 INFO L225 Difference]: With dead ends: 2419 [2021-08-26 03:11:21,281 INFO L226 Difference]: Without dead ends: 1651 [2021-08-26 03:11:21,282 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 61.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:11:21,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2021-08-26 03:11:21,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1052. [2021-08-26 03:11:21,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.5052331113225499) internal successors, (1582), 1051 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:11:21,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1582 transitions. [2021-08-26 03:11:21,309 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1582 transitions. Word has length 115 [2021-08-26 03:11:21,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:11:21,309 INFO L470 AbstractCegarLoop]: Abstraction has 1052 states and 1582 transitions. [2021-08-26 03:11:21,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:11:21,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1582 transitions. [2021-08-26 03:11:21,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-08-26 03:11:21,311 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:11:21,311 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:11:21,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-08-26 03:11:21,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 03:11:21,522 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:11:21,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:11:21,523 INFO L82 PathProgramCache]: Analyzing trace with hash 336272896, now seen corresponding path program 1 times [2021-08-26 03:11:21,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 03:11:21,523 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634307493] [2021-08-26 03:11:21,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:11:21,524 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 03:11:21,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 03:11:21,525 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 03:11:21,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-26 03:11:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:11:22,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 03:11:22,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:11:22,341 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-26 03:11:22,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-26 03:11:22,447 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-26 03:11:22,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-08-26 03:11:22,530 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-08-26 03:11:22,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 03:11:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-08-26 03:11:22,818 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 03:11:22,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634307493] [2021-08-26 03:11:22,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634307493] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 03:11:22,819 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:11:22,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 03:11:22,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551750834] [2021-08-26 03:11:22,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:11:22,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 03:11:22,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:11:22,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:11:22,820 INFO L87 Difference]: Start difference. First operand 1052 states and 1582 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:11:30,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:11:30,204 INFO L93 Difference]: Finished difference Result 2669 states and 3951 transitions. [2021-08-26 03:11:30,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:11:30,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2021-08-26 03:11:30,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:11:30,210 INFO L225 Difference]: With dead ends: 2669 [2021-08-26 03:11:30,210 INFO L226 Difference]: Without dead ends: 1627 [2021-08-26 03:11:30,211 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 52.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:11:30,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2021-08-26 03:11:30,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1052. [2021-08-26 03:11:30,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.4843006660323501) internal successors, (1560), 1051 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:11:30,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1560 transitions. [2021-08-26 03:11:30,236 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1560 transitions. Word has length 117 [2021-08-26 03:11:30,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:11:30,237 INFO L470 AbstractCegarLoop]: Abstraction has 1052 states and 1560 transitions. [2021-08-26 03:11:30,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:11:30,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1560 transitions. [2021-08-26 03:11:30,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-08-26 03:11:30,238 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:11:30,245 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:11:30,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-08-26 03:11:30,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 03:11:30,459 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:11:30,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:11:30,459 INFO L82 PathProgramCache]: Analyzing trace with hash 475530403, now seen corresponding path program 1 times [2021-08-26 03:11:30,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 03:11:30,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300942569] [2021-08-26 03:11:30,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:11:30,460 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 03:11:30,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 03:11:30,474 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 03:11:30,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-26 03:11:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:11:31,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 03:11:31,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:11:31,318 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-26 03:11:31,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-26 03:11:31,452 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-26 03:11:31,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-08-26 03:11:31,530 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-08-26 03:11:31,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 03:11:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-08-26 03:11:31,832 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 03:11:31,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300942569] [2021-08-26 03:11:31,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300942569] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 03:11:31,833 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:11:31,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 03:11:31,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718013202] [2021-08-26 03:11:31,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:11:31,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 03:11:31,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:11:31,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:11:31,834 INFO L87 Difference]: Start difference. First operand 1052 states and 1560 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:11:39,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:11:39,348 INFO L93 Difference]: Finished difference Result 2484 states and 3650 transitions. [2021-08-26 03:11:39,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:11:39,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2021-08-26 03:11:39,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:11:39,354 INFO L225 Difference]: With dead ends: 2484 [2021-08-26 03:11:39,354 INFO L226 Difference]: Without dead ends: 1620 [2021-08-26 03:11:39,369 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 60.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:11:39,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2021-08-26 03:11:39,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1063. [2021-08-26 03:11:39,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 1062 states have (on average 1.4745762711864407) internal successors, (1566), 1062 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:11:39,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1566 transitions. [2021-08-26 03:11:39,427 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1566 transitions. Word has length 117 [2021-08-26 03:11:39,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:11:39,428 INFO L470 AbstractCegarLoop]: Abstraction has 1063 states and 1566 transitions. [2021-08-26 03:11:39,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:11:39,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1566 transitions. [2021-08-26 03:11:39,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-08-26 03:11:39,430 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:11:39,430 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:11:39,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-08-26 03:11:39,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 03:11:39,631 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:11:39,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:11:39,631 INFO L82 PathProgramCache]: Analyzing trace with hash 653511332, now seen corresponding path program 1 times [2021-08-26 03:11:39,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 03:11:39,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615236303] [2021-08-26 03:11:39,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:11:39,632 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 03:11:39,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 03:11:39,634 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 03:11:39,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-08-26 03:11:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:11:40,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 03:11:40,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:11:40,653 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-26 03:11:40,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-26 03:11:40,757 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-26 03:11:40,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-08-26 03:11:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-26 03:11:40,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 03:11:41,132 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-26 03:11:41,132 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 03:11:41,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615236303] [2021-08-26 03:11:41,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615236303] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 03:11:41,132 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:11:41,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 03:11:41,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509231377] [2021-08-26 03:11:41,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:11:41,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 03:11:41,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:11:41,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:11:41,134 INFO L87 Difference]: Start difference. First operand 1063 states and 1566 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:11:45,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:11:45,704 INFO L93 Difference]: Finished difference Result 2672 states and 3893 transitions. [2021-08-26 03:11:45,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:11:45,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2021-08-26 03:11:45,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:11:45,710 INFO L225 Difference]: With dead ends: 2672 [2021-08-26 03:11:45,711 INFO L226 Difference]: Without dead ends: 1619 [2021-08-26 03:11:45,736 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 51.6ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:11:45,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2021-08-26 03:11:45,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1063. [2021-08-26 03:11:45,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 1062 states have (on average 1.4538606403013183) internal successors, (1544), 1062 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:11:45,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1544 transitions. [2021-08-26 03:11:45,776 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1544 transitions. Word has length 132 [2021-08-26 03:11:45,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:11:45,779 INFO L470 AbstractCegarLoop]: Abstraction has 1063 states and 1544 transitions. [2021-08-26 03:11:45,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:11:45,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1544 transitions. [2021-08-26 03:11:45,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-08-26 03:11:45,781 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:11:45,781 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:11:45,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-08-26 03:11:45,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 03:11:45,993 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:11:45,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:11:45,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1844078565, now seen corresponding path program 1 times [2021-08-26 03:11:45,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 03:11:45,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744397416] [2021-08-26 03:11:45,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:11:45,994 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 03:11:45,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 03:11:45,995 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 03:11:45,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-08-26 03:11:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:11:46,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 03:11:46,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:11:47,123 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-26 03:11:47,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-26 03:11:47,265 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-26 03:11:47,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-08-26 03:11:47,359 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-26 03:11:47,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 03:11:47,731 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-26 03:11:47,731 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 03:11:47,731 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744397416] [2021-08-26 03:11:47,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744397416] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 03:11:47,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:11:47,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 03:11:47,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302695833] [2021-08-26 03:11:47,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:11:47,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 03:11:47,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:11:47,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:11:47,735 INFO L87 Difference]: Start difference. First operand 1063 states and 1544 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:11:54,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:11:54,219 INFO L93 Difference]: Finished difference Result 2627 states and 3794 transitions. [2021-08-26 03:11:54,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:11:54,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2021-08-26 03:11:54,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:11:54,224 INFO L225 Difference]: With dead ends: 2627 [2021-08-26 03:11:54,225 INFO L226 Difference]: Without dead ends: 1574 [2021-08-26 03:11:54,225 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 60.6ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:11:54,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2021-08-26 03:11:54,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1063. [2021-08-26 03:11:54,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 1062 states have (on average 1.433145009416196) internal successors, (1522), 1062 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:11:54,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1522 transitions. [2021-08-26 03:11:54,249 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1522 transitions. Word has length 133 [2021-08-26 03:11:54,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:11:54,249 INFO L470 AbstractCegarLoop]: Abstraction has 1063 states and 1522 transitions. [2021-08-26 03:11:54,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:11:54,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1522 transitions. [2021-08-26 03:11:54,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-08-26 03:11:54,251 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:11:54,251 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:11:54,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-08-26 03:11:54,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 03:11:54,463 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:11:54,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:11:54,464 INFO L82 PathProgramCache]: Analyzing trace with hash -197856968, now seen corresponding path program 1 times [2021-08-26 03:11:54,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 03:11:54,464 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120981260] [2021-08-26 03:11:54,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:11:54,465 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 03:11:54,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 03:11:54,466 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 03:11:54,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-08-26 03:11:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:11:55,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 03:11:55,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:11:55,609 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-26 03:11:55,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-26 03:11:55,749 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-26 03:11:55,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-08-26 03:11:55,826 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-26 03:11:55,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 03:11:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-26 03:11:56,145 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 03:11:56,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120981260] [2021-08-26 03:11:56,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120981260] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 03:11:56,145 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:11:56,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 03:11:56,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796428654] [2021-08-26 03:11:56,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:11:56,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 03:11:56,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:11:56,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:11:56,146 INFO L87 Difference]: Start difference. First operand 1063 states and 1522 transitions. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:12:03,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:12:03,060 INFO L93 Difference]: Finished difference Result 2727 states and 3885 transitions. [2021-08-26 03:12:03,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:12:03,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2021-08-26 03:12:03,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:12:03,067 INFO L225 Difference]: With dead ends: 2727 [2021-08-26 03:12:03,068 INFO L226 Difference]: Without dead ends: 1674 [2021-08-26 03:12:03,069 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 58.6ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:12:03,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2021-08-26 03:12:03,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1158. [2021-08-26 03:12:03,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1157 states have (on average 1.4140017286084703) internal successors, (1636), 1157 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:12:03,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1636 transitions. [2021-08-26 03:12:03,143 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1636 transitions. Word has length 133 [2021-08-26 03:12:03,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:12:03,157 INFO L470 AbstractCegarLoop]: Abstraction has 1158 states and 1636 transitions. [2021-08-26 03:12:03,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:12:03,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1636 transitions. [2021-08-26 03:12:03,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-08-26 03:12:03,159 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:12:03,159 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:12:03,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-08-26 03:12:03,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 03:12:03,360 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:12:03,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:12:03,360 INFO L82 PathProgramCache]: Analyzing trace with hash 584684213, now seen corresponding path program 1 times [2021-08-26 03:12:03,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 03:12:03,361 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593288476] [2021-08-26 03:12:03,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:12:03,361 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 03:12:03,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 03:12:03,362 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 03:12:03,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-08-26 03:12:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:12:04,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 03:12:04,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:12:04,536 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-26 03:12:04,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-26 03:12:04,724 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-26 03:12:04,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-08-26 03:12:04,799 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-26 03:12:04,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 03:12:05,139 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-26 03:12:05,139 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 03:12:05,139 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593288476] [2021-08-26 03:12:05,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1593288476] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 03:12:05,139 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:12:05,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 03:12:05,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297114012] [2021-08-26 03:12:05,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:12:05,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 03:12:05,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:12:05,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:12:05,141 INFO L87 Difference]: Start difference. First operand 1158 states and 1636 transitions. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:12:11,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:12:11,006 INFO L93 Difference]: Finished difference Result 2781 states and 3929 transitions. [2021-08-26 03:12:11,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:12:11,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2021-08-26 03:12:11,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:12:11,012 INFO L225 Difference]: With dead ends: 2781 [2021-08-26 03:12:11,012 INFO L226 Difference]: Without dead ends: 1633 [2021-08-26 03:12:11,025 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 59.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:12:11,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2021-08-26 03:12:11,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1174. [2021-08-26 03:12:11,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1173 states have (on average 1.412617220801364) internal successors, (1657), 1173 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:12:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1657 transitions. [2021-08-26 03:12:11,059 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1657 transitions. Word has length 134 [2021-08-26 03:12:11,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:12:11,060 INFO L470 AbstractCegarLoop]: Abstraction has 1174 states and 1657 transitions. [2021-08-26 03:12:11,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:12:11,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1657 transitions. [2021-08-26 03:12:11,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-08-26 03:12:11,062 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:12:11,062 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:12:11,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-08-26 03:12:11,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 03:12:11,269 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:12:11,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:12:11,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2002780513, now seen corresponding path program 1 times [2021-08-26 03:12:11,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 03:12:11,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850563067] [2021-08-26 03:12:11,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:12:11,270 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 03:12:11,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 03:12:11,272 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 03:12:11,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-08-26 03:12:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:12:12,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 03:12:12,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:12:12,552 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-26 03:12:12,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-26 03:12:12,689 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-26 03:12:12,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-08-26 03:12:12,756 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-26 03:12:12,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 03:12:13,029 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-26 03:12:13,030 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 03:12:13,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850563067] [2021-08-26 03:12:13,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850563067] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 03:12:13,030 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:12:13,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 03:12:13,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509580516] [2021-08-26 03:12:13,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:12:13,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 03:12:13,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:12:13,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:12:13,032 INFO L87 Difference]: Start difference. First operand 1174 states and 1657 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:12:17,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:12:17,190 INFO L93 Difference]: Finished difference Result 2775 states and 3910 transitions. [2021-08-26 03:12:17,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:12:17,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2021-08-26 03:12:17,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:12:17,196 INFO L225 Difference]: With dead ends: 2775 [2021-08-26 03:12:17,196 INFO L226 Difference]: Without dead ends: 1611 [2021-08-26 03:12:17,199 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 52.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:12:17,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2021-08-26 03:12:17,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1174. [2021-08-26 03:12:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1173 states have (on average 1.3989769820971867) internal successors, (1641), 1173 states have internal predecessors, (1641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:12:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1641 transitions. [2021-08-26 03:12:17,252 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1641 transitions. Word has length 134 [2021-08-26 03:12:17,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:12:17,253 INFO L470 AbstractCegarLoop]: Abstraction has 1174 states and 1641 transitions. [2021-08-26 03:12:17,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:12:17,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1641 transitions. [2021-08-26 03:12:17,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-08-26 03:12:17,255 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:12:17,255 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:12:17,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-08-26 03:12:17,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 03:12:17,469 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:12:17,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:12:17,469 INFO L82 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2021-08-26 03:12:17,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 03:12:17,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773823460] [2021-08-26 03:12:17,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:12:17,470 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 03:12:17,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 03:12:17,471 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 03:12:17,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-08-26 03:12:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 03:12:18,831 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 03:12:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 03:12:19,624 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-08-26 03:12:19,625 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 03:12:19,625 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:12:19,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-08-26 03:12:19,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 03:12:19,847 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 03:12:19,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:12:19 BoogieIcfgContainer [2021-08-26 03:12:19,968 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 03:12:19,968 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 03:12:19,968 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 03:12:19,968 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 03:12:19,969 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:10:33" (3/4) ... [2021-08-26 03:12:19,970 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-26 03:12:20,055 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 03:12:20,055 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 03:12:20,056 INFO L168 Benchmark]: Toolchain (without parser) took 109924.10 ms. Allocated memory was 56.6 MB in the beginning and 195.0 MB in the end (delta: 138.4 MB). Free memory was 39.5 MB in the beginning and 100.3 MB in the end (delta: -60.8 MB). Peak memory consumption was 76.9 MB. Max. memory is 16.1 GB. [2021-08-26 03:12:20,056 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 46.1 MB. Free memory was 28.7 MB in the beginning and 28.6 MB in the end (delta: 40.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 03:12:20,056 INFO L168 Benchmark]: CACSL2BoogieTranslator took 427.15 ms. Allocated memory is still 56.6 MB. Free memory was 39.3 MB in the beginning and 31.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 17.2 MB. Max. memory is 16.1 GB. [2021-08-26 03:12:20,056 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.59 ms. Allocated memory is still 56.6 MB. Free memory was 31.0 MB in the beginning and 26.9 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 03:12:20,057 INFO L168 Benchmark]: Boogie Preprocessor took 56.12 ms. Allocated memory is still 56.6 MB. Free memory was 26.8 MB in the beginning and 33.6 MB in the end (delta: -6.8 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. [2021-08-26 03:12:20,057 INFO L168 Benchmark]: RCFGBuilder took 2734.28 ms. Allocated memory was 56.6 MB in the beginning and 75.5 MB in the end (delta: 18.9 MB). Free memory was 33.6 MB in the beginning and 42.9 MB in the end (delta: -9.3 MB). Peak memory consumption was 25.9 MB. Max. memory is 16.1 GB. [2021-08-26 03:12:20,059 INFO L168 Benchmark]: TraceAbstraction took 106569.04 ms. Allocated memory was 75.5 MB in the beginning and 195.0 MB in the end (delta: 119.5 MB). Free memory was 42.5 MB in the beginning and 116.1 MB in the end (delta: -73.6 MB). Peak memory consumption was 120.7 MB. Max. memory is 16.1 GB. [2021-08-26 03:12:20,060 INFO L168 Benchmark]: Witness Printer took 86.93 ms. Allocated memory is still 195.0 MB. Free memory was 116.1 MB in the beginning and 100.3 MB in the end (delta: 15.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-08-26 03:12:20,061 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.18 ms. Allocated memory is still 46.1 MB. Free memory was 28.7 MB in the beginning and 28.6 MB in the end (delta: 40.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 427.15 ms. Allocated memory is still 56.6 MB. Free memory was 39.3 MB in the beginning and 31.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 17.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 45.59 ms. Allocated memory is still 56.6 MB. Free memory was 31.0 MB in the beginning and 26.9 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 56.12 ms. Allocated memory is still 56.6 MB. Free memory was 26.8 MB in the beginning and 33.6 MB in the end (delta: -6.8 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2734.28 ms. Allocated memory was 56.6 MB in the beginning and 75.5 MB in the end (delta: 18.9 MB). Free memory was 33.6 MB in the beginning and 42.9 MB in the end (delta: -9.3 MB). Peak memory consumption was 25.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 106569.04 ms. Allocated memory was 75.5 MB in the beginning and 195.0 MB in the end (delta: 119.5 MB). Free memory was 42.5 MB in the beginning and 116.1 MB in the end (delta: -73.6 MB). Peak memory consumption was 120.7 MB. Max. memory is 16.1 GB. * Witness Printer took 86.93 ms. Allocated memory is still 195.0 MB. Free memory was 116.1 MB in the beginning and 100.3 MB in the end (delta: 15.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1647]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1041] static int init = 1; [L1042] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={79:0}] [L1064] SSL *s ; [L1068] s = malloc (sizeof (SSL)) [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->state = 12292 [L1072] s->version = __VERIFIER_nondet_int() [L1079] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1080] unsigned long tmp ; [L1081] unsigned long l ; [L1082] long num1 ; [L1083] void (*cb)() ; [L1084] int ret ; [L1085] int new_state ; [L1086] int state ; [L1087] int skip ; [L1088] int *tmp___0 ; [L1089] int tmp___1 = __VERIFIER_nondet_int(); [L1090] int tmp___2 = __VERIFIER_nondet_int(); [L1091] int tmp___3 ; [L1092] int tmp___4 ; [L1093] int tmp___5 ; [L1094] int tmp___6 ; [L1095] int tmp___7 ; [L1096] int tmp___8 ; [L1097] long tmp___9 ; [L1099] int blastFlag ; [L1102] blastFlag = 0 [L1103] s->state = 12292 [L1104] s->hit = __VERIFIER_nondet_int() [L1106] tmp = __VERIFIER_nondet_int() [L1107] cb = (void (*)())((void *)0) [L1108] ret = -1 [L1109] skip = 0 [L1110] tmp___0 = (int*)malloc(sizeof(int)) [L1111] *tmp___0 = 0 [L1112] EXPR s->info_callback VAL [init=1, SSLv3_client_data={79:0}] [L1112] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1113] EXPR s->info_callback [L1113] cb = s->info_callback [L1121] EXPR s->in_handshake [L1121] s->in_handshake += 1 [L1122] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={79:0}] [L1132] COND TRUE 1 VAL [init=1, SSLv3_client_data={79:0}] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1135] COND TRUE s->state == 12292 [L1238] s->new_session = 1 [L1239] s->state = 4096 [L1240] EXPR s->ctx [L1240] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1240] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1245] s->server = 0 VAL [init=1, SSLv3_client_data={79:0}] [L1246] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={79:0}] [L1251] EXPR s->version VAL [init=1, SSLv3_client_data={79:0}] [L1251] COND FALSE !((s->version & 65280) != 768) [L1257] s->type = 4096 [L1258] EXPR s->init_buf VAL [init=1, SSLv3_client_data={79:0}] [L1258] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1270] tmp___4 = __VERIFIER_nondet_int() [L1271] COND FALSE !(! tmp___4) [L1277] tmp___5 = __VERIFIER_nondet_int() [L1278] COND FALSE !(! tmp___5) [L1284] s->state = 4368 [L1285] EXPR s->ctx [L1285] EXPR (s->ctx)->stats.sess_connect [L1285] (s->ctx)->stats.sess_connect += 1 [L1286] s->init_num = 0 VAL [init=1, SSLv3_client_data={79:0}] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={79:0}] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [init=1, SSLv3_client_data={79:0}] [L1132] COND TRUE 1 VAL [init=1, SSLv3_client_data={79:0}] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1150] COND TRUE s->state == 4368 [L1290] s->shutdown = 0 [L1291] ret = __VERIFIER_nondet_int() [L1292] COND TRUE blastFlag == 0 [L1293] blastFlag = 1 VAL [init=1, SSLv3_client_data={79:0}] [L1297] COND FALSE !(ret <= 0) [L1302] s->state = 4384 [L1303] s->init_num = 0 [L1304] EXPR s->bbio [L1304] EXPR s->wbio VAL [init=1, SSLv3_client_data={79:0}] [L1304] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={79:0}] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [init=1, SSLv3_client_data={79:0}] [L1132] COND TRUE 1 VAL [init=1, SSLv3_client_data={79:0}] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1156] COND TRUE s->state == 4384 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 1 [L1314] blastFlag = 2 VAL [init=1, SSLv3_client_data={79:0}] [L1318] COND FALSE !(ret <= 0) [L1323] s->hit VAL [init=1, SSLv3_client_data={79:0}] [L1323] COND FALSE !(s->hit) [L1326] s->state = 4400 VAL [init=1, SSLv3_client_data={79:0}] [L1328] s->init_num = 0 VAL [init=1, SSLv3_client_data={79:0}] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={79:0}] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [init=1, SSLv3_client_data={79:0}] [L1132] COND TRUE 1 VAL [init=1, SSLv3_client_data={79:0}] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1156] COND FALSE !(s->state == 4384) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1159] COND FALSE !(s->state == 4385) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1162] COND TRUE s->state == 4400 [L1332] EXPR s->s3 [L1332] EXPR (s->s3)->tmp.new_cipher [L1332] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={79:0}] [L1332] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1335] ret = __VERIFIER_nondet_int() [L1336] COND TRUE blastFlag == 2 [L1337] blastFlag = 3 VAL [init=1, SSLv3_client_data={79:0}] [L1341] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={79:0}] [L1347] s->state = 4416 [L1348] s->init_num = 0 VAL [init=1, SSLv3_client_data={79:0}] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={79:0}] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [init=1, SSLv3_client_data={79:0}] [L1132] COND TRUE 1 VAL [init=1, SSLv3_client_data={79:0}] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1156] COND FALSE !(s->state == 4384) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1159] COND FALSE !(s->state == 4385) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1162] COND FALSE !(s->state == 4400) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1165] COND FALSE !(s->state == 4401) [L1168] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1168] COND TRUE s->state == 4416 [L1352] ret = __VERIFIER_nondet_int() [L1353] COND TRUE blastFlag == 3 [L1354] blastFlag = 4 VAL [init=1, SSLv3_client_data={79:0}] [L1358] COND FALSE !(ret <= 0) [L1363] s->state = 4432 [L1364] s->init_num = 0 [L1365] tmp___6 = __VERIFIER_nondet_int() [L1366] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={79:0}] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={79:0}] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [init=1, SSLv3_client_data={79:0}] [L1132] COND TRUE 1 VAL [init=1, SSLv3_client_data={79:0}] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1156] COND FALSE !(s->state == 4384) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1159] COND FALSE !(s->state == 4385) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1162] COND FALSE !(s->state == 4400) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1165] COND FALSE !(s->state == 4401) [L1168] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1168] COND FALSE !(s->state == 4416) [L1171] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1171] COND FALSE !(s->state == 4417) [L1174] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1174] COND TRUE s->state == 4432 [L1375] ret = __VERIFIER_nondet_int() [L1376] COND FALSE !(blastFlag == 5) VAL [init=1, SSLv3_client_data={79:0}] [L1381] COND FALSE !(ret <= 0) [L1386] s->state = 4448 [L1387] s->init_num = 0 VAL [init=1, SSLv3_client_data={79:0}] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={79:0}] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [init=1, SSLv3_client_data={79:0}] [L1132] COND TRUE 1 VAL [init=1, SSLv3_client_data={79:0}] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1156] COND FALSE !(s->state == 4384) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1159] COND FALSE !(s->state == 4385) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1162] COND FALSE !(s->state == 4400) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1165] COND FALSE !(s->state == 4401) [L1168] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1168] COND FALSE !(s->state == 4416) [L1171] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1171] COND FALSE !(s->state == 4417) [L1174] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1174] COND FALSE !(s->state == 4432) [L1177] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1177] COND FALSE !(s->state == 4433) [L1180] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1180] COND TRUE s->state == 4448 [L1391] ret = __VERIFIER_nondet_int() [L1392] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={79:0}] [L1647] reach_error() VAL [init=1, SSLv3_client_data={79:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 106396.1ms, OverallIterations: 16, TraceHistogramMax: 7, EmptinessCheckTime: 43.4ms, AutomataDifference: 81368.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 10.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2592 SDtfs, 2767 SDslu, 5836 SDs, 0 SdLazy, 5354 SolverSat, 611 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 75621.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3173 GetRequests, 3095 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 724.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1174occurred in iteration=14, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 551.6ms AutomataMinimizationTime, 15 MinimizatonAttempts, 6441 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 599.1ms SsaConstructionTime, 3005.2ms SatisfiabilityAnalysisTime, 10013.1ms InterpolantComputationTime, 1727 NumberOfCodeBlocks, 1727 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3150 ConstructedInterpolants, 0 QuantifiedInterpolants, 7300 SizeOfPredicates, 69 NumberOfNonLiveVariables, 4359 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 4372/4372 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-26 03:12:20,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...