./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.16.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/openssl/s3_srvr.blast.16.i.cil-1.c -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 0b79f6e49ac032444452c6675a01007f08f3b698920d88701561807a0669494d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:56:10,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:56:10,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:56:10,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:56:10,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:56:10,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:56:10,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:56:10,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:56:10,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:56:10,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:56:10,182 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:56:10,184 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:56:10,184 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:56:10,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:56:10,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:56:10,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:56:10,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:56:10,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:56:10,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:56:10,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:56:10,196 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:56:10,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:56:10,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:56:10,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:56:10,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:56:10,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:56:10,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:56:10,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:56:10,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:56:10,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:56:10,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:56:10,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:56:10,208 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:56:10,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:56:10,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:56:10,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:56:10,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:56:10,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:56:10,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:56:10,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:56:10,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:56:10,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:56:10,213 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:56:10,235 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:56:10,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:56:10,236 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:56:10,236 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:56:10,237 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:56:10,237 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:56:10,237 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:56:10,238 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:56:10,238 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:56:10,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:56:10,239 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:56:10,239 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:56:10,239 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:56:10,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:56:10,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:56:10,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:56:10,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:56:10,239 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:56:10,240 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:56:10,240 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:56:10,241 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:56:10,241 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:56:10,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:56:10,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:56:10,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:56:10,241 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:56:10,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:56:10,242 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:56:10,242 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:56:10,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:56:10,242 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:56:10,242 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:56:10,242 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:56:10,243 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 -> 0b79f6e49ac032444452c6675a01007f08f3b698920d88701561807a0669494d [2022-07-11 23:56:10,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:56:10,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:56:10,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:56:10,482 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:56:10,483 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:56:10,483 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.16.i.cil-1.c [2022-07-11 23:56:10,525 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49122da0a/e4789664c79a47b99a40be20a332b55f/FLAGf3baa8f5b [2022-07-11 23:56:10,922 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:56:10,923 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.16.i.cil-1.c [2022-07-11 23:56:10,956 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49122da0a/e4789664c79a47b99a40be20a332b55f/FLAGf3baa8f5b [2022-07-11 23:56:11,270 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49122da0a/e4789664c79a47b99a40be20a332b55f [2022-07-11 23:56:11,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:56:11,273 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:56:11,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:56:11,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:56:11,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:56:11,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:56:11" (1/1) ... [2022-07-11 23:56:11,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35cbce78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:56:11, skipping insertion in model container [2022-07-11 23:56:11,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:56:11" (1/1) ... [2022-07-11 23:56:11,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:56:11,354 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:56:11,624 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.16.i.cil-1.c[77378,77391] [2022-07-11 23:56:11,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:56:11,645 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:56:11,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.16.i.cil-1.c[77378,77391] [2022-07-11 23:56:11,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:56:11,760 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:56:11,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:56:11 WrapperNode [2022-07-11 23:56:11,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:56:11,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:56:11,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:56:11,763 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:56:11,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:56:11" (1/1) ... [2022-07-11 23:56:11,783 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:56:11" (1/1) ... [2022-07-11 23:56:11,815 INFO L137 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 809 [2022-07-11 23:56:11,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:56:11,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:56:11,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:56:11,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:56:11,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:56:11" (1/1) ... [2022-07-11 23:56:11,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:56:11" (1/1) ... [2022-07-11 23:56:11,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:56:11" (1/1) ... [2022-07-11 23:56:11,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:56:11" (1/1) ... [2022-07-11 23:56:11,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:56:11" (1/1) ... [2022-07-11 23:56:11,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:56:11" (1/1) ... [2022-07-11 23:56:11,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:56:11" (1/1) ... [2022-07-11 23:56:11,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:56:11,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:56:11,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:56:11,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:56:11,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:56:11" (1/1) ... [2022-07-11 23:56:11,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:56:11,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:56:11,945 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) [2022-07-11 23:56:11,951 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 [2022-07-11 23:56:11,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:56:11,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-11 23:56:11,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 23:56:11,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 23:56:11,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-11 23:56:11,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:56:11,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:56:11,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:56:11,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:56:12,129 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:56:12,130 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:56:12,156 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:56:14,472 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-11 23:56:14,472 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-11 23:56:14,472 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:56:14,477 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:56:14,477 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:56:14,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:56:14 BoogieIcfgContainer [2022-07-11 23:56:14,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:56:14,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:56:14,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:56:14,482 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:56:14,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:56:11" (1/3) ... [2022-07-11 23:56:14,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265217d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:56:14, skipping insertion in model container [2022-07-11 23:56:14,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:56:11" (2/3) ... [2022-07-11 23:56:14,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265217d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:56:14, skipping insertion in model container [2022-07-11 23:56:14,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:56:14" (3/3) ... [2022-07-11 23:56:14,484 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.16.i.cil-1.c [2022-07-11 23:56:14,493 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:56:14,493 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:56:14,543 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:56:14,556 INFO L357 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, mAutomataTypeConcurrency=PETRI_NET, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@224af030, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@24615e2a [2022-07-11 23:56:14,557 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:56:14,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 156 states have (on average 1.7307692307692308) internal successors, (270), 157 states have internal predecessors, (270), 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) [2022-07-11 23:56:14,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-11 23:56:14,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:14,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:14,571 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:14,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:14,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1590777092, now seen corresponding path program 1 times [2022-07-11 23:56:14,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:14,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868159505] [2022-07-11 23:56:14,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:14,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:14,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:56:14,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:14,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868159505] [2022-07-11 23:56:15,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868159505] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:15,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:15,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:15,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205794397] [2022-07-11 23:56:15,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:15,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:15,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:15,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:15,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:15,034 INFO L87 Difference]: Start difference. First operand has 158 states, 156 states have (on average 1.7307692307692308) internal successors, (270), 157 states have internal predecessors, (270), 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.25) internal successors, (45), 4 states have internal predecessors, (45), 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) [2022-07-11 23:56:15,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:15,930 INFO L93 Difference]: Finished difference Result 444 states and 762 transitions. [2022-07-11 23:56:15,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:15,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 45 [2022-07-11 23:56:15,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:15,940 INFO L225 Difference]: With dead ends: 444 [2022-07-11 23:56:15,940 INFO L226 Difference]: Without dead ends: 271 [2022-07-11 23:56:15,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:15,945 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 170 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:15,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 489 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-11 23:56:15,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-11 23:56:15,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 185. [2022-07-11 23:56:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.625) internal successors, (299), 184 states have internal predecessors, (299), 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) [2022-07-11 23:56:15,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 299 transitions. [2022-07-11 23:56:15,977 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 299 transitions. Word has length 45 [2022-07-11 23:56:15,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:15,978 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 299 transitions. [2022-07-11 23:56:15,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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) [2022-07-11 23:56:15,978 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 299 transitions. [2022-07-11 23:56:15,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-11 23:56:15,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:15,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:15,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:56:15,980 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:15,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:15,981 INFO L85 PathProgramCache]: Analyzing trace with hash -956498629, now seen corresponding path program 1 times [2022-07-11 23:56:15,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:15,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238201059] [2022-07-11 23:56:15,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:15,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:16,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:56:16,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:16,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238201059] [2022-07-11 23:56:16,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238201059] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:16,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:16,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:16,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942974243] [2022-07-11 23:56:16,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:16,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:16,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:16,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:16,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:16,133 INFO L87 Difference]: Start difference. First operand 185 states and 299 transitions. 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) [2022-07-11 23:56:18,149 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:18,443 INFO L93 Difference]: Finished difference Result 388 states and 625 transitions. [2022-07-11 23:56:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:18,443 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 46 [2022-07-11 23:56:18,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:18,445 INFO L225 Difference]: With dead ends: 388 [2022-07-11 23:56:18,445 INFO L226 Difference]: Without dead ends: 213 [2022-07-11 23:56:18,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:18,446 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 22 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:18,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 517 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 150 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-11 23:56:18,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-11 23:56:18,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 196. [2022-07-11 23:56:18,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 1.6307692307692307) internal successors, (318), 195 states have internal predecessors, (318), 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) [2022-07-11 23:56:18,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 318 transitions. [2022-07-11 23:56:18,460 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 318 transitions. Word has length 46 [2022-07-11 23:56:18,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:18,461 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 318 transitions. [2022-07-11 23:56:18,461 INFO L496 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) [2022-07-11 23:56:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 318 transitions. [2022-07-11 23:56:18,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-11 23:56:18,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:18,466 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:18,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:56:18,467 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:18,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:18,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1903034717, now seen corresponding path program 1 times [2022-07-11 23:56:18,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:18,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151136558] [2022-07-11 23:56:18,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:18,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:18,633 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:56:18,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:18,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151136558] [2022-07-11 23:56:18,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151136558] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:18,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:18,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:18,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724262944] [2022-07-11 23:56:18,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:18,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:18,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:18,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:18,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:18,636 INFO L87 Difference]: Start difference. First operand 196 states and 318 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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) [2022-07-11 23:56:19,912 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:20,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:20,251 INFO L93 Difference]: Finished difference Result 535 states and 873 transitions. [2022-07-11 23:56:20,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:20,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2022-07-11 23:56:20,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:20,254 INFO L225 Difference]: With dead ends: 535 [2022-07-11 23:56:20,254 INFO L226 Difference]: Without dead ends: 360 [2022-07-11 23:56:20,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:20,255 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 159 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:20,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 694 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-11 23:56:20,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-07-11 23:56:20,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 228. [2022-07-11 23:56:20,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.6255506607929515) internal successors, (369), 227 states have internal predecessors, (369), 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) [2022-07-11 23:56:20,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 369 transitions. [2022-07-11 23:56:20,277 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 369 transitions. Word has length 59 [2022-07-11 23:56:20,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:20,277 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 369 transitions. [2022-07-11 23:56:20,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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) [2022-07-11 23:56:20,278 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 369 transitions. [2022-07-11 23:56:20,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-11 23:56:20,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:20,283 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:20,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 23:56:20,284 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:20,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:20,285 INFO L85 PathProgramCache]: Analyzing trace with hash 23257778, now seen corresponding path program 1 times [2022-07-11 23:56:20,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:20,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934252876] [2022-07-11 23:56:20,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:20,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:56:20,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:20,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934252876] [2022-07-11 23:56:20,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934252876] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:20,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:20,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:20,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132778108] [2022-07-11 23:56:20,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:20,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:20,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:20,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:20,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:20,380 INFO L87 Difference]: Start difference. First operand 228 states and 369 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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) [2022-07-11 23:56:21,601 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:21,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:21,937 INFO L93 Difference]: Finished difference Result 543 states and 876 transitions. [2022-07-11 23:56:21,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:21,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2022-07-11 23:56:21,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:21,939 INFO L225 Difference]: With dead ends: 543 [2022-07-11 23:56:21,939 INFO L226 Difference]: Without dead ends: 336 [2022-07-11 23:56:21,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:21,940 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 164 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:21,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 382 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-11 23:56:21,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-07-11 23:56:21,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 228. [2022-07-11 23:56:21,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.6079295154185023) internal successors, (365), 227 states have internal predecessors, (365), 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) [2022-07-11 23:56:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 365 transitions. [2022-07-11 23:56:21,950 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 365 transitions. Word has length 60 [2022-07-11 23:56:21,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:21,950 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 365 transitions. [2022-07-11 23:56:21,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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) [2022-07-11 23:56:21,958 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 365 transitions. [2022-07-11 23:56:21,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-11 23:56:21,959 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:21,959 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:21,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 23:56:21,960 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:21,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:21,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1612277602, now seen corresponding path program 1 times [2022-07-11 23:56:21,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:21,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929707865] [2022-07-11 23:56:21,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:21,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:56:22,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:22,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929707865] [2022-07-11 23:56:22,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929707865] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:22,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:22,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:22,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529169784] [2022-07-11 23:56:22,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:22,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:22,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:22,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:22,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:22,083 INFO L87 Difference]: Start difference. First operand 228 states and 365 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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) [2022-07-11 23:56:23,785 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:24,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:24,003 INFO L93 Difference]: Finished difference Result 451 states and 719 transitions. [2022-07-11 23:56:24,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:24,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2022-07-11 23:56:24,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:24,005 INFO L225 Difference]: With dead ends: 451 [2022-07-11 23:56:24,006 INFO L226 Difference]: Without dead ends: 244 [2022-07-11 23:56:24,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:24,007 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 26 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:24,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 521 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-11 23:56:24,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-11 23:56:24,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 228. [2022-07-11 23:56:24,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.60352422907489) internal successors, (364), 227 states have internal predecessors, (364), 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) [2022-07-11 23:56:24,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 364 transitions. [2022-07-11 23:56:24,015 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 364 transitions. Word has length 60 [2022-07-11 23:56:24,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:24,032 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 364 transitions. [2022-07-11 23:56:24,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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) [2022-07-11 23:56:24,032 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 364 transitions. [2022-07-11 23:56:24,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-11 23:56:24,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:24,033 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-07-11 23:56:24,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-11 23:56:24,034 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:24,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:24,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2036873383, now seen corresponding path program 1 times [2022-07-11 23:56:24,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:24,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779359783] [2022-07-11 23:56:24,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:24,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:24,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:56:24,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:24,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779359783] [2022-07-11 23:56:24,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779359783] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:24,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:24,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:24,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023941728] [2022-07-11 23:56:24,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:24,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:24,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:24,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:24,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:24,203 INFO L87 Difference]: Start difference. First operand 228 states and 364 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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) [2022-07-11 23:56:24,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:24,652 INFO L93 Difference]: Finished difference Result 450 states and 717 transitions. [2022-07-11 23:56:24,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:24,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2022-07-11 23:56:24,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:24,654 INFO L225 Difference]: With dead ends: 450 [2022-07-11 23:56:24,654 INFO L226 Difference]: Without dead ends: 243 [2022-07-11 23:56:24,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:24,655 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 19 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:24,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 523 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:56:24,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-07-11 23:56:24,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 228. [2022-07-11 23:56:24,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.5991189427312775) internal successors, (363), 227 states have internal predecessors, (363), 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) [2022-07-11 23:56:24,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 363 transitions. [2022-07-11 23:56:24,663 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 363 transitions. Word has length 60 [2022-07-11 23:56:24,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:24,670 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 363 transitions. [2022-07-11 23:56:24,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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) [2022-07-11 23:56:24,671 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 363 transitions. [2022-07-11 23:56:24,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-11 23:56:24,672 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:24,672 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:24,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-11 23:56:24,672 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:24,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:24,673 INFO L85 PathProgramCache]: Analyzing trace with hash 66586599, now seen corresponding path program 1 times [2022-07-11 23:56:24,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:24,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038280841] [2022-07-11 23:56:24,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:24,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:24,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:56:24,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:24,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038280841] [2022-07-11 23:56:24,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038280841] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:24,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:24,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:24,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700644662] [2022-07-11 23:56:24,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:24,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:24,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:24,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:24,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:24,764 INFO L87 Difference]: Start difference. First operand 228 states and 363 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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) [2022-07-11 23:56:25,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:25,334 INFO L93 Difference]: Finished difference Result 543 states and 867 transitions. [2022-07-11 23:56:25,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:25,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2022-07-11 23:56:25,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:25,336 INFO L225 Difference]: With dead ends: 543 [2022-07-11 23:56:25,336 INFO L226 Difference]: Without dead ends: 336 [2022-07-11 23:56:25,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:25,337 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 157 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:25,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 382 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:56:25,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-07-11 23:56:25,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 229. [2022-07-11 23:56:25,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.587719298245614) internal successors, (362), 228 states have internal predecessors, (362), 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) [2022-07-11 23:56:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 362 transitions. [2022-07-11 23:56:25,342 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 362 transitions. Word has length 60 [2022-07-11 23:56:25,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:25,342 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 362 transitions. [2022-07-11 23:56:25,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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) [2022-07-11 23:56:25,343 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 362 transitions. [2022-07-11 23:56:25,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-11 23:56:25,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:25,347 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:25,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-11 23:56:25,348 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:25,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:25,348 INFO L85 PathProgramCache]: Analyzing trace with hash 415717658, now seen corresponding path program 1 times [2022-07-11 23:56:25,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:25,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849494827] [2022-07-11 23:56:25,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:25,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:25,448 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:56:25,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:25,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849494827] [2022-07-11 23:56:25,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849494827] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:25,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:25,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:25,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872152563] [2022-07-11 23:56:25,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:25,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:25,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:25,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:25,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:25,450 INFO L87 Difference]: Start difference. First operand 229 states and 362 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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) [2022-07-11 23:56:26,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:26,134 INFO L93 Difference]: Finished difference Result 450 states and 713 transitions. [2022-07-11 23:56:26,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:26,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2022-07-11 23:56:26,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:26,137 INFO L225 Difference]: With dead ends: 450 [2022-07-11 23:56:26,137 INFO L226 Difference]: Without dead ends: 242 [2022-07-11 23:56:26,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:26,138 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 22 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:26,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 527 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:56:26,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-11 23:56:26,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 229. [2022-07-11 23:56:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.5833333333333333) internal successors, (361), 228 states have internal predecessors, (361), 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) [2022-07-11 23:56:26,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 361 transitions. [2022-07-11 23:56:26,142 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 361 transitions. Word has length 61 [2022-07-11 23:56:26,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:26,143 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 361 transitions. [2022-07-11 23:56:26,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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) [2022-07-11 23:56:26,143 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 361 transitions. [2022-07-11 23:56:26,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-11 23:56:26,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:26,143 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:26,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-11 23:56:26,143 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:26,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:26,144 INFO L85 PathProgramCache]: Analyzing trace with hash -588000903, now seen corresponding path program 1 times [2022-07-11 23:56:26,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:26,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305899886] [2022-07-11 23:56:26,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:26,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:26,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:56:26,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:26,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305899886] [2022-07-11 23:56:26,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305899886] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:26,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:26,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:26,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203242016] [2022-07-11 23:56:26,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:26,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:26,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:26,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:26,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:26,224 INFO L87 Difference]: Start difference. First operand 229 states and 361 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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) [2022-07-11 23:56:26,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:26,807 INFO L93 Difference]: Finished difference Result 450 states and 712 transitions. [2022-07-11 23:56:26,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:26,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2022-07-11 23:56:26,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:26,809 INFO L225 Difference]: With dead ends: 450 [2022-07-11 23:56:26,809 INFO L226 Difference]: Without dead ends: 242 [2022-07-11 23:56:26,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:26,810 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 20 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:26,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 527 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:56:26,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-11 23:56:26,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 229. [2022-07-11 23:56:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.5789473684210527) internal successors, (360), 228 states have internal predecessors, (360), 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) [2022-07-11 23:56:26,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 360 transitions. [2022-07-11 23:56:26,814 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 360 transitions. Word has length 62 [2022-07-11 23:56:26,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:26,814 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 360 transitions. [2022-07-11 23:56:26,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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) [2022-07-11 23:56:26,814 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 360 transitions. [2022-07-11 23:56:26,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-11 23:56:26,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:26,815 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:26,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-11 23:56:26,815 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:26,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:26,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1085567403, now seen corresponding path program 1 times [2022-07-11 23:56:26,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:26,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063614178] [2022-07-11 23:56:26,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:26,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:26,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:56:26,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:26,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063614178] [2022-07-11 23:56:26,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063614178] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:26,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:26,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:26,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246568289] [2022-07-11 23:56:26,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:26,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:26,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:26,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:26,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:26,900 INFO L87 Difference]: Start difference. First operand 229 states and 360 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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) [2022-07-11 23:56:28,026 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:28,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:28,190 INFO L93 Difference]: Finished difference Result 440 states and 698 transitions. [2022-07-11 23:56:28,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:28,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 63 [2022-07-11 23:56:28,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:28,191 INFO L225 Difference]: With dead ends: 440 [2022-07-11 23:56:28,191 INFO L226 Difference]: Without dead ends: 232 [2022-07-11 23:56:28,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:28,192 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 11 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:28,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 541 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-11 23:56:28,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-11 23:56:28,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2022-07-11 23:56:28,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.5745614035087718) internal successors, (359), 228 states have internal predecessors, (359), 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) [2022-07-11 23:56:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 359 transitions. [2022-07-11 23:56:28,196 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 359 transitions. Word has length 63 [2022-07-11 23:56:28,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:28,196 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 359 transitions. [2022-07-11 23:56:28,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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) [2022-07-11 23:56:28,196 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 359 transitions. [2022-07-11 23:56:28,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-11 23:56:28,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:28,197 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2022-07-11 23:56:28,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-11 23:56:28,197 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:28,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:28,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1421192685, now seen corresponding path program 1 times [2022-07-11 23:56:28,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:28,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329073333] [2022-07-11 23:56:28,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:28,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:56:28,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:28,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329073333] [2022-07-11 23:56:28,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329073333] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:28,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:28,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:28,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720271296] [2022-07-11 23:56:28,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:28,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:28,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:28,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:28,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:28,278 INFO L87 Difference]: Start difference. First operand 229 states and 359 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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) [2022-07-11 23:56:29,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:29,022 INFO L93 Difference]: Finished difference Result 477 states and 753 transitions. [2022-07-11 23:56:29,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:29,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 63 [2022-07-11 23:56:29,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:29,024 INFO L225 Difference]: With dead ends: 477 [2022-07-11 23:56:29,024 INFO L226 Difference]: Without dead ends: 269 [2022-07-11 23:56:29,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:29,025 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 31 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:29,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 545 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:56:29,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-11 23:56:29,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 251. [2022-07-11 23:56:29,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.576) internal successors, (394), 250 states have internal predecessors, (394), 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) [2022-07-11 23:56:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 394 transitions. [2022-07-11 23:56:29,030 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 394 transitions. Word has length 63 [2022-07-11 23:56:29,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:29,030 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 394 transitions. [2022-07-11 23:56:29,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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) [2022-07-11 23:56:29,030 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 394 transitions. [2022-07-11 23:56:29,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-11 23:56:29,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:29,031 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:29,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-11 23:56:29,034 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:29,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:29,035 INFO L85 PathProgramCache]: Analyzing trace with hash 523971024, now seen corresponding path program 1 times [2022-07-11 23:56:29,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:29,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131345880] [2022-07-11 23:56:29,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:29,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:56:29,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:29,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131345880] [2022-07-11 23:56:29,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131345880] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:29,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:29,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:29,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718528730] [2022-07-11 23:56:29,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:29,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:29,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:29,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:29,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:29,131 INFO L87 Difference]: Start difference. First operand 251 states and 394 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) [2022-07-11 23:56:29,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:29,627 INFO L93 Difference]: Finished difference Result 588 states and 931 transitions. [2022-07-11 23:56:29,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:29,627 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 77 [2022-07-11 23:56:29,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:29,628 INFO L225 Difference]: With dead ends: 588 [2022-07-11 23:56:29,628 INFO L226 Difference]: Without dead ends: 358 [2022-07-11 23:56:29,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:29,629 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 162 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:29,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 382 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:56:29,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-07-11 23:56:29,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 251. [2022-07-11 23:56:29,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.56) internal successors, (390), 250 states have internal predecessors, (390), 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) [2022-07-11 23:56:29,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 390 transitions. [2022-07-11 23:56:29,634 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 390 transitions. Word has length 77 [2022-07-11 23:56:29,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:29,634 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 390 transitions. [2022-07-11 23:56:29,634 INFO L496 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) [2022-07-11 23:56:29,634 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 390 transitions. [2022-07-11 23:56:29,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-11 23:56:29,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:29,635 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:29,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-11 23:56:29,635 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:29,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:29,636 INFO L85 PathProgramCache]: Analyzing trace with hash -121845287, now seen corresponding path program 1 times [2022-07-11 23:56:29,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:29,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65037791] [2022-07-11 23:56:29,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:29,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:56:29,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:29,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65037791] [2022-07-11 23:56:29,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65037791] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:29,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:29,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:29,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650639152] [2022-07-11 23:56:29,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:29,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:29,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:29,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:29,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:29,729 INFO L87 Difference]: Start difference. First operand 251 states and 390 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) [2022-07-11 23:56:30,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:30,356 INFO L93 Difference]: Finished difference Result 498 states and 778 transitions. [2022-07-11 23:56:30,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:30,357 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 77 [2022-07-11 23:56:30,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:30,358 INFO L225 Difference]: With dead ends: 498 [2022-07-11 23:56:30,358 INFO L226 Difference]: Without dead ends: 268 [2022-07-11 23:56:30,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:30,359 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 33 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:30,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 547 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:56:30,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-11 23:56:30,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 251. [2022-07-11 23:56:30,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.556) internal successors, (389), 250 states have internal predecessors, (389), 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) [2022-07-11 23:56:30,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 389 transitions. [2022-07-11 23:56:30,365 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 389 transitions. Word has length 77 [2022-07-11 23:56:30,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:30,366 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 389 transitions. [2022-07-11 23:56:30,366 INFO L496 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) [2022-07-11 23:56:30,366 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 389 transitions. [2022-07-11 23:56:30,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-11 23:56:30,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:30,367 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:30,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-11 23:56:30,367 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:30,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:30,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2080051672, now seen corresponding path program 1 times [2022-07-11 23:56:30,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:30,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101184911] [2022-07-11 23:56:30,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:30,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:56:30,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:30,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101184911] [2022-07-11 23:56:30,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101184911] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:30,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:30,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:30,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268490070] [2022-07-11 23:56:30,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:30,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:30,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:30,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:30,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:30,447 INFO L87 Difference]: Start difference. First operand 251 states and 389 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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) [2022-07-11 23:56:31,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:31,405 INFO L93 Difference]: Finished difference Result 588 states and 921 transitions. [2022-07-11 23:56:31,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:31,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 78 [2022-07-11 23:56:31,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:31,407 INFO L225 Difference]: With dead ends: 588 [2022-07-11 23:56:31,407 INFO L226 Difference]: Without dead ends: 358 [2022-07-11 23:56:31,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:31,408 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 160 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:31,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 382 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-11 23:56:31,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-07-11 23:56:31,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 251. [2022-07-11 23:56:31,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.54) internal successors, (385), 250 states have internal predecessors, (385), 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) [2022-07-11 23:56:31,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 385 transitions. [2022-07-11 23:56:31,413 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 385 transitions. Word has length 78 [2022-07-11 23:56:31,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:31,413 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 385 transitions. [2022-07-11 23:56:31,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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) [2022-07-11 23:56:31,413 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 385 transitions. [2022-07-11 23:56:31,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-11 23:56:31,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:31,414 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:31,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-11 23:56:31,414 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:31,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:31,414 INFO L85 PathProgramCache]: Analyzing trace with hash -647438805, now seen corresponding path program 1 times [2022-07-11 23:56:31,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:31,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606507356] [2022-07-11 23:56:31,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:31,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:56:31,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:31,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606507356] [2022-07-11 23:56:31,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606507356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:31,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:31,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:31,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002986959] [2022-07-11 23:56:31,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:31,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:31,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:31,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:31,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:31,513 INFO L87 Difference]: Start difference. First operand 251 states and 385 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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) [2022-07-11 23:56:32,553 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:32,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:32,804 INFO L93 Difference]: Finished difference Result 588 states and 913 transitions. [2022-07-11 23:56:32,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:32,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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 79 [2022-07-11 23:56:32,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:32,806 INFO L225 Difference]: With dead ends: 588 [2022-07-11 23:56:32,806 INFO L226 Difference]: Without dead ends: 358 [2022-07-11 23:56:32,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:32,807 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 158 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:32,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 382 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-11 23:56:32,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-07-11 23:56:32,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 251. [2022-07-11 23:56:32,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.524) internal successors, (381), 250 states have internal predecessors, (381), 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) [2022-07-11 23:56:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 381 transitions. [2022-07-11 23:56:32,811 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 381 transitions. Word has length 79 [2022-07-11 23:56:32,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:32,812 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 381 transitions. [2022-07-11 23:56:32,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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) [2022-07-11 23:56:32,812 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 381 transitions. [2022-07-11 23:56:32,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-11 23:56:32,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:32,812 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:32,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-11 23:56:32,812 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:32,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:32,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1366824931, now seen corresponding path program 1 times [2022-07-11 23:56:32,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:32,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111076325] [2022-07-11 23:56:32,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:32,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:32,882 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:56:32,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:32,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111076325] [2022-07-11 23:56:32,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111076325] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:32,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:32,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:32,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599815981] [2022-07-11 23:56:32,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:32,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:32,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:32,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:32,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:32,886 INFO L87 Difference]: Start difference. First operand 251 states and 381 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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) [2022-07-11 23:56:34,149 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:34,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:34,393 INFO L93 Difference]: Finished difference Result 578 states and 892 transitions. [2022-07-11 23:56:34,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:34,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 [2022-07-11 23:56:34,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:34,394 INFO L225 Difference]: With dead ends: 578 [2022-07-11 23:56:34,394 INFO L226 Difference]: Without dead ends: 348 [2022-07-11 23:56:34,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:34,395 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 149 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:34,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 402 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-11 23:56:34,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-07-11 23:56:34,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 251. [2022-07-11 23:56:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.508) internal successors, (377), 250 states have internal predecessors, (377), 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) [2022-07-11 23:56:34,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 377 transitions. [2022-07-11 23:56:34,399 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 377 transitions. Word has length 80 [2022-07-11 23:56:34,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:34,400 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 377 transitions. [2022-07-11 23:56:34,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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) [2022-07-11 23:56:34,400 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 377 transitions. [2022-07-11 23:56:34,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-11 23:56:34,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:34,400 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:34,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-11 23:56:34,400 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:34,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:34,402 INFO L85 PathProgramCache]: Analyzing trace with hash -238422134, now seen corresponding path program 1 times [2022-07-11 23:56:34,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:34,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511187013] [2022-07-11 23:56:34,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:34,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:34,512 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:56:34,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:34,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511187013] [2022-07-11 23:56:34,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511187013] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:34,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:34,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:34,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203231479] [2022-07-11 23:56:34,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:34,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:34,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:34,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:34,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:34,514 INFO L87 Difference]: Start difference. First operand 251 states and 377 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) [2022-07-11 23:56:35,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:35,350 INFO L93 Difference]: Finished difference Result 578 states and 884 transitions. [2022-07-11 23:56:35,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:35,350 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 85 [2022-07-11 23:56:35,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:35,351 INFO L225 Difference]: With dead ends: 578 [2022-07-11 23:56:35,351 INFO L226 Difference]: Without dead ends: 348 [2022-07-11 23:56:35,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:35,352 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 123 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:35,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 424 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-11 23:56:35,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-07-11 23:56:35,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 274. [2022-07-11 23:56:35,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 1.5457875457875458) internal successors, (422), 273 states have internal predecessors, (422), 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) [2022-07-11 23:56:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 422 transitions. [2022-07-11 23:56:35,357 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 422 transitions. Word has length 85 [2022-07-11 23:56:35,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:35,357 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 422 transitions. [2022-07-11 23:56:35,357 INFO L496 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) [2022-07-11 23:56:35,357 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 422 transitions. [2022-07-11 23:56:35,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-11 23:56:35,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:35,358 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-07-11 23:56:35,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-11 23:56:35,358 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:35,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:35,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1246725502, now seen corresponding path program 1 times [2022-07-11 23:56:35,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:35,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825934642] [2022-07-11 23:56:35,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:35,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:35,439 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:56:35,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:35,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825934642] [2022-07-11 23:56:35,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825934642] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:35,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:35,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:35,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92005660] [2022-07-11 23:56:35,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:35,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:35,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:35,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:35,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:35,442 INFO L87 Difference]: Start difference. First operand 274 states and 422 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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) [2022-07-11 23:56:36,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:36,321 INFO L93 Difference]: Finished difference Result 616 states and 956 transitions. [2022-07-11 23:56:36,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:36,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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 113 [2022-07-11 23:56:36,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:36,323 INFO L225 Difference]: With dead ends: 616 [2022-07-11 23:56:36,323 INFO L226 Difference]: Without dead ends: 363 [2022-07-11 23:56:36,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:36,324 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 88 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:36,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 523 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-11 23:56:36,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-07-11 23:56:36,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 308. [2022-07-11 23:56:36,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.5472312703583062) internal successors, (475), 307 states have internal predecessors, (475), 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) [2022-07-11 23:56:36,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 475 transitions. [2022-07-11 23:56:36,329 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 475 transitions. Word has length 113 [2022-07-11 23:56:36,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:36,329 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 475 transitions. [2022-07-11 23:56:36,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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) [2022-07-11 23:56:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 475 transitions. [2022-07-11 23:56:36,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-11 23:56:36,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:36,330 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-07-11 23:56:36,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-11 23:56:36,330 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:36,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:36,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1139784004, now seen corresponding path program 1 times [2022-07-11 23:56:36,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:36,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957545982] [2022-07-11 23:56:36,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:36,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:36,456 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:56:36,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:36,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957545982] [2022-07-11 23:56:36,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957545982] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:36,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:36,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:36,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426044968] [2022-07-11 23:56:36,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:36,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:36,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:36,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:36,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:36,458 INFO L87 Difference]: Start difference. First operand 308 states and 475 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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) [2022-07-11 23:56:37,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:37,644 INFO L93 Difference]: Finished difference Result 745 states and 1162 transitions. [2022-07-11 23:56:37,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:37,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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 113 [2022-07-11 23:56:37,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:37,646 INFO L225 Difference]: With dead ends: 745 [2022-07-11 23:56:37,647 INFO L226 Difference]: Without dead ends: 458 [2022-07-11 23:56:37,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:37,647 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 129 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:37,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 412 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-11 23:56:37,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-07-11 23:56:37,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 338. [2022-07-11 23:56:37,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 1.5548961424332344) internal successors, (524), 337 states have internal predecessors, (524), 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) [2022-07-11 23:56:37,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 524 transitions. [2022-07-11 23:56:37,660 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 524 transitions. Word has length 113 [2022-07-11 23:56:37,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:37,660 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 524 transitions. [2022-07-11 23:56:37,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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) [2022-07-11 23:56:37,660 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 524 transitions. [2022-07-11 23:56:37,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-11 23:56:37,661 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:37,661 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2022-07-11 23:56:37,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-11 23:56:37,662 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:37,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:37,662 INFO L85 PathProgramCache]: Analyzing trace with hash -674265657, now seen corresponding path program 1 times [2022-07-11 23:56:37,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:37,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542746302] [2022-07-11 23:56:37,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:37,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:37,749 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:56:37,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:37,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542746302] [2022-07-11 23:56:37,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542746302] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:37,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:37,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:37,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927256574] [2022-07-11 23:56:37,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:37,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:37,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:37,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:37,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:37,751 INFO L87 Difference]: Start difference. First operand 338 states and 524 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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) [2022-07-11 23:56:39,763 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:40,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:40,056 INFO L93 Difference]: Finished difference Result 769 states and 1197 transitions. [2022-07-11 23:56:40,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:40,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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 [2022-07-11 23:56:40,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:40,057 INFO L225 Difference]: With dead ends: 769 [2022-07-11 23:56:40,058 INFO L226 Difference]: Without dead ends: 452 [2022-07-11 23:56:40,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:40,058 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 125 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:40,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 400 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 246 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-11 23:56:40,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-07-11 23:56:40,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 375. [2022-07-11 23:56:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 1.5588235294117647) internal successors, (583), 374 states have internal predecessors, (583), 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) [2022-07-11 23:56:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 583 transitions. [2022-07-11 23:56:40,065 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 583 transitions. Word has length 119 [2022-07-11 23:56:40,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:40,065 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 583 transitions. [2022-07-11 23:56:40,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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) [2022-07-11 23:56:40,065 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 583 transitions. [2022-07-11 23:56:40,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-11 23:56:40,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:40,066 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2022-07-11 23:56:40,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-11 23:56:40,066 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:40,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:40,066 INFO L85 PathProgramCache]: Analyzing trace with hash 622163786, now seen corresponding path program 1 times [2022-07-11 23:56:40,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:40,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091692648] [2022-07-11 23:56:40,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:40,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:56:40,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:40,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091692648] [2022-07-11 23:56:40,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091692648] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:40,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:40,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:40,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217442607] [2022-07-11 23:56:40,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:40,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:40,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:40,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:40,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:40,172 INFO L87 Difference]: Start difference. First operand 375 states and 583 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 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) [2022-07-11 23:56:42,042 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:42,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:42,257 INFO L93 Difference]: Finished difference Result 815 states and 1272 transitions. [2022-07-11 23:56:42,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:42,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 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 120 [2022-07-11 23:56:42,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:42,259 INFO L225 Difference]: With dead ends: 815 [2022-07-11 23:56:42,259 INFO L226 Difference]: Without dead ends: 461 [2022-07-11 23:56:42,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:42,260 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 77 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:42,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 525 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-11 23:56:42,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-07-11 23:56:42,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 415. [2022-07-11 23:56:42,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 1.5603864734299517) internal successors, (646), 414 states have internal predecessors, (646), 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) [2022-07-11 23:56:42,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 646 transitions. [2022-07-11 23:56:42,267 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 646 transitions. Word has length 120 [2022-07-11 23:56:42,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:42,267 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 646 transitions. [2022-07-11 23:56:42,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 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) [2022-07-11 23:56:42,267 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 646 transitions. [2022-07-11 23:56:42,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-11 23:56:42,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:42,268 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2022-07-11 23:56:42,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-11 23:56:42,268 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:42,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:42,268 INFO L85 PathProgramCache]: Analyzing trace with hash 649229388, now seen corresponding path program 1 times [2022-07-11 23:56:42,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:42,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492686164] [2022-07-11 23:56:42,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:42,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:42,345 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-11 23:56:42,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:42,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492686164] [2022-07-11 23:56:42,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492686164] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:42,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:42,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:42,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143125671] [2022-07-11 23:56:42,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:42,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:42,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:42,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:42,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:42,349 INFO L87 Difference]: Start difference. First operand 415 states and 646 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 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) [2022-07-11 23:56:42,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:42,787 INFO L93 Difference]: Finished difference Result 846 states and 1321 transitions. [2022-07-11 23:56:42,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:42,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 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 120 [2022-07-11 23:56:42,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:42,789 INFO L225 Difference]: With dead ends: 846 [2022-07-11 23:56:42,789 INFO L226 Difference]: Without dead ends: 452 [2022-07-11 23:56:42,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:42,790 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 28 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:42,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 625 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:56:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-07-11 23:56:42,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 439. [2022-07-11 23:56:42,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 1.5547945205479452) internal successors, (681), 438 states have internal predecessors, (681), 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) [2022-07-11 23:56:42,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 681 transitions. [2022-07-11 23:56:42,797 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 681 transitions. Word has length 120 [2022-07-11 23:56:42,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:42,798 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 681 transitions. [2022-07-11 23:56:42,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 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) [2022-07-11 23:56:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 681 transitions. [2022-07-11 23:56:42,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-11 23:56:42,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:42,799 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-11 23:56:42,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-11 23:56:42,799 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:42,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:42,800 INFO L85 PathProgramCache]: Analyzing trace with hash -370439172, now seen corresponding path program 1 times [2022-07-11 23:56:42,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:42,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230902078] [2022-07-11 23:56:42,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:42,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:56:42,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:42,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230902078] [2022-07-11 23:56:42,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230902078] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:42,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:42,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:42,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788976002] [2022-07-11 23:56:42,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:42,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:42,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:42,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:42,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:42,888 INFO L87 Difference]: Start difference. First operand 439 states and 681 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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) [2022-07-11 23:56:43,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:43,643 INFO L93 Difference]: Finished difference Result 895 states and 1391 transitions. [2022-07-11 23:56:43,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:43,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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 127 [2022-07-11 23:56:43,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:43,645 INFO L225 Difference]: With dead ends: 895 [2022-07-11 23:56:43,645 INFO L226 Difference]: Without dead ends: 477 [2022-07-11 23:56:43,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:43,646 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 61 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:43,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 531 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:56:43,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-07-11 23:56:43,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 442. [2022-07-11 23:56:43,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 1.5510204081632653) internal successors, (684), 441 states have internal predecessors, (684), 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) [2022-07-11 23:56:43,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 684 transitions. [2022-07-11 23:56:43,654 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 684 transitions. Word has length 127 [2022-07-11 23:56:43,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:43,654 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 684 transitions. [2022-07-11 23:56:43,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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) [2022-07-11 23:56:43,654 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 684 transitions. [2022-07-11 23:56:43,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-11 23:56:43,655 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:43,655 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2022-07-11 23:56:43,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-11 23:56:43,656 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:43,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:43,656 INFO L85 PathProgramCache]: Analyzing trace with hash -143031650, now seen corresponding path program 1 times [2022-07-11 23:56:43,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:43,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799656745] [2022-07-11 23:56:43,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:43,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-11 23:56:43,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:43,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799656745] [2022-07-11 23:56:43,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799656745] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:43,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:43,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:43,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348748101] [2022-07-11 23:56:43,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:43,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:43,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:43,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:43,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:43,767 INFO L87 Difference]: Start difference. First operand 442 states and 684 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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) [2022-07-11 23:56:44,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:44,581 INFO L93 Difference]: Finished difference Result 897 states and 1392 transitions. [2022-07-11 23:56:44,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:44,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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 [2022-07-11 23:56:44,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:44,582 INFO L225 Difference]: With dead ends: 897 [2022-07-11 23:56:44,582 INFO L226 Difference]: Without dead ends: 476 [2022-07-11 23:56:44,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:44,583 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 83 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:44,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 533 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-11 23:56:44,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-07-11 23:56:44,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 442. [2022-07-11 23:56:44,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 1.5487528344671202) internal successors, (683), 441 states have internal predecessors, (683), 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) [2022-07-11 23:56:44,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 683 transitions. [2022-07-11 23:56:44,590 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 683 transitions. Word has length 134 [2022-07-11 23:56:44,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:44,590 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 683 transitions. [2022-07-11 23:56:44,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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) [2022-07-11 23:56:44,590 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 683 transitions. [2022-07-11 23:56:44,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-11 23:56:44,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:44,591 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2022-07-11 23:56:44,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-11 23:56:44,591 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:44,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:44,591 INFO L85 PathProgramCache]: Analyzing trace with hash -2083613664, now seen corresponding path program 1 times [2022-07-11 23:56:44,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:44,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921458618] [2022-07-11 23:56:44,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:44,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:44,659 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-11 23:56:44,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:44,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921458618] [2022-07-11 23:56:44,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921458618] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:44,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:44,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:44,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134813508] [2022-07-11 23:56:44,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:44,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:44,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:44,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:44,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:44,661 INFO L87 Difference]: Start difference. First operand 442 states and 683 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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) [2022-07-11 23:56:45,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:45,129 INFO L93 Difference]: Finished difference Result 875 states and 1358 transitions. [2022-07-11 23:56:45,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:45,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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 [2022-07-11 23:56:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:45,131 INFO L225 Difference]: With dead ends: 875 [2022-07-11 23:56:45,131 INFO L226 Difference]: Without dead ends: 454 [2022-07-11 23:56:45,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:45,131 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 33 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:45,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 625 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:56:45,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-07-11 23:56:45,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 442. [2022-07-11 23:56:45,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 1.5464852607709751) internal successors, (682), 441 states have internal predecessors, (682), 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) [2022-07-11 23:56:45,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 682 transitions. [2022-07-11 23:56:45,138 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 682 transitions. Word has length 134 [2022-07-11 23:56:45,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:45,138 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 682 transitions. [2022-07-11 23:56:45,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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) [2022-07-11 23:56:45,138 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 682 transitions. [2022-07-11 23:56:45,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-11 23:56:45,139 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:45,139 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:45,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-11 23:56:45,139 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:45,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:45,140 INFO L85 PathProgramCache]: Analyzing trace with hash -500982677, now seen corresponding path program 1 times [2022-07-11 23:56:45,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:45,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691774089] [2022-07-11 23:56:45,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:45,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:45,297 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-11 23:56:45,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:45,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691774089] [2022-07-11 23:56:45,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691774089] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:45,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:45,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:45,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151961541] [2022-07-11 23:56:45,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:45,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:45,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:45,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:45,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:45,300 INFO L87 Difference]: Start difference. First operand 442 states and 682 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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) [2022-07-11 23:56:46,587 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:46,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:46,832 INFO L93 Difference]: Finished difference Result 977 states and 1512 transitions. [2022-07-11 23:56:46,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:46,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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 140 [2022-07-11 23:56:46,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:46,834 INFO L225 Difference]: With dead ends: 977 [2022-07-11 23:56:46,834 INFO L226 Difference]: Without dead ends: 556 [2022-07-11 23:56:46,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:46,834 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 132 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:46,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 424 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-11 23:56:46,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-07-11 23:56:46,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 472. [2022-07-11 23:56:46,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 1.5371549893842889) internal successors, (724), 471 states have internal predecessors, (724), 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) [2022-07-11 23:56:46,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 724 transitions. [2022-07-11 23:56:46,841 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 724 transitions. Word has length 140 [2022-07-11 23:56:46,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:46,841 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 724 transitions. [2022-07-11 23:56:46,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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) [2022-07-11 23:56:46,842 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 724 transitions. [2022-07-11 23:56:46,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-11 23:56:46,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:46,843 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-11 23:56:46,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-11 23:56:46,843 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:46,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:46,843 INFO L85 PathProgramCache]: Analyzing trace with hash -2119848563, now seen corresponding path program 1 times [2022-07-11 23:56:46,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:46,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376464102] [2022-07-11 23:56:46,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:46,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:46,916 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-11 23:56:46,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:46,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376464102] [2022-07-11 23:56:46,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376464102] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:46,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:46,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:46,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212605676] [2022-07-11 23:56:46,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:46,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:46,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:46,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:46,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:46,917 INFO L87 Difference]: Start difference. First operand 472 states and 724 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 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) [2022-07-11 23:56:47,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:47,369 INFO L93 Difference]: Finished difference Result 997 states and 1532 transitions. [2022-07-11 23:56:47,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:47,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 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 141 [2022-07-11 23:56:47,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:47,371 INFO L225 Difference]: With dead ends: 997 [2022-07-11 23:56:47,371 INFO L226 Difference]: Without dead ends: 546 [2022-07-11 23:56:47,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:47,372 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 131 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:47,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 400 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:56:47,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-07-11 23:56:47,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 472. [2022-07-11 23:56:47,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 1.5244161358811041) internal successors, (718), 471 states have internal predecessors, (718), 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) [2022-07-11 23:56:47,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 718 transitions. [2022-07-11 23:56:47,378 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 718 transitions. Word has length 141 [2022-07-11 23:56:47,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:47,379 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 718 transitions. [2022-07-11 23:56:47,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 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) [2022-07-11 23:56:47,379 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 718 transitions. [2022-07-11 23:56:47,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-11 23:56:47,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:47,380 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 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] [2022-07-11 23:56:47,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-11 23:56:47,380 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:47,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:47,381 INFO L85 PathProgramCache]: Analyzing trace with hash 190412283, now seen corresponding path program 1 times [2022-07-11 23:56:47,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:47,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232576654] [2022-07-11 23:56:47,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:47,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:47,455 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-11 23:56:47,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:47,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232576654] [2022-07-11 23:56:47,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232576654] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:47,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:47,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:47,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125639567] [2022-07-11 23:56:47,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:47,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:47,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:47,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:47,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:47,457 INFO L87 Difference]: Start difference. First operand 472 states and 718 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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) [2022-07-11 23:56:48,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:48,424 INFO L93 Difference]: Finished difference Result 955 states and 1458 transitions. [2022-07-11 23:56:48,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:48,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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 142 [2022-07-11 23:56:48,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:48,426 INFO L225 Difference]: With dead ends: 955 [2022-07-11 23:56:48,426 INFO L226 Difference]: Without dead ends: 504 [2022-07-11 23:56:48,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:48,427 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 73 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:48,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 551 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-11 23:56:48,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-07-11 23:56:48,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 472. [2022-07-11 23:56:48,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 1.5222929936305734) internal successors, (717), 471 states have internal predecessors, (717), 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) [2022-07-11 23:56:48,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 717 transitions. [2022-07-11 23:56:48,433 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 717 transitions. Word has length 142 [2022-07-11 23:56:48,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:48,433 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 717 transitions. [2022-07-11 23:56:48,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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) [2022-07-11 23:56:48,433 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 717 transitions. [2022-07-11 23:56:48,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-11 23:56:48,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:48,434 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 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] [2022-07-11 23:56:48,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-11 23:56:48,434 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:48,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:48,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1221453181, now seen corresponding path program 1 times [2022-07-11 23:56:48,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:48,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539297483] [2022-07-11 23:56:48,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:48,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-11 23:56:48,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:48,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539297483] [2022-07-11 23:56:48,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539297483] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:48,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:48,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:56:48,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464860030] [2022-07-11 23:56:48,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:48,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:56:48,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:48,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:56:48,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:56:48,524 INFO L87 Difference]: Start difference. First operand 472 states and 717 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 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) [2022-07-11 23:56:48,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:48,576 INFO L93 Difference]: Finished difference Result 1369 states and 2095 transitions. [2022-07-11 23:56:48,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:56:48,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 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 142 [2022-07-11 23:56:48,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:48,578 INFO L225 Difference]: With dead ends: 1369 [2022-07-11 23:56:48,579 INFO L226 Difference]: Without dead ends: 918 [2022-07-11 23:56:48,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:56:48,583 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 147 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:48,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 438 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:56:48,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2022-07-11 23:56:48,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 916. [2022-07-11 23:56:48,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 915 states have (on average 1.512568306010929) internal successors, (1384), 915 states have internal predecessors, (1384), 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) [2022-07-11 23:56:48,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1384 transitions. [2022-07-11 23:56:48,596 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1384 transitions. Word has length 142 [2022-07-11 23:56:48,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:48,596 INFO L495 AbstractCegarLoop]: Abstraction has 916 states and 1384 transitions. [2022-07-11 23:56:48,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 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) [2022-07-11 23:56:48,596 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1384 transitions. [2022-07-11 23:56:48,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-11 23:56:48,598 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:48,598 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 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] [2022-07-11 23:56:48,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-11 23:56:48,598 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:48,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:48,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1645099903, now seen corresponding path program 1 times [2022-07-11 23:56:48,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:48,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005628211] [2022-07-11 23:56:48,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:48,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-11 23:56:48,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:48,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005628211] [2022-07-11 23:56:48,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005628211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:48,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:48,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:48,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080396083] [2022-07-11 23:56:48,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:48,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:48,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:48,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:48,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:48,680 INFO L87 Difference]: Start difference. First operand 916 states and 1384 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 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) [2022-07-11 23:56:49,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:49,808 INFO L93 Difference]: Finished difference Result 1892 states and 2861 transitions. [2022-07-11 23:56:49,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:49,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 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 142 [2022-07-11 23:56:49,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:49,811 INFO L225 Difference]: With dead ends: 1892 [2022-07-11 23:56:49,811 INFO L226 Difference]: Without dead ends: 997 [2022-07-11 23:56:49,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:49,812 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 31 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:49,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 625 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-11 23:56:49,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2022-07-11 23:56:49,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 968. [2022-07-11 23:56:49,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 967 states have (on average 1.5118924508790073) internal successors, (1462), 967 states have internal predecessors, (1462), 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) [2022-07-11 23:56:49,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1462 transitions. [2022-07-11 23:56:49,827 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1462 transitions. Word has length 142 [2022-07-11 23:56:49,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:49,827 INFO L495 AbstractCegarLoop]: Abstraction has 968 states and 1462 transitions. [2022-07-11 23:56:49,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 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) [2022-07-11 23:56:49,828 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1462 transitions. [2022-07-11 23:56:49,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-11 23:56:49,829 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:49,829 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:49,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-11 23:56:49,830 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:49,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:49,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1018768782, now seen corresponding path program 1 times [2022-07-11 23:56:49,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:49,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457646949] [2022-07-11 23:56:49,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:49,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:49,916 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-11 23:56:49,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:49,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457646949] [2022-07-11 23:56:49,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457646949] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:49,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:49,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:49,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678701459] [2022-07-11 23:56:49,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:49,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:49,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:49,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:49,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:49,927 INFO L87 Difference]: Start difference. First operand 968 states and 1462 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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) [2022-07-11 23:56:50,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:50,873 INFO L93 Difference]: Finished difference Result 2138 states and 3221 transitions. [2022-07-11 23:56:50,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:50,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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 144 [2022-07-11 23:56:50,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:50,877 INFO L225 Difference]: With dead ends: 2138 [2022-07-11 23:56:50,877 INFO L226 Difference]: Without dead ends: 1191 [2022-07-11 23:56:50,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:50,878 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 133 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:50,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 424 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-11 23:56:50,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2022-07-11 23:56:50,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1024. [2022-07-11 23:56:50,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1023 states have (on average 1.501466275659824) internal successors, (1536), 1023 states have internal predecessors, (1536), 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) [2022-07-11 23:56:50,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1536 transitions. [2022-07-11 23:56:50,893 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1536 transitions. Word has length 144 [2022-07-11 23:56:50,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:50,894 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 1536 transitions. [2022-07-11 23:56:50,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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) [2022-07-11 23:56:50,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1536 transitions. [2022-07-11 23:56:50,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-11 23:56:50,895 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:50,896 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-07-11 23:56:50,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-11 23:56:50,896 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:50,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:50,897 INFO L85 PathProgramCache]: Analyzing trace with hash -271637232, now seen corresponding path program 1 times [2022-07-11 23:56:50,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:50,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075919709] [2022-07-11 23:56:50,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:50,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:50,981 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-11 23:56:50,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:50,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075919709] [2022-07-11 23:56:50,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075919709] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:50,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:50,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:50,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019073745] [2022-07-11 23:56:50,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:50,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:50,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:50,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:50,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:50,983 INFO L87 Difference]: Start difference. First operand 1024 states and 1536 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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) [2022-07-11 23:56:51,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:51,799 INFO L93 Difference]: Finished difference Result 2074 states and 3108 transitions. [2022-07-11 23:56:51,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:51,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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 145 [2022-07-11 23:56:51,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:51,802 INFO L225 Difference]: With dead ends: 2074 [2022-07-11 23:56:51,802 INFO L226 Difference]: Without dead ends: 1071 [2022-07-11 23:56:51,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:51,803 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 57 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:51,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 569 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-11 23:56:51,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2022-07-11 23:56:51,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1024. [2022-07-11 23:56:51,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1023 states have (on average 1.4995112414467253) internal successors, (1534), 1023 states have internal predecessors, (1534), 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) [2022-07-11 23:56:51,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1534 transitions. [2022-07-11 23:56:51,817 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1534 transitions. Word has length 145 [2022-07-11 23:56:51,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:51,818 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 1534 transitions. [2022-07-11 23:56:51,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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) [2022-07-11 23:56:51,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1534 transitions. [2022-07-11 23:56:51,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-11 23:56:51,819 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:51,819 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 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] [2022-07-11 23:56:51,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-11 23:56:51,820 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:51,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:51,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1688759630, now seen corresponding path program 1 times [2022-07-11 23:56:51,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:51,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684518105] [2022-07-11 23:56:51,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:51,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:51,894 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-11 23:56:51,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:51,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684518105] [2022-07-11 23:56:51,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684518105] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:51,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:51,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:51,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814233296] [2022-07-11 23:56:51,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:51,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:51,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:51,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:51,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:51,896 INFO L87 Difference]: Start difference. First operand 1024 states and 1534 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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) [2022-07-11 23:56:52,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:52,410 INFO L93 Difference]: Finished difference Result 2170 states and 3241 transitions. [2022-07-11 23:56:52,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:52,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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 148 [2022-07-11 23:56:52,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:52,413 INFO L225 Difference]: With dead ends: 2170 [2022-07-11 23:56:52,413 INFO L226 Difference]: Without dead ends: 1167 [2022-07-11 23:56:52,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:52,415 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 135 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:52,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 404 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:56:52,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2022-07-11 23:56:52,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1024. [2022-07-11 23:56:52,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1023 states have (on average 1.4838709677419355) internal successors, (1518), 1023 states have internal predecessors, (1518), 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) [2022-07-11 23:56:52,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1518 transitions. [2022-07-11 23:56:52,430 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1518 transitions. Word has length 148 [2022-07-11 23:56:52,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:52,431 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 1518 transitions. [2022-07-11 23:56:52,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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) [2022-07-11 23:56:52,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1518 transitions. [2022-07-11 23:56:52,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-11 23:56:52,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:52,433 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 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] [2022-07-11 23:56:52,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-11 23:56:52,433 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:52,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:52,433 INFO L85 PathProgramCache]: Analyzing trace with hash 267139220, now seen corresponding path program 1 times [2022-07-11 23:56:52,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:52,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673210335] [2022-07-11 23:56:52,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:52,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-11 23:56:52,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:52,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673210335] [2022-07-11 23:56:52,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673210335] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:52,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:52,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:52,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763426291] [2022-07-11 23:56:52,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:52,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:52,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:52,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:52,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:52,526 INFO L87 Difference]: Start difference. First operand 1024 states and 1518 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 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) [2022-07-11 23:56:53,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:53,484 INFO L93 Difference]: Finished difference Result 2170 states and 3209 transitions. [2022-07-11 23:56:53,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:53,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 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 149 [2022-07-11 23:56:53,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:53,487 INFO L225 Difference]: With dead ends: 2170 [2022-07-11 23:56:53,487 INFO L226 Difference]: Without dead ends: 1167 [2022-07-11 23:56:53,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:53,488 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 134 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:53,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 400 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-11 23:56:53,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2022-07-11 23:56:53,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1024. [2022-07-11 23:56:53,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1023 states have (on average 1.4682306940371457) internal successors, (1502), 1023 states have internal predecessors, (1502), 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) [2022-07-11 23:56:53,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1502 transitions. [2022-07-11 23:56:53,505 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1502 transitions. Word has length 149 [2022-07-11 23:56:53,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:53,505 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 1502 transitions. [2022-07-11 23:56:53,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 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) [2022-07-11 23:56:53,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1502 transitions. [2022-07-11 23:56:53,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-11 23:56:53,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:53,507 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2022-07-11 23:56:53,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-11 23:56:53,507 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:53,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:53,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1679866725, now seen corresponding path program 1 times [2022-07-11 23:56:53,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:53,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502476675] [2022-07-11 23:56:53,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:53,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:53,617 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-11 23:56:53,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:53,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502476675] [2022-07-11 23:56:53,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502476675] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:53,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:53,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:53,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903449397] [2022-07-11 23:56:53,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:53,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:53,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:53,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:53,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:53,618 INFO L87 Difference]: Start difference. First operand 1024 states and 1502 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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) [2022-07-11 23:56:54,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:54,290 INFO L93 Difference]: Finished difference Result 2250 states and 3295 transitions. [2022-07-11 23:56:54,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:54,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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 152 [2022-07-11 23:56:54,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:54,294 INFO L225 Difference]: With dead ends: 2250 [2022-07-11 23:56:54,294 INFO L226 Difference]: Without dead ends: 1247 [2022-07-11 23:56:54,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:54,296 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 125 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:54,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 400 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:56:54,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2022-07-11 23:56:54,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1094. [2022-07-11 23:56:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 1093 states have (on average 1.4620311070448306) internal successors, (1598), 1093 states have internal predecessors, (1598), 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) [2022-07-11 23:56:54,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1598 transitions. [2022-07-11 23:56:54,319 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1598 transitions. Word has length 152 [2022-07-11 23:56:54,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:54,319 INFO L495 AbstractCegarLoop]: Abstraction has 1094 states and 1598 transitions. [2022-07-11 23:56:54,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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) [2022-07-11 23:56:54,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1598 transitions. [2022-07-11 23:56:54,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-11 23:56:54,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:54,322 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:54,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-11 23:56:54,323 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:54,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:54,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1338024491, now seen corresponding path program 1 times [2022-07-11 23:56:54,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:54,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862627808] [2022-07-11 23:56:54,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:54,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:54,444 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-11 23:56:54,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:54,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862627808] [2022-07-11 23:56:54,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862627808] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:54,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:54,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:54,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27195178] [2022-07-11 23:56:54,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:54,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:54,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:54,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:54,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:54,446 INFO L87 Difference]: Start difference. First operand 1094 states and 1598 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 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) [2022-07-11 23:56:55,855 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:56,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:56,178 INFO L93 Difference]: Finished difference Result 2390 states and 3487 transitions. [2022-07-11 23:56:56,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:56,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 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 152 [2022-07-11 23:56:56,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:56,182 INFO L225 Difference]: With dead ends: 2390 [2022-07-11 23:56:56,182 INFO L226 Difference]: Without dead ends: 1317 [2022-07-11 23:56:56,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:56,183 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 127 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:56,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 410 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-11 23:56:56,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2022-07-11 23:56:56,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1160. [2022-07-11 23:56:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 1159 states have (on average 1.454702329594478) internal successors, (1686), 1159 states have internal predecessors, (1686), 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) [2022-07-11 23:56:56,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1686 transitions. [2022-07-11 23:56:56,201 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1686 transitions. Word has length 152 [2022-07-11 23:56:56,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:56,201 INFO L495 AbstractCegarLoop]: Abstraction has 1160 states and 1686 transitions. [2022-07-11 23:56:56,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 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) [2022-07-11 23:56:56,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1686 transitions. [2022-07-11 23:56:56,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-11 23:56:56,203 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:56,203 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2022-07-11 23:56:56,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-11 23:56:56,203 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:56,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:56,204 INFO L85 PathProgramCache]: Analyzing trace with hash 523078130, now seen corresponding path program 1 times [2022-07-11 23:56:56,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:56,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677387446] [2022-07-11 23:56:56,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:56,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:56,287 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-11 23:56:56,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:56,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677387446] [2022-07-11 23:56:56,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677387446] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:56,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:56,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:56,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101798861] [2022-07-11 23:56:56,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:56,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:56,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:56,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:56,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:56,289 INFO L87 Difference]: Start difference. First operand 1160 states and 1686 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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) [2022-07-11 23:56:57,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:57,028 INFO L93 Difference]: Finished difference Result 2330 states and 3386 transitions. [2022-07-11 23:56:57,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:57,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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 153 [2022-07-11 23:56:57,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:57,031 INFO L225 Difference]: With dead ends: 2330 [2022-07-11 23:56:57,031 INFO L226 Difference]: Without dead ends: 1191 [2022-07-11 23:56:57,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:57,033 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 39 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:57,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 579 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:56:57,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2022-07-11 23:56:57,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1160. [2022-07-11 23:56:57,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 1159 states have (on average 1.45297670405522) internal successors, (1684), 1159 states have internal predecessors, (1684), 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) [2022-07-11 23:56:57,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1684 transitions. [2022-07-11 23:56:57,050 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1684 transitions. Word has length 153 [2022-07-11 23:56:57,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:57,051 INFO L495 AbstractCegarLoop]: Abstraction has 1160 states and 1684 transitions. [2022-07-11 23:56:57,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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) [2022-07-11 23:56:57,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1684 transitions. [2022-07-11 23:56:57,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-11 23:56:57,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:57,053 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-11 23:56:57,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-11 23:56:57,053 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:57,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:57,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1944185570, now seen corresponding path program 1 times [2022-07-11 23:56:57,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:57,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297390715] [2022-07-11 23:56:57,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:57,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:57,160 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-11 23:56:57,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:57,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297390715] [2022-07-11 23:56:57,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297390715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:57,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:57,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:57,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208059621] [2022-07-11 23:56:57,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:57,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:57,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:57,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:57,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:57,163 INFO L87 Difference]: Start difference. First operand 1160 states and 1684 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 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) [2022-07-11 23:56:58,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:58,007 INFO L93 Difference]: Finished difference Result 2324 states and 3375 transitions. [2022-07-11 23:56:58,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:58,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 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 153 [2022-07-11 23:56:58,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:58,010 INFO L225 Difference]: With dead ends: 2324 [2022-07-11 23:56:58,010 INFO L226 Difference]: Without dead ends: 1185 [2022-07-11 23:56:58,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:58,011 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 33 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:58,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 581 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-11 23:56:58,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2022-07-11 23:56:58,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1160. [2022-07-11 23:56:58,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 1159 states have (on average 1.451251078515962) internal successors, (1682), 1159 states have internal predecessors, (1682), 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) [2022-07-11 23:56:58,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1682 transitions. [2022-07-11 23:56:58,032 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1682 transitions. Word has length 153 [2022-07-11 23:56:58,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:58,032 INFO L495 AbstractCegarLoop]: Abstraction has 1160 states and 1682 transitions. [2022-07-11 23:56:58,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 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) [2022-07-11 23:56:58,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1682 transitions. [2022-07-11 23:56:58,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-11 23:56:58,034 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:58,034 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 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] [2022-07-11 23:56:58,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-11 23:56:58,035 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:58,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:58,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2133855853, now seen corresponding path program 1 times [2022-07-11 23:56:58,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:58,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763872042] [2022-07-11 23:56:58,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:58,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-11 23:56:58,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:58,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763872042] [2022-07-11 23:56:58,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763872042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:58,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:58,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:58,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622279931] [2022-07-11 23:56:58,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:58,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:58,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:58,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:58,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:58,135 INFO L87 Difference]: Start difference. First operand 1160 states and 1682 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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) [2022-07-11 23:56:59,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:59,043 INFO L93 Difference]: Finished difference Result 2458 states and 3563 transitions. [2022-07-11 23:56:59,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:59,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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 156 [2022-07-11 23:56:59,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:59,049 INFO L225 Difference]: With dead ends: 2458 [2022-07-11 23:56:59,049 INFO L226 Difference]: Without dead ends: 1319 [2022-07-11 23:56:59,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:59,051 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 68 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:59,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 597 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-11 23:56:59,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2022-07-11 23:56:59,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1236. [2022-07-11 23:56:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 1235 states have (on average 1.4493927125506072) internal successors, (1790), 1235 states have internal predecessors, (1790), 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) [2022-07-11 23:56:59,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1790 transitions. [2022-07-11 23:56:59,074 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1790 transitions. Word has length 156 [2022-07-11 23:56:59,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:59,075 INFO L495 AbstractCegarLoop]: Abstraction has 1236 states and 1790 transitions. [2022-07-11 23:56:59,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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) [2022-07-11 23:56:59,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1790 transitions. [2022-07-11 23:56:59,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-11 23:56:59,077 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:59,077 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-11 23:56:59,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-11 23:56:59,077 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:59,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:59,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1852047201, now seen corresponding path program 1 times [2022-07-11 23:56:59,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:59,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560709006] [2022-07-11 23:56:59,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:59,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:59,151 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-11 23:56:59,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:59,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560709006] [2022-07-11 23:56:59,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560709006] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:59,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:59,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:56:59,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857046545] [2022-07-11 23:56:59,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:59,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:56:59,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:59,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:56:59,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:56:59,153 INFO L87 Difference]: Start difference. First operand 1236 states and 1790 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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) [2022-07-11 23:56:59,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:59,190 INFO L93 Difference]: Finished difference Result 2478 states and 3592 transitions. [2022-07-11 23:56:59,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:56:59,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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 161 [2022-07-11 23:56:59,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:59,194 INFO L225 Difference]: With dead ends: 2478 [2022-07-11 23:56:59,194 INFO L226 Difference]: Without dead ends: 1263 [2022-07-11 23:56:59,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:56:59,196 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 15 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:59,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 426 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:56:59,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2022-07-11 23:56:59,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1263. [2022-07-11 23:56:59,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 1262 states have (on average 1.4461172741679873) internal successors, (1825), 1262 states have internal predecessors, (1825), 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) [2022-07-11 23:56:59,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1825 transitions. [2022-07-11 23:56:59,223 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1825 transitions. Word has length 161 [2022-07-11 23:56:59,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:59,223 INFO L495 AbstractCegarLoop]: Abstraction has 1263 states and 1825 transitions. [2022-07-11 23:56:59,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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) [2022-07-11 23:56:59,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1825 transitions. [2022-07-11 23:56:59,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-11 23:56:59,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:59,225 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-11 23:56:59,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-11 23:56:59,225 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:59,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:59,226 INFO L85 PathProgramCache]: Analyzing trace with hash -2032309729, now seen corresponding path program 1 times [2022-07-11 23:56:59,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:59,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472424157] [2022-07-11 23:56:59,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:59,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-11 23:56:59,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:59,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472424157] [2022-07-11 23:56:59,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472424157] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:59,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:59,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:56:59,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207739893] [2022-07-11 23:56:59,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:59,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:56:59,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:59,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:56:59,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:56:59,292 INFO L87 Difference]: Start difference. First operand 1263 states and 1825 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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) [2022-07-11 23:56:59,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:59,324 INFO L93 Difference]: Finished difference Result 2507 states and 3628 transitions. [2022-07-11 23:56:59,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:56:59,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 161 [2022-07-11 23:56:59,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:59,327 INFO L225 Difference]: With dead ends: 2507 [2022-07-11 23:56:59,328 INFO L226 Difference]: Without dead ends: 1265 [2022-07-11 23:56:59,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:56:59,329 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 4 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:59,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 405 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:56:59,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2022-07-11 23:56:59,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1265. [2022-07-11 23:56:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.4454113924050633) internal successors, (1827), 1264 states have internal predecessors, (1827), 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) [2022-07-11 23:56:59,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1827 transitions. [2022-07-11 23:56:59,345 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1827 transitions. Word has length 161 [2022-07-11 23:56:59,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:59,346 INFO L495 AbstractCegarLoop]: Abstraction has 1265 states and 1827 transitions. [2022-07-11 23:56:59,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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) [2022-07-11 23:56:59,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1827 transitions. [2022-07-11 23:56:59,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-11 23:56:59,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:59,348 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-11 23:56:59,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-11 23:56:59,348 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:59,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:59,348 INFO L85 PathProgramCache]: Analyzing trace with hash 813807070, now seen corresponding path program 1 times [2022-07-11 23:56:59,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:59,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355199806] [2022-07-11 23:56:59,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:59,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-11 23:56:59,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:59,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355199806] [2022-07-11 23:56:59,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355199806] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:59,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:59,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:59,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671532833] [2022-07-11 23:56:59,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:59,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:59,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:59,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:59,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:59,440 INFO L87 Difference]: Start difference. First operand 1265 states and 1827 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 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) [2022-07-11 23:57:00,712 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:57:00,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:57:00,990 INFO L93 Difference]: Finished difference Result 2651 states and 3826 transitions. [2022-07-11 23:57:00,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:57:00,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 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 163 [2022-07-11 23:57:00,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:57:00,994 INFO L225 Difference]: With dead ends: 2651 [2022-07-11 23:57:00,994 INFO L226 Difference]: Without dead ends: 1409 [2022-07-11 23:57:00,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:57:00,995 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 121 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:57:00,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 400 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-11 23:57:00,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2022-07-11 23:57:01,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1189. [2022-07-11 23:57:01,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 1188 states have (on average 1.4436026936026936) internal successors, (1715), 1188 states have internal predecessors, (1715), 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) [2022-07-11 23:57:01,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1715 transitions. [2022-07-11 23:57:01,012 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1715 transitions. Word has length 163 [2022-07-11 23:57:01,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:57:01,013 INFO L495 AbstractCegarLoop]: Abstraction has 1189 states and 1715 transitions. [2022-07-11 23:57:01,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 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) [2022-07-11 23:57:01,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1715 transitions. [2022-07-11 23:57:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-11 23:57:01,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:57:01,014 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2022-07-11 23:57:01,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-07-11 23:57:01,015 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:57:01,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:57:01,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1991742780, now seen corresponding path program 1 times [2022-07-11 23:57:01,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:57:01,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971776636] [2022-07-11 23:57:01,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:01,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:57:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:01,163 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-11 23:57:01,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:57:01,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971776636] [2022-07-11 23:57:01,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971776636] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:57:01,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:57:01,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:57:01,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305679045] [2022-07-11 23:57:01,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:57:01,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:57:01,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:57:01,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:57:01,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:57:01,165 INFO L87 Difference]: Start difference. First operand 1189 states and 1715 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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) [2022-07-11 23:57:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:57:02,043 INFO L93 Difference]: Finished difference Result 2515 states and 3626 transitions. [2022-07-11 23:57:02,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:57:02,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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 165 [2022-07-11 23:57:02,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:57:02,046 INFO L225 Difference]: With dead ends: 2515 [2022-07-11 23:57:02,046 INFO L226 Difference]: Without dead ends: 1349 [2022-07-11 23:57:02,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:57:02,047 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 62 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:57:02,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 599 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-11 23:57:02,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2022-07-11 23:57:02,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1275. [2022-07-11 23:57:02,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 1274 states have (on average 1.4419152276295133) internal successors, (1837), 1274 states have internal predecessors, (1837), 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) [2022-07-11 23:57:02,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1837 transitions. [2022-07-11 23:57:02,069 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1837 transitions. Word has length 165 [2022-07-11 23:57:02,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:57:02,069 INFO L495 AbstractCegarLoop]: Abstraction has 1275 states and 1837 transitions. [2022-07-11 23:57:02,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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) [2022-07-11 23:57:02,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1837 transitions. [2022-07-11 23:57:02,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-11 23:57:02,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:57:02,071 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2022-07-11 23:57:02,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-11 23:57:02,072 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:57:02,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:57:02,072 INFO L85 PathProgramCache]: Analyzing trace with hash -204178227, now seen corresponding path program 1 times [2022-07-11 23:57:02,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:57:02,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886357080] [2022-07-11 23:57:02,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:02,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:57:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:02,170 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-11 23:57:02,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:57:02,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886357080] [2022-07-11 23:57:02,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886357080] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:57:02,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:57:02,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:57:02,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289227798] [2022-07-11 23:57:02,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:57:02,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:57:02,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:57:02,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:57:02,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:57:02,172 INFO L87 Difference]: Start difference. First operand 1275 states and 1837 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 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) [2022-07-11 23:57:03,217 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:57:03,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:57:03,455 INFO L93 Difference]: Finished difference Result 2591 states and 3733 transitions. [2022-07-11 23:57:03,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:57:03,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 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 166 [2022-07-11 23:57:03,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:57:03,457 INFO L225 Difference]: With dead ends: 2591 [2022-07-11 23:57:03,458 INFO L226 Difference]: Without dead ends: 1335 [2022-07-11 23:57:03,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:57:03,459 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 54 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:57:03,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 601 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-11 23:57:03,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2022-07-11 23:57:03,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1273. [2022-07-11 23:57:03,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 1272 states have (on average 1.4410377358490567) internal successors, (1833), 1272 states have internal predecessors, (1833), 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) [2022-07-11 23:57:03,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1833 transitions. [2022-07-11 23:57:03,481 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1833 transitions. Word has length 166 [2022-07-11 23:57:03,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:57:03,481 INFO L495 AbstractCegarLoop]: Abstraction has 1273 states and 1833 transitions. [2022-07-11 23:57:03,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 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) [2022-07-11 23:57:03,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1833 transitions. [2022-07-11 23:57:03,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-11 23:57:03,483 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:57:03,483 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:57:03,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-11 23:57:03,484 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:57:03,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:57:03,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1438223023, now seen corresponding path program 1 times [2022-07-11 23:57:03,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:57:03,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772622500] [2022-07-11 23:57:03,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:03,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:57:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:03,785 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2022-07-11 23:57:03,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:57:03,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772622500] [2022-07-11 23:57:03,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772622500] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:57:03,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:57:03,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:57:03,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481433342] [2022-07-11 23:57:03,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:57:03,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:57:03,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:57:03,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:57:03,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:57:03,787 INFO L87 Difference]: Start difference. First operand 1273 states and 1833 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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) [2022-07-11 23:57:05,602 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:57:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:57:05,856 INFO L93 Difference]: Finished difference Result 2543 states and 3662 transitions. [2022-07-11 23:57:05,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:57:05,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 172 [2022-07-11 23:57:05,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:57:05,859 INFO L225 Difference]: With dead ends: 2543 [2022-07-11 23:57:05,859 INFO L226 Difference]: Without dead ends: 1273 [2022-07-11 23:57:05,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:57:05,860 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 7 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:57:05,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 735 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-11 23:57:05,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2022-07-11 23:57:05,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1273. [2022-07-11 23:57:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 1272 states have (on average 1.440251572327044) internal successors, (1832), 1272 states have internal predecessors, (1832), 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) [2022-07-11 23:57:05,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1832 transitions. [2022-07-11 23:57:05,877 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1832 transitions. Word has length 172 [2022-07-11 23:57:05,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:57:05,877 INFO L495 AbstractCegarLoop]: Abstraction has 1273 states and 1832 transitions. [2022-07-11 23:57:05,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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) [2022-07-11 23:57:05,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1832 transitions. [2022-07-11 23:57:05,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-11 23:57:05,879 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:57:05,879 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:57:05,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-11 23:57:05,879 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:57:05,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:57:05,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1353645967, now seen corresponding path program 1 times [2022-07-11 23:57:05,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:57:05,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997558808] [2022-07-11 23:57:05,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:05,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:57:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:06,441 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-11 23:57:06,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:57:06,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997558808] [2022-07-11 23:57:06,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997558808] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:57:06,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265905331] [2022-07-11 23:57:06,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:06,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:57:06,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:57:06,464 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) [2022-07-11 23:57:06,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-11 23:57:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:07,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 1086 conjuncts, 190 conjunts are in the unsatisfiable core [2022-07-11 23:57:07,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:57:07,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:07,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:07,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:07,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:07,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:07,835 INFO L356 Elim1Store]: treesize reduction 1040, result has 8.0 percent of original size [2022-07-11 23:57:07,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 10489949 treesize of output 1501290 [2022-07-11 23:57:08,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:08,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:08,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:13,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:13,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:13,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:13,781 INFO L244 Elim1Store]: Index analysis took 280 ms [2022-07-11 23:58:09,411 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-11 23:58:09,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-11 23:58:09,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-07-11 23:58:09,612 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 216927 column 7: canceled at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 216927 column 7: canceled at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.pushContext(SimplifyDDA.java:736) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:389) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:648) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 54 more [2022-07-11 23:58:09,620 INFO L158 Benchmark]: Toolchain (without parser) took 118346.91ms. Allocated memory was 125.8MB in the beginning and 8.9GB in the end (delta: 8.7GB). Free memory was 85.8MB in the beginning and 6.8GB in the end (delta: -6.7GB). Peak memory consumption was 4.9GB. Max. memory is 16.1GB. [2022-07-11 23:58:09,620 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 104.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:58:09,620 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.27ms. Allocated memory is still 125.8MB. Free memory was 85.6MB in the beginning and 79.6MB in the end (delta: 6.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-11 23:58:09,620 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.00ms. Allocated memory is still 125.8MB. Free memory was 79.6MB in the beginning and 74.6MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-11 23:58:09,620 INFO L158 Benchmark]: Boogie Preprocessor took 95.15ms. Allocated memory is still 125.8MB. Free memory was 74.6MB in the beginning and 67.4MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-11 23:58:09,620 INFO L158 Benchmark]: RCFGBuilder took 2567.47ms. Allocated memory was 125.8MB in the beginning and 172.0MB in the end (delta: 46.1MB). Free memory was 67.4MB in the beginning and 82.7MB in the end (delta: -15.3MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2022-07-11 23:58:09,621 INFO L158 Benchmark]: TraceAbstraction took 115139.55ms. Allocated memory was 172.0MB in the beginning and 8.9GB in the end (delta: 8.7GB). Free memory was 81.5MB in the beginning and 6.8GB in the end (delta: -6.8GB). Peak memory consumption was 4.8GB. Max. memory is 16.1GB. [2022-07-11 23:58:09,621 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.15ms. Allocated memory is still 125.8MB. Free memory is still 104.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 476.27ms. Allocated memory is still 125.8MB. Free memory was 85.6MB in the beginning and 79.6MB in the end (delta: 6.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.00ms. Allocated memory is still 125.8MB. Free memory was 79.6MB in the beginning and 74.6MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.15ms. Allocated memory is still 125.8MB. Free memory was 74.6MB in the beginning and 67.4MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2567.47ms. Allocated memory was 125.8MB in the beginning and 172.0MB in the end (delta: 46.1MB). Free memory was 67.4MB in the beginning and 82.7MB in the end (delta: -15.3MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. * TraceAbstraction took 115139.55ms. Allocated memory was 172.0MB in the beginning and 8.9GB in the end (delta: 8.7GB). Free memory was 81.5MB in the beginning and 6.8GB in the end (delta: -6.8GB). Peak memory consumption was 4.8GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 216927 column 7: canceled de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 216927 column 7: canceled: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-11 23:58:09,834 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-07-11 23:58:09,850 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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/openssl/s3_srvr.blast.16.i.cil-1.c -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 0b79f6e49ac032444452c6675a01007f08f3b698920d88701561807a0669494d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:58:11,958 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:58:11,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:58:11,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:58:11,977 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:58:11,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:58:11,979 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:58:11,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:58:11,981 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:58:11,981 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:58:11,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:58:11,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:58:11,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:58:11,983 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:58:11,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:58:11,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:58:11,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:58:11,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:58:11,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:58:11,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:58:11,989 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:58:11,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:58:11,990 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:58:11,991 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:58:11,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:58:11,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:58:11,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:58:11,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:58:11,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:58:11,995 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:58:11,996 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:58:11,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:58:11,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:58:11,997 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:58:11,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:58:11,998 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:58:11,998 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:58:11,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:58:11,999 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:58:11,999 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:58:11,999 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:58:12,000 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:58:12,001 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-11 23:58:12,015 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:58:12,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:58:12,015 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:58:12,015 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:58:12,016 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:58:12,016 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:58:12,016 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:58:12,017 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:58:12,017 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:58:12,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:58:12,017 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:58:12,017 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:58:12,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:58:12,017 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:58:12,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:58:12,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:58:12,021 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-11 23:58:12,022 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-11 23:58:12,022 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-11 23:58:12,022 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:58:12,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:58:12,022 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:58:12,022 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:58:12,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:58:12,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:58:12,023 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:58:12,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:58:12,023 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:58:12,023 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:58:12,023 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:58:12,024 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-11 23:58:12,024 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-11 23:58:12,024 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:58:12,024 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:58:12,024 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:58:12,024 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-11 23:58:12,025 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 -> 0b79f6e49ac032444452c6675a01007f08f3b698920d88701561807a0669494d [2022-07-11 23:58:12,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:58:12,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:58:12,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:58:12,278 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:58:12,279 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:58:12,281 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.16.i.cil-1.c [2022-07-11 23:58:12,326 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/380df844b/9a9a945ebe104742b2632a7d3fa644a7/FLAGb474d098b [2022-07-11 23:58:12,805 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:58:12,814 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.16.i.cil-1.c [2022-07-11 23:58:12,825 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/380df844b/9a9a945ebe104742b2632a7d3fa644a7/FLAGb474d098b [2022-07-11 23:58:12,839 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/380df844b/9a9a945ebe104742b2632a7d3fa644a7 [2022-07-11 23:58:12,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:58:12,842 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:58:12,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:58:12,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:58:12,857 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:58:12,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:58:12" (1/1) ... [2022-07-11 23:58:12,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@440f2b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:12, skipping insertion in model container [2022-07-11 23:58:12,859 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:58:12" (1/1) ... [2022-07-11 23:58:12,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:58:12,934 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:58:13,190 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.16.i.cil-1.c[77378,77391] [2022-07-11 23:58:13,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:58:13,209 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-11 23:58:13,214 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:58:13,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.16.i.cil-1.c[77378,77391] [2022-07-11 23:58:13,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:58:13,290 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:58:13,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.16.i.cil-1.c[77378,77391] [2022-07-11 23:58:13,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:58:13,393 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:58:13,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:13 WrapperNode [2022-07-11 23:58:13,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:58:13,394 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:58:13,394 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:58:13,394 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:58:13,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:13" (1/1) ... [2022-07-11 23:58:13,415 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:13" (1/1) ... [2022-07-11 23:58:13,472 INFO L137 Inliner]: procedures = 35, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 779 [2022-07-11 23:58:13,473 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:58:13,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:58:13,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:58:13,474 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:58:13,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:13" (1/1) ... [2022-07-11 23:58:13,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:13" (1/1) ... [2022-07-11 23:58:13,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:13" (1/1) ... [2022-07-11 23:58:13,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:13" (1/1) ... [2022-07-11 23:58:13,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:13" (1/1) ... [2022-07-11 23:58:13,525 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:13" (1/1) ... [2022-07-11 23:58:13,528 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:13" (1/1) ... [2022-07-11 23:58:13,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:58:13,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:58:13,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:58:13,534 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:58:13,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:13" (1/1) ... [2022-07-11 23:58:13,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:58:13,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:58:13,558 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) [2022-07-11 23:58:13,575 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 [2022-07-11 23:58:13,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:58:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-11 23:58:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-11 23:58:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-11 23:58:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-11 23:58:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:58:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:58:13,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:58:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-11 23:58:13,782 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:58:13,783 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:58:13,797 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:58:19,854 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-11 23:58:19,855 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-11 23:58:19,855 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:58:19,861 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:58:19,861 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:58:19,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:58:19 BoogieIcfgContainer [2022-07-11 23:58:19,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:58:19,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:58:19,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:58:19,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:58:19,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:58:12" (1/3) ... [2022-07-11 23:58:19,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b998a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:58:19, skipping insertion in model container [2022-07-11 23:58:19,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:13" (2/3) ... [2022-07-11 23:58:19,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b998a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:58:19, skipping insertion in model container [2022-07-11 23:58:19,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:58:19" (3/3) ... [2022-07-11 23:58:19,872 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.16.i.cil-1.c [2022-07-11 23:58:19,881 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:58:19,882 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:58:19,939 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:58:19,944 INFO L357 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, mAutomataTypeConcurrency=PETRI_NET, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1bbef06f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2a64a0cd [2022-07-11 23:58:19,944 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:58:19,947 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 156 states have (on average 1.7307692307692308) internal successors, (270), 157 states have internal predecessors, (270), 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) [2022-07-11 23:58:19,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-11 23:58:19,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:58:19,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:19,954 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:58:19,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:58:19,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1590777092, now seen corresponding path program 1 times [2022-07-11 23:58:19,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:58:19,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171699228] [2022-07-11 23:58:19,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:19,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:58:19,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:58:19,970 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) [2022-07-11 23:58:19,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-11 23:58:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:20,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-11 23:58:20,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:58:20,789 INFO L390 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 [2022-07-11 23:58:20,802 INFO L390 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 [2022-07-11 23:58:21,328 INFO L356 Elim1Store]: treesize reduction 1496, result has 4.7 percent of original size [2022-07-11 23:58:21,328 INFO L390 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 8 case distinctions, treesize of input 78 treesize of output 85 [2022-07-11 23:58:21,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 36 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 85 [2022-07-11 23:58:21,614 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-11 23:58:21,614 INFO L390 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 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-11 23:58:21,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:21,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2022-07-11 23:58:21,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-11 23:58:21,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-11 23:58:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:58:21,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:58:21,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:58:21,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171699228] [2022-07-11 23:58:21,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1171699228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:58:21,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:58:21,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:58:21,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768558855] [2022-07-11 23:58:21,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:58:21,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:58:21,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:58:21,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:58:21,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:58:21,742 INFO L87 Difference]: Start difference. First operand has 158 states, 156 states have (on average 1.7307692307692308) internal successors, (270), 157 states have internal predecessors, (270), 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 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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) [2022-07-11 23:58:23,768 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:58:25,774 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:58:31,072 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:58:33,509 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:58:35,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:58:35,357 INFO L93 Difference]: Finished difference Result 317 states and 539 transitions. [2022-07-11 23:58:35,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:58:35,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 45 [2022-07-11 23:58:35,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:58:35,369 INFO L225 Difference]: With dead ends: 317 [2022-07-11 23:58:35,369 INFO L226 Difference]: Without dead ends: 145 [2022-07-11 23:58:35,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:58:35,376 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 10 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:58:35,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 889 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 2 Unknown, 0 Unchecked, 13.5s Time] [2022-07-11 23:58:35,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-11 23:58:35,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-07-11 23:58:35,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.5625) internal successors, (225), 144 states have internal predecessors, (225), 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) [2022-07-11 23:58:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 225 transitions. [2022-07-11 23:58:35,445 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 225 transitions. Word has length 45 [2022-07-11 23:58:35,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:58:35,446 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 225 transitions. [2022-07-11 23:58:35,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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) [2022-07-11 23:58:35,446 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 225 transitions. [2022-07-11 23:58:35,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-11 23:58:35,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:58:35,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:35,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-11 23:58:35,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:58:35,668 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:58:35,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:58:35,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1806796926, now seen corresponding path program 1 times [2022-07-11 23:58:35,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:58:35,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458933373] [2022-07-11 23:58:35,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:35,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:58:35,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:58:35,673 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) [2022-07-11 23:58:35,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-11 23:58:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:36,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:58:36,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:58:36,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:36,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:36,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:36,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:36,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:36,376 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:58:36,624 INFO L356 Elim1Store]: treesize reduction 1124, result has 5.4 percent of original size [2022-07-11 23:58:36,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 74 [2022-07-11 23:58:36,899 INFO L356 Elim1Store]: treesize reduction 825, result has 7.2 percent of original size [2022-07-11 23:58:36,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 13 case distinctions, treesize of input 66 treesize of output 86 [2022-07-11 23:58:37,109 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:58:37,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 23 [2022-07-11 23:58:37,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:58:37,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:58:37,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:58:37,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458933373] [2022-07-11 23:58:37,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458933373] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:58:37,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:58:37,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:58:37,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419790442] [2022-07-11 23:58:37,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:58:37,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:58:37,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:58:37,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:58:37,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:58:37,125 INFO L87 Difference]: Start difference. First operand 145 states and 225 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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) [2022-07-11 23:58:39,145 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:58:41,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:58:46,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:58:46,271 INFO L93 Difference]: Finished difference Result 308 states and 478 transitions. [2022-07-11 23:58:46,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:58:46,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 45 [2022-07-11 23:58:46,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:58:46,274 INFO L225 Difference]: With dead ends: 308 [2022-07-11 23:58:46,274 INFO L226 Difference]: Without dead ends: 173 [2022-07-11 23:58:46,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:58:46,275 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 22 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:58:46,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 515 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 149 Invalid, 1 Unknown, 0 Unchecked, 9.1s Time] [2022-07-11 23:58:46,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-07-11 23:58:46,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 156. [2022-07-11 23:58:46,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 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) [2022-07-11 23:58:46,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 244 transitions. [2022-07-11 23:58:46,283 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 244 transitions. Word has length 45 [2022-07-11 23:58:46,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:58:46,283 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 244 transitions. [2022-07-11 23:58:46,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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) [2022-07-11 23:58:46,283 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 244 transitions. [2022-07-11 23:58:46,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-11 23:58:46,284 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:58:46,284 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:46,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-11 23:58:46,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:58:46,485 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:58:46,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:58:46,486 INFO L85 PathProgramCache]: Analyzing trace with hash 774668882, now seen corresponding path program 1 times [2022-07-11 23:58:46,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:58:46,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798712452] [2022-07-11 23:58:46,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:46,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:58:46,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:58:46,488 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) [2022-07-11 23:58:46,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-11 23:58:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:47,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-11 23:58:47,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:58:47,575 INFO L356 Elim1Store]: treesize reduction 1104, result has 5.5 percent of original size [2022-07-11 23:58:47,576 INFO L390 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 7 case distinctions, treesize of input 69 treesize of output 73 [2022-07-11 23:58:47,690 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-11 23:58:47,690 INFO L390 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 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-11 23:58:47,726 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:58:47,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:58:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:58:47,744 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:58:47,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:58:47,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [798712452] [2022-07-11 23:58:47,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [798712452] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:58:47,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:58:47,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:58:47,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882591082] [2022-07-11 23:58:47,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:58:47,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:58:47,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:58:47,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:58:47,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:58:47,746 INFO L87 Difference]: Start difference. First operand 156 states and 244 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) [2022-07-11 23:58:49,761 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:58:51,708 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:58:54,238 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:58:55,541 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:58:55,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:58:55,928 INFO L93 Difference]: Finished difference Result 302 states and 470 transitions. [2022-07-11 23:58:55,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:58:55,929 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 58 [2022-07-11 23:58:55,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:58:55,932 INFO L225 Difference]: With dead ends: 302 [2022-07-11 23:58:55,932 INFO L226 Difference]: Without dead ends: 167 [2022-07-11 23:58:55,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:58:55,936 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 17 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:58:55,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 544 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 1 Unknown, 20 Unchecked, 8.2s Time] [2022-07-11 23:58:55,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-11 23:58:55,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 156. [2022-07-11 23:58:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.5677419354838709) internal successors, (243), 155 states have internal predecessors, (243), 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) [2022-07-11 23:58:55,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 243 transitions. [2022-07-11 23:58:55,949 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 243 transitions. Word has length 58 [2022-07-11 23:58:55,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:58:55,950 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 243 transitions. [2022-07-11 23:58:55,950 INFO L496 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) [2022-07-11 23:58:55,950 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 243 transitions. [2022-07-11 23:58:55,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-11 23:58:55,951 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:58:55,951 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:55,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-11 23:58:56,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:58:56,168 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:58:56,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:58:56,169 INFO L85 PathProgramCache]: Analyzing trace with hash -713896793, now seen corresponding path program 1 times [2022-07-11 23:58:56,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:58:56,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686642475] [2022-07-11 23:58:56,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:56,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:58:56,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:58:56,171 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) [2022-07-11 23:58:56,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-11 23:58:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:57,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-11 23:58:57,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:58:57,445 INFO L356 Elim1Store]: treesize reduction 1105, result has 5.5 percent of original size [2022-07-11 23:58:57,446 INFO L390 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 7 case distinctions, treesize of input 69 treesize of output 73 [2022-07-11 23:58:57,560 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-11 23:58:57,560 INFO L390 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 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-11 23:58:57,585 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:58:57,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:58:57,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:58:57,600 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:58:57,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:58:57,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686642475] [2022-07-11 23:58:57,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686642475] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:58:57,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:58:57,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:58:57,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119495833] [2022-07-11 23:58:57,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:58:57,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:58:57,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:58:57,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:58:57,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:58:57,601 INFO L87 Difference]: Start difference. First operand 156 states and 243 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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) [2022-07-11 23:58:59,618 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:59:01,784 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:59:01,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:01,960 INFO L93 Difference]: Finished difference Result 303 states and 473 transitions. [2022-07-11 23:59:01,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:59:01,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2022-07-11 23:59:01,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:01,963 INFO L225 Difference]: With dead ends: 303 [2022-07-11 23:59:01,963 INFO L226 Difference]: Without dead ends: 168 [2022-07-11 23:59:01,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:59:01,964 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 18 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:01,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 542 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 87 Invalid, 1 Unknown, 15 Unchecked, 4.3s Time] [2022-07-11 23:59:01,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-11 23:59:01,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-07-11 23:59:01,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.5508982035928143) internal successors, (259), 167 states have internal predecessors, (259), 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) [2022-07-11 23:59:01,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 259 transitions. [2022-07-11 23:59:01,969 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 259 transitions. Word has length 59 [2022-07-11 23:59:01,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:01,969 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 259 transitions. [2022-07-11 23:59:01,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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) [2022-07-11 23:59:01,969 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 259 transitions. [2022-07-11 23:59:01,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-11 23:59:01,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:01,970 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:59:01,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-11 23:59:02,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:59:02,171 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:02,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:02,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1173006651, now seen corresponding path program 1 times [2022-07-11 23:59:02,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:59:02,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289542311] [2022-07-11 23:59:02,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:02,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:59:02,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:59:02,175 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) [2022-07-11 23:59:02,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-11 23:59:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:03,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-11 23:59:03,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:59:03,417 INFO L356 Elim1Store]: treesize reduction 1105, result has 5.5 percent of original size [2022-07-11 23:59:03,417 INFO L390 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 7 case distinctions, treesize of input 69 treesize of output 73 [2022-07-11 23:59:03,576 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-11 23:59:03,576 INFO L390 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 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-11 23:59:03,603 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:59:03,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:59:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:59:03,624 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:59:03,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:59:03,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289542311] [2022-07-11 23:59:03,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289542311] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:03,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:59:03,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:59:03,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899031210] [2022-07-11 23:59:03,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:03,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:59:03,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:59:03,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:59:03,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:59:03,626 INFO L87 Difference]: Start difference. First operand 168 states and 259 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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) [2022-07-11 23:59:05,642 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:59:07,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:07,393 INFO L93 Difference]: Finished difference Result 316 states and 490 transitions. [2022-07-11 23:59:07,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:59:07,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2022-07-11 23:59:07,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:07,395 INFO L225 Difference]: With dead ends: 316 [2022-07-11 23:59:07,395 INFO L226 Difference]: Without dead ends: 169 [2022-07-11 23:59:07,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:59:07,396 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 18 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:07,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 566 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 88 Invalid, 1 Unknown, 16 Unchecked, 3.7s Time] [2022-07-11 23:59:07,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-11 23:59:07,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-07-11 23:59:07,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.5416666666666667) internal successors, (259), 168 states have internal predecessors, (259), 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) [2022-07-11 23:59:07,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 259 transitions. [2022-07-11 23:59:07,406 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 259 transitions. Word has length 59 [2022-07-11 23:59:07,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:07,407 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 259 transitions. [2022-07-11 23:59:07,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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) [2022-07-11 23:59:07,407 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 259 transitions. [2022-07-11 23:59:07,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-11 23:59:07,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:07,408 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2022-07-11 23:59:07,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-11 23:59:07,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:59:07,619 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:07,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:07,620 INFO L85 PathProgramCache]: Analyzing trace with hash 320889874, now seen corresponding path program 1 times [2022-07-11 23:59:07,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:59:07,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699545291] [2022-07-11 23:59:07,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:07,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:59:07,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:59:07,622 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) [2022-07-11 23:59:07,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-11 23:59:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:08,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-11 23:59:08,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:59:08,913 INFO L356 Elim1Store]: treesize reduction 1104, result has 5.5 percent of original size [2022-07-11 23:59:08,914 INFO L390 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 7 case distinctions, treesize of input 69 treesize of output 73 [2022-07-11 23:59:09,135 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-11 23:59:09,136 INFO L390 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 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-11 23:59:09,211 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:59:09,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:59:09,246 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:59:09,246 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:59:09,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:59:09,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699545291] [2022-07-11 23:59:09,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699545291] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:09,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:59:09,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:59:09,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574809569] [2022-07-11 23:59:09,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:09,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:59:09,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:59:09,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:59:09,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:59:09,248 INFO L87 Difference]: Start difference. First operand 169 states and 259 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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) [2022-07-11 23:59:11,275 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:59:16,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:16,555 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-07-11 23:59:16,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:59:16,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2022-07-11 23:59:16,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:16,557 INFO L225 Difference]: With dead ends: 329 [2022-07-11 23:59:16,557 INFO L226 Difference]: Without dead ends: 181 [2022-07-11 23:59:16,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:59:16,558 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 16 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:16,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 525 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 1 Unknown, 23 Unchecked, 7.3s Time] [2022-07-11 23:59:16,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-11 23:59:16,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 169. [2022-07-11 23:59:16,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.5357142857142858) internal successors, (258), 168 states have internal predecessors, (258), 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) [2022-07-11 23:59:16,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 258 transitions. [2022-07-11 23:59:16,562 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 258 transitions. Word has length 59 [2022-07-11 23:59:16,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:16,562 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 258 transitions. [2022-07-11 23:59:16,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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) [2022-07-11 23:59:16,562 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 258 transitions. [2022-07-11 23:59:16,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-11 23:59:16,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:16,563 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2022-07-11 23:59:16,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-11 23:59:16,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:59:16,775 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:16,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:16,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1682330414, now seen corresponding path program 1 times [2022-07-11 23:59:16,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:59:16,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650837745] [2022-07-11 23:59:16,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:16,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:59:16,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:59:16,778 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) [2022-07-11 23:59:16,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-11 23:59:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:17,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-11 23:59:17,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:59:17,950 INFO L356 Elim1Store]: treesize reduction 1104, result has 5.5 percent of original size [2022-07-11 23:59:17,950 INFO L390 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 7 case distinctions, treesize of input 69 treesize of output 73 [2022-07-11 23:59:18,140 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-11 23:59:18,140 INFO L390 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 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-11 23:59:18,207 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:59:18,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:59:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:59:18,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:59:18,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:59:18,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [650837745] [2022-07-11 23:59:18,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [650837745] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:18,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:59:18,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:59:18,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901815645] [2022-07-11 23:59:18,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:18,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:59:18,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:59:18,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:59:18,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:59:18,228 INFO L87 Difference]: Start difference. First operand 169 states and 258 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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) [2022-07-11 23:59:20,242 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:59:22,419 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:59:25,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:25,450 INFO L93 Difference]: Finished difference Result 327 states and 501 transitions. [2022-07-11 23:59:25,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:59:25,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2022-07-11 23:59:25,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:25,452 INFO L225 Difference]: With dead ends: 327 [2022-07-11 23:59:25,452 INFO L226 Difference]: Without dead ends: 179 [2022-07-11 23:59:25,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:59:25,453 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 15 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:25,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 531 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 1 Unknown, 20 Unchecked, 7.2s Time] [2022-07-11 23:59:25,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-11 23:59:25,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 169. [2022-07-11 23:59:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.5297619047619047) internal successors, (257), 168 states have internal predecessors, (257), 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) [2022-07-11 23:59:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 257 transitions. [2022-07-11 23:59:25,456 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 257 transitions. Word has length 59 [2022-07-11 23:59:25,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:25,456 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 257 transitions. [2022-07-11 23:59:25,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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) [2022-07-11 23:59:25,456 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 257 transitions. [2022-07-11 23:59:25,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-11 23:59:25,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:25,457 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:59:25,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-11 23:59:25,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:59:25,667 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:25,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:25,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1666972293, now seen corresponding path program 1 times [2022-07-11 23:59:25,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:59:25,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469155841] [2022-07-11 23:59:25,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:25,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:59:25,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:59:25,670 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) [2022-07-11 23:59:25,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-11 23:59:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:26,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-11 23:59:26,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:59:26,895 INFO L356 Elim1Store]: treesize reduction 1105, result has 5.5 percent of original size [2022-07-11 23:59:26,895 INFO L390 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 7 case distinctions, treesize of input 69 treesize of output 73 [2022-07-11 23:59:27,013 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-11 23:59:27,014 INFO L390 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 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-11 23:59:27,045 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:59:27,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:59:27,059 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:59:27,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:59:27,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:59:27,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469155841] [2022-07-11 23:59:27,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469155841] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:27,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:59:27,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:59:27,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216172703] [2022-07-11 23:59:27,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:27,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:59:27,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:59:27,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:59:27,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:59:27,061 INFO L87 Difference]: Start difference. First operand 169 states and 257 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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) [2022-07-11 23:59:29,076 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:59:30,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:30,541 INFO L93 Difference]: Finished difference Result 318 states and 489 transitions. [2022-07-11 23:59:30,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:59:30,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2022-07-11 23:59:30,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:30,543 INFO L225 Difference]: With dead ends: 318 [2022-07-11 23:59:30,543 INFO L226 Difference]: Without dead ends: 170 [2022-07-11 23:59:30,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:59:30,544 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 18 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:30,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 538 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 89 Invalid, 1 Unknown, 17 Unchecked, 3.5s Time] [2022-07-11 23:59:30,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-11 23:59:30,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-07-11 23:59:30,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.5207100591715976) internal successors, (257), 169 states have internal predecessors, (257), 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) [2022-07-11 23:59:30,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 257 transitions. [2022-07-11 23:59:30,548 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 257 transitions. Word has length 60 [2022-07-11 23:59:30,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:30,548 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 257 transitions. [2022-07-11 23:59:30,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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) [2022-07-11 23:59:30,548 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 257 transitions. [2022-07-11 23:59:30,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-11 23:59:30,549 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:30,549 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2022-07-11 23:59:30,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-11 23:59:30,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:59:30,760 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:30,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:30,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1752756352, now seen corresponding path program 1 times [2022-07-11 23:59:30,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:59:30,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240757283] [2022-07-11 23:59:30,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:30,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:59:30,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:59:30,762 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) [2022-07-11 23:59:30,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-11 23:59:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:31,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-11 23:59:31,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:59:32,031 INFO L356 Elim1Store]: treesize reduction 1105, result has 5.5 percent of original size [2022-07-11 23:59:32,031 INFO L390 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 7 case distinctions, treesize of input 69 treesize of output 73 [2022-07-11 23:59:32,129 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-11 23:59:32,130 INFO L390 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 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-11 23:59:32,156 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:59:32,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:59:32,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:59:32,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:59:32,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:59:32,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240757283] [2022-07-11 23:59:32,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240757283] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:32,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:59:32,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:59:32,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981054993] [2022-07-11 23:59:32,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:32,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:59:32,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:59:32,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:59:32,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:59:32,175 INFO L87 Difference]: Start difference. First operand 170 states and 257 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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) [2022-07-11 23:59:34,194 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:59:36,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:36,079 INFO L93 Difference]: Finished difference Result 320 states and 490 transitions. [2022-07-11 23:59:36,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:59:36,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2022-07-11 23:59:36,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:36,081 INFO L225 Difference]: With dead ends: 320 [2022-07-11 23:59:36,081 INFO L226 Difference]: Without dead ends: 171 [2022-07-11 23:59:36,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:59:36,082 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 18 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:36,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 536 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 90 Invalid, 1 Unknown, 18 Unchecked, 3.9s Time] [2022-07-11 23:59:36,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-11 23:59:36,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-11 23:59:36,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.511764705882353) internal successors, (257), 170 states have internal predecessors, (257), 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) [2022-07-11 23:59:36,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 257 transitions. [2022-07-11 23:59:36,085 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 257 transitions. Word has length 61 [2022-07-11 23:59:36,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:36,085 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 257 transitions. [2022-07-11 23:59:36,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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) [2022-07-11 23:59:36,085 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 257 transitions. [2022-07-11 23:59:36,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-11 23:59:36,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:36,086 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:59:36,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-11 23:59:36,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:59:36,297 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:36,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:36,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1654924640, now seen corresponding path program 1 times [2022-07-11 23:59:36,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:59:36,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294944529] [2022-07-11 23:59:36,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:36,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:59:36,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:59:36,299 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) [2022-07-11 23:59:36,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-11 23:59:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:37,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-11 23:59:37,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:59:37,672 INFO L356 Elim1Store]: treesize reduction 1105, result has 5.5 percent of original size [2022-07-11 23:59:37,672 INFO L390 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 7 case distinctions, treesize of input 69 treesize of output 73 [2022-07-11 23:59:37,781 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-11 23:59:37,782 INFO L390 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 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-11 23:59:37,813 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:59:37,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:59:37,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:59:37,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:59:37,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:59:37,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294944529] [2022-07-11 23:59:37,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294944529] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:37,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:59:37,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:59:37,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335252930] [2022-07-11 23:59:37,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:37,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:59:37,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:59:37,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:59:37,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:59:37,828 INFO L87 Difference]: Start difference. First operand 171 states and 257 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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) [2022-07-11 23:59:39,842 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:59:41,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:41,714 INFO L93 Difference]: Finished difference Result 322 states and 491 transitions. [2022-07-11 23:59:41,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:59:41,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2022-07-11 23:59:41,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:41,717 INFO L225 Difference]: With dead ends: 322 [2022-07-11 23:59:41,717 INFO L226 Difference]: Without dead ends: 172 [2022-07-11 23:59:41,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:59:41,718 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 18 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:41,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 542 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 91 Invalid, 1 Unknown, 19 Unchecked, 3.9s Time] [2022-07-11 23:59:41,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-11 23:59:41,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2022-07-11 23:59:41,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.5029239766081872) internal successors, (257), 171 states have internal predecessors, (257), 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) [2022-07-11 23:59:41,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2022-07-11 23:59:41,722 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 62 [2022-07-11 23:59:41,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:41,722 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2022-07-11 23:59:41,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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) [2022-07-11 23:59:41,722 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2022-07-11 23:59:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-11 23:59:41,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:41,723 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-07-11 23:59:41,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-11 23:59:41,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:59:41,940 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:41,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:41,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1043051208, now seen corresponding path program 1 times [2022-07-11 23:59:41,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:59:41,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179534650] [2022-07-11 23:59:41,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:41,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:59:41,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:59:41,943 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) [2022-07-11 23:59:41,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-11 23:59:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:42,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:59:42,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:59:42,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:59:42,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:59:43,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:59:43,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:59:43,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:59:43,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:59:43,413 INFO L356 Elim1Store]: treesize reduction 1109, result has 5.5 percent of original size [2022-07-11 23:59:43,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 73 [2022-07-11 23:59:43,691 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:59:43,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 22 [2022-07-11 23:59:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:59:43,710 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:59:43,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:59:43,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179534650] [2022-07-11 23:59:43,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179534650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:43,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:59:43,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:59:43,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856374134] [2022-07-11 23:59:43,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:43,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:59:43,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:59:43,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:59:43,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:59:43,712 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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) [2022-07-11 23:59:45,729 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:59:52,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:52,264 INFO L93 Difference]: Finished difference Result 355 states and 537 transitions. [2022-07-11 23:59:52,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:59:52,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2022-07-11 23:59:52,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:52,266 INFO L225 Difference]: With dead ends: 355 [2022-07-11 23:59:52,267 INFO L226 Difference]: Without dead ends: 204 [2022-07-11 23:59:52,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:59:52,267 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 22 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:52,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 553 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 150 Invalid, 1 Unknown, 0 Unchecked, 8.5s Time] [2022-07-11 23:59:52,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-11 23:59:52,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 194. [2022-07-11 23:59:52,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.5025906735751295) internal successors, (290), 193 states have internal predecessors, (290), 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) [2022-07-11 23:59:52,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 290 transitions. [2022-07-11 23:59:52,271 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 290 transitions. Word has length 62 [2022-07-11 23:59:52,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:52,271 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 290 transitions. [2022-07-11 23:59:52,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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) [2022-07-11 23:59:52,271 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 290 transitions. [2022-07-11 23:59:52,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-11 23:59:52,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:52,272 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:59:52,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-11 23:59:52,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:59:52,472 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:52,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:52,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1596121160, now seen corresponding path program 1 times [2022-07-11 23:59:52,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:59:52,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454832968] [2022-07-11 23:59:52,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:52,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:59:52,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:59:52,475 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) [2022-07-11 23:59:52,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-11 23:59:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:53,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-11 23:59:53,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:59:54,336 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-11 23:59:54,336 INFO L390 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 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-11 23:59:54,394 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:59:54,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:59:54,425 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:59:54,426 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:59:54,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:59:54,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454832968] [2022-07-11 23:59:54,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454832968] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:54,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:59:54,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:59:54,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472750186] [2022-07-11 23:59:54,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:54,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:59:54,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:59:54,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:59:54,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:59:54,427 INFO L87 Difference]: Start difference. First operand 194 states and 290 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) [2022-07-11 23:59:56,448 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 00:00:00,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:00:00,463 INFO L93 Difference]: Finished difference Result 367 states and 556 transitions. [2022-07-12 00:00:00,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 00:00:00,465 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 75 [2022-07-12 00:00:00,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:00:00,466 INFO L225 Difference]: With dead ends: 367 [2022-07-12 00:00:00,466 INFO L226 Difference]: Without dead ends: 194 [2022-07-12 00:00:00,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 00:00:00,467 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 10 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-12 00:00:00,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 569 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 1 Unknown, 16 Unchecked, 6.0s Time] [2022-07-12 00:00:00,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-12 00:00:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2022-07-12 00:00:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.4974093264248705) internal successors, (289), 193 states have internal predecessors, (289), 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) [2022-07-12 00:00:00,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2022-07-12 00:00:00,470 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 75 [2022-07-12 00:00:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:00:00,470 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2022-07-12 00:00:00,470 INFO L496 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) [2022-07-12 00:00:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2022-07-12 00:00:00,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-12 00:00:00,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:00:00,472 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:00:00,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-12 00:00:00,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 00:00:00,679 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:00:00,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:00:00,680 INFO L85 PathProgramCache]: Analyzing trace with hash 16106716, now seen corresponding path program 1 times [2022-07-12 00:00:00,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 00:00:00,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997496061] [2022-07-12 00:00:00,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:00:00,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 00:00:00,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 00:00:00,682 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) [2022-07-12 00:00:00,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-12 00:00:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:00:01,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 00:00:01,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 00:00:02,189 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-12 00:00:02,189 INFO L390 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 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-12 00:00:02,253 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-12 00:00:02,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-12 00:00:02,274 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 00:00:02,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 00:00:02,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 00:00:02,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1997496061] [2022-07-12 00:00:02,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1997496061] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:00:02,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:00:02,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 00:00:02,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73283891] [2022-07-12 00:00:02,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:00:02,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 00:00:02,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 00:00:02,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 00:00:02,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:00:02,277 INFO L87 Difference]: Start difference. First operand 194 states and 289 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) [2022-07-12 00:00:04,299 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 00:00:06,241 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 00:00:08,252 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 00:00:11,078 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 00:00:12,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:00:12,688 INFO L93 Difference]: Finished difference Result 369 states and 556 transitions. [2022-07-12 00:00:12,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 00:00:12,690 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 76 [2022-07-12 00:00:12,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:00:12,691 INFO L225 Difference]: With dead ends: 369 [2022-07-12 00:00:12,691 INFO L226 Difference]: Without dead ends: 196 [2022-07-12 00:00:12,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 00:00:12,693 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 11 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-07-12 00:00:12,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 561 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 3 Unknown, 18 Unchecked, 10.4s Time] [2022-07-12 00:00:12,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-12 00:00:12,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2022-07-12 00:00:12,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.4922279792746114) internal successors, (288), 193 states have internal predecessors, (288), 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) [2022-07-12 00:00:12,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2022-07-12 00:00:12,700 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 76 [2022-07-12 00:00:12,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:00:12,701 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2022-07-12 00:00:12,701 INFO L496 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) [2022-07-12 00:00:12,701 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2022-07-12 00:00:12,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-12 00:00:12,702 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:00:12,702 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:00:12,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-12 00:00:12,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 00:00:12,927 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:00:12,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:00:12,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1987113572, now seen corresponding path program 1 times [2022-07-12 00:00:12,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 00:00:12,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849268812] [2022-07-12 00:00:12,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:00:12,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 00:00:12,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 00:00:12,930 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) [2022-07-12 00:00:12,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-12 00:00:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:00:14,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 00:00:14,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 00:00:14,908 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-12 00:00:14,908 INFO L390 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 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-12 00:00:14,968 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-12 00:00:14,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-12 00:00:14,989 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 00:00:14,989 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 00:00:14,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 00:00:14,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849268812] [2022-07-12 00:00:14,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [849268812] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:00:14,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:00:14,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 00:00:14,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642031799] [2022-07-12 00:00:14,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:00:14,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 00:00:14,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 00:00:14,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 00:00:14,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:00:14,991 INFO L87 Difference]: Start difference. First operand 194 states and 288 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) [2022-07-12 00:00:17,012 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 00:00:21,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:00:21,905 INFO L93 Difference]: Finished difference Result 367 states and 552 transitions. [2022-07-12 00:00:21,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 00:00:21,907 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 76 [2022-07-12 00:00:21,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:00:21,908 INFO L225 Difference]: With dead ends: 367 [2022-07-12 00:00:21,908 INFO L226 Difference]: Without dead ends: 194 [2022-07-12 00:00:21,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 00:00:21,909 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 10 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-12 00:00:21,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 569 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 1 Unknown, 16 Unchecked, 6.9s Time] [2022-07-12 00:00:21,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-12 00:00:21,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2022-07-12 00:00:21,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.4870466321243523) internal successors, (287), 193 states have internal predecessors, (287), 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) [2022-07-12 00:00:21,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 287 transitions. [2022-07-12 00:00:21,913 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 287 transitions. Word has length 76 [2022-07-12 00:00:21,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:00:21,913 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 287 transitions. [2022-07-12 00:00:21,927 INFO L496 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) [2022-07-12 00:00:21,928 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2022-07-12 00:00:21,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-12 00:00:21,938 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:00:21,938 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:00:21,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-12 00:00:22,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 00:00:22,155 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:00:22,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:00:22,156 INFO L85 PathProgramCache]: Analyzing trace with hash -970686709, now seen corresponding path program 1 times [2022-07-12 00:00:22,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 00:00:22,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693591704] [2022-07-12 00:00:22,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:00:22,157 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 00:00:22,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 00:00:22,158 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) [2022-07-12 00:00:22,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-12 00:00:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:00:23,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 00:00:23,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 00:00:23,457 INFO L356 Elim1Store]: treesize reduction 180, result has 14.3 percent of original size [2022-07-12 00:00:23,457 INFO L390 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 3 case distinctions, treesize of input 29 treesize of output 39 [2022-07-12 00:00:23,575 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-12 00:00:23,575 INFO L390 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 4 case distinctions, treesize of input 40 treesize of output 51 [2022-07-12 00:00:23,709 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-12 00:00:23,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 15 [2022-07-12 00:00:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 00:00:23,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 00:00:23,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 00:00:23,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693591704] [2022-07-12 00:00:23,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693591704] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:00:23,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:00:23,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 00:00:23,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103036392] [2022-07-12 00:00:23,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:00:23,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 00:00:23,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 00:00:23,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 00:00:23,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:00:23,726 INFO L87 Difference]: Start difference. First operand 194 states and 287 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) [2022-07-12 00:00:25,744 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 00:00:27,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []