./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.15.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.15.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 fcfc850a59e797106b6c7b7ef037d26685a57733 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.15.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 fcfc850a59e797106b6c7b7ef037d26685a57733 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:36:18,197 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:36:18,198 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:36:18,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:36:18,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:36:18,224 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:36:18,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:36:18,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:36:18,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:36:18,231 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:36:18,232 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:36:18,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:36:18,233 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:36:18,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:36:18,234 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:36:18,235 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:36:18,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:36:18,236 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:36:18,237 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:36:18,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:36:18,240 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:36:18,244 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:36:18,247 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:36:18,248 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:36:18,258 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:36:18,268 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:36:18,269 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:36:18,270 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:36:18,271 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:36:18,272 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:36:18,272 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:36:18,273 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:36:18,274 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:36:18,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:36:18,275 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:36:18,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:36:18,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:36:18,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:36:18,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:36:18,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:36:18,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:36:18,281 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 20:36:18,303 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:36:18,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:36:18,304 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:36:18,304 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:36:18,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:36:18,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:36:18,305 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:36:18,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:36:18,305 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:36:18,305 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:36:18,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:36:18,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:36:18,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:36:18,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:36:18,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:36:18,306 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:36:18,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:36:18,307 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:36:18,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:36:18,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:36:18,307 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:36:18,307 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:36:18,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:36:18,307 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:36:18,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:36:18,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:36:18,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:36:18,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:36:18,308 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:36:18,308 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:36:18,308 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 -> fcfc850a59e797106b6c7b7ef037d26685a57733 [2021-08-25 20:36:18,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:36:18,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:36:18,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:36:18,575 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:36:18,575 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:36:18,576 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.15.i.cil-1.c [2021-08-25 20:36:18,619 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed8c66a5c/27107039a32f4b6d9e3f370a01de85c6/FLAGf69cfc41e [2021-08-25 20:36:19,018 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:36:19,019 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.15.i.cil-1.c [2021-08-25 20:36:19,034 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed8c66a5c/27107039a32f4b6d9e3f370a01de85c6/FLAGf69cfc41e [2021-08-25 20:36:19,356 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed8c66a5c/27107039a32f4b6d9e3f370a01de85c6 [2021-08-25 20:36:19,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:36:19,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:36:19,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:36:19,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:36:19,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:36:19,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:36:19" (1/1) ... [2021-08-25 20:36:19,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79ec902b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:36:19, skipping insertion in model container [2021-08-25 20:36:19,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:36:19" (1/1) ... [2021-08-25 20:36:19,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:36:19,425 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:36:19,683 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.15.i.cil-1.c[74370,74383] [2021-08-25 20:36:19,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:36:19,704 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:36:19,801 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.15.i.cil-1.c[74370,74383] [2021-08-25 20:36:19,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:36:19,818 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:36:19,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:36:19 WrapperNode [2021-08-25 20:36:19,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:36:19,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:36:19,821 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:36:19,821 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:36:19,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:36:19" (1/1) ... [2021-08-25 20:36:19,853 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:36:19" (1/1) ... [2021-08-25 20:36:19,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:36:19,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:36:19,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:36:19,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:36:19,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:36:19" (1/1) ... [2021-08-25 20:36:19,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:36:19" (1/1) ... [2021-08-25 20:36:19,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:36:19" (1/1) ... [2021-08-25 20:36:19,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:36:19" (1/1) ... [2021-08-25 20:36:19,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:36:19" (1/1) ... [2021-08-25 20:36:19,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:36:19" (1/1) ... [2021-08-25 20:36:19,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:36:19" (1/1) ... [2021-08-25 20:36:19,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:36:19,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:36:19,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:36:19,966 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:36:19,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:36:19" (1/1) ... [2021-08-25 20:36:19,978 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:36:19,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:36:19,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 20:36:19,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 20:36:20,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-25 20:36:20,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:36:20,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-25 20:36:20,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-25 20:36:20,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-25 20:36:20,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:36:20,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-25 20:36:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:36:20,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:36:20,173 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:36:20,626 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2021-08-25 20:36:20,626 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2021-08-25 20:36:20,636 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:36:20,636 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:36:20,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:36:20 BoogieIcfgContainer [2021-08-25 20:36:20,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:36:20,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:36:20,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:36:20,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:36:20,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:36:19" (1/3) ... [2021-08-25 20:36:20,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed0cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:36:20, skipping insertion in model container [2021-08-25 20:36:20,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:36:19" (2/3) ... [2021-08-25 20:36:20,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed0cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:36:20, skipping insertion in model container [2021-08-25 20:36:20,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:36:20" (3/3) ... [2021-08-25 20:36:20,643 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15.i.cil-1.c [2021-08-25 20:36:20,647 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:36:20,647 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:36:20,684 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:36:20,689 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 20:36:20,689 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:36:20,702 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 149 states have (on average 1.7248322147651007) internal successors, (257), 150 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) [2021-08-25 20:36:20,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-25 20:36:20,708 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:20,708 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:20,709 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:20,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:20,712 INFO L82 PathProgramCache]: Analyzing trace with hash 62050873, now seen corresponding path program 1 times [2021-08-25 20:36:20,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:20,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287634926] [2021-08-25 20:36:20,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:20,718 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:20,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:36:20,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:20,898 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287634926] [2021-08-25 20:36:20,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287634926] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:20,899 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:20,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:20,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503440683] [2021-08-25 20:36:20,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:20,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:20,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:20,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:20,911 INFO L87 Difference]: Start difference. First operand has 151 states, 149 states have (on average 1.7248322147651007) internal successors, (257), 150 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) Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:21,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:21,223 INFO L93 Difference]: Finished difference Result 329 states and 559 transitions. [2021-08-25 20:36:21,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:21,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2021-08-25 20:36:21,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:21,231 INFO L225 Difference]: With dead ends: 329 [2021-08-25 20:36:21,232 INFO L226 Difference]: Without dead ends: 166 [2021-08-25 20:36:21,234 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:21,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-08-25 20:36:21,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2021-08-25 20:36:21,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.5675675675675675) internal successors, (232), 148 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:21,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 232 transitions. [2021-08-25 20:36:21,260 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 232 transitions. Word has length 43 [2021-08-25 20:36:21,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:21,261 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 232 transitions. [2021-08-25 20:36:21,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:21,261 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 232 transitions. [2021-08-25 20:36:21,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-08-25 20:36:21,263 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:21,263 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:21,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:36:21,263 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:21,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:21,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1905377872, now seen corresponding path program 1 times [2021-08-25 20:36:21,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:21,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935140804] [2021-08-25 20:36:21,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:21,265 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:21,337 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:36:21,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:21,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935140804] [2021-08-25 20:36:21,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935140804] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:21,337 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:21,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:21,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212341417] [2021-08-25 20:36:21,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:21,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:21,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:21,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:21,339 INFO L87 Difference]: Start difference. First operand 149 states and 232 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:21,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:21,576 INFO L93 Difference]: Finished difference Result 296 states and 455 transitions. [2021-08-25 20:36:21,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:21,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-08-25 20:36:21,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:21,578 INFO L225 Difference]: With dead ends: 296 [2021-08-25 20:36:21,578 INFO L226 Difference]: Without dead ends: 166 [2021-08-25 20:36:21,579 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:21,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-08-25 20:36:21,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2021-08-25 20:36:21,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.5608108108108107) internal successors, (231), 148 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:21,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 231 transitions. [2021-08-25 20:36:21,585 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 231 transitions. Word has length 56 [2021-08-25 20:36:21,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:21,585 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 231 transitions. [2021-08-25 20:36:21,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:21,585 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 231 transitions. [2021-08-25 20:36:21,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-25 20:36:21,586 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:21,586 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:21,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:36:21,587 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:21,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:21,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1255882526, now seen corresponding path program 1 times [2021-08-25 20:36:21,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:21,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737969026] [2021-08-25 20:36:21,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:21,587 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:36:21,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:21,655 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737969026] [2021-08-25 20:36:21,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737969026] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:21,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:21,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:21,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156776379] [2021-08-25 20:36:21,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:21,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:21,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:21,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:21,657 INFO L87 Difference]: Start difference. First operand 149 states and 231 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:21,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:21,911 INFO L93 Difference]: Finished difference Result 295 states and 453 transitions. [2021-08-25 20:36:21,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:21,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-08-25 20:36:21,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:21,913 INFO L225 Difference]: With dead ends: 295 [2021-08-25 20:36:21,913 INFO L226 Difference]: Without dead ends: 165 [2021-08-25 20:36:21,913 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:21,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-08-25 20:36:21,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 149. [2021-08-25 20:36:21,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.554054054054054) internal successors, (230), 148 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:21,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 230 transitions. [2021-08-25 20:36:21,919 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 230 transitions. Word has length 57 [2021-08-25 20:36:21,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:21,919 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 230 transitions. [2021-08-25 20:36:21,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:21,919 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 230 transitions. [2021-08-25 20:36:21,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-25 20:36:21,924 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:21,924 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:21,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:36:21,925 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:21,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:21,925 INFO L82 PathProgramCache]: Analyzing trace with hash 2070651149, now seen corresponding path program 1 times [2021-08-25 20:36:21,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:21,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519056563] [2021-08-25 20:36:21,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:21,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:36:22,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:22,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519056563] [2021-08-25 20:36:22,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519056563] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:22,004 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:22,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:22,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782941609] [2021-08-25 20:36:22,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:22,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:22,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:22,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:22,005 INFO L87 Difference]: Start difference. First operand 149 states and 230 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:22,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:22,224 INFO L93 Difference]: Finished difference Result 293 states and 450 transitions. [2021-08-25 20:36:22,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:22,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-08-25 20:36:22,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:22,225 INFO L225 Difference]: With dead ends: 293 [2021-08-25 20:36:22,225 INFO L226 Difference]: Without dead ends: 163 [2021-08-25 20:36:22,226 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:22,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-08-25 20:36:22,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 149. [2021-08-25 20:36:22,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.5472972972972974) internal successors, (229), 148 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:22,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 229 transitions. [2021-08-25 20:36:22,233 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 229 transitions. Word has length 57 [2021-08-25 20:36:22,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:22,233 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 229 transitions. [2021-08-25 20:36:22,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:22,234 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 229 transitions. [2021-08-25 20:36:22,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-25 20:36:22,236 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:22,236 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:22,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:36:22,237 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:22,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:22,237 INFO L82 PathProgramCache]: Analyzing trace with hash -221095859, now seen corresponding path program 1 times [2021-08-25 20:36:22,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:22,237 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191285743] [2021-08-25 20:36:22,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:22,238 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:22,276 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:36:22,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:22,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191285743] [2021-08-25 20:36:22,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191285743] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:22,277 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:22,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:22,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590974850] [2021-08-25 20:36:22,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:22,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:22,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:22,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:22,278 INFO L87 Difference]: Start difference. First operand 149 states and 229 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:22,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:22,480 INFO L93 Difference]: Finished difference Result 292 states and 448 transitions. [2021-08-25 20:36:22,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:22,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-08-25 20:36:22,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:22,481 INFO L225 Difference]: With dead ends: 292 [2021-08-25 20:36:22,481 INFO L226 Difference]: Without dead ends: 162 [2021-08-25 20:36:22,482 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:22,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-08-25 20:36:22,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2021-08-25 20:36:22,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.5405405405405406) internal successors, (228), 148 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:22,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 228 transitions. [2021-08-25 20:36:22,487 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 228 transitions. Word has length 57 [2021-08-25 20:36:22,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:22,487 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 228 transitions. [2021-08-25 20:36:22,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 228 transitions. [2021-08-25 20:36:22,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-25 20:36:22,488 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:22,488 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:22,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:36:22,489 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:22,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:22,489 INFO L82 PathProgramCache]: Analyzing trace with hash 631020918, now seen corresponding path program 1 times [2021-08-25 20:36:22,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:22,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248187125] [2021-08-25 20:36:22,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:22,489 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:22,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:36:22,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:22,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248187125] [2021-08-25 20:36:22,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248187125] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:22,534 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:22,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:22,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342447453] [2021-08-25 20:36:22,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:22,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:22,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:22,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:22,535 INFO L87 Difference]: Start difference. First operand 149 states and 228 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:22,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:22,729 INFO L93 Difference]: Finished difference Result 292 states and 447 transitions. [2021-08-25 20:36:22,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:22,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-08-25 20:36:22,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:22,730 INFO L225 Difference]: With dead ends: 292 [2021-08-25 20:36:22,730 INFO L226 Difference]: Without dead ends: 162 [2021-08-25 20:36:22,730 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:22,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-08-25 20:36:22,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2021-08-25 20:36:22,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.5337837837837838) internal successors, (227), 148 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:22,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 227 transitions. [2021-08-25 20:36:22,735 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 227 transitions. Word has length 57 [2021-08-25 20:36:22,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:22,735 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 227 transitions. [2021-08-25 20:36:22,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:22,735 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 227 transitions. [2021-08-25 20:36:22,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-25 20:36:22,735 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:22,735 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:22,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:36:22,741 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:22,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:22,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1772080409, now seen corresponding path program 1 times [2021-08-25 20:36:22,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:22,741 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856191233] [2021-08-25 20:36:22,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:22,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:22,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:36:22,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:22,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856191233] [2021-08-25 20:36:22,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856191233] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:22,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:22,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:22,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161692273] [2021-08-25 20:36:22,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:22,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:22,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:22,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:22,799 INFO L87 Difference]: Start difference. First operand 149 states and 227 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:23,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:23,005 INFO L93 Difference]: Finished difference Result 292 states and 446 transitions. [2021-08-25 20:36:23,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:23,006 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 [2021-08-25 20:36:23,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:23,006 INFO L225 Difference]: With dead ends: 292 [2021-08-25 20:36:23,006 INFO L226 Difference]: Without dead ends: 162 [2021-08-25 20:36:23,007 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:23,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-08-25 20:36:23,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2021-08-25 20:36:23,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.527027027027027) internal successors, (226), 148 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:23,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 226 transitions. [2021-08-25 20:36:23,011 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 226 transitions. Word has length 58 [2021-08-25 20:36:23,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:23,011 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 226 transitions. [2021-08-25 20:36:23,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:23,011 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 226 transitions. [2021-08-25 20:36:23,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-25 20:36:23,011 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:23,011 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:23,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:36:23,012 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:23,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:23,012 INFO L82 PathProgramCache]: Analyzing trace with hash -245018341, now seen corresponding path program 1 times [2021-08-25 20:36:23,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:23,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533193886] [2021-08-25 20:36:23,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:23,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:23,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:36:23,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:23,045 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533193886] [2021-08-25 20:36:23,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533193886] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:23,045 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:23,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:23,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268970563] [2021-08-25 20:36:23,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:23,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:23,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:23,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:23,046 INFO L87 Difference]: Start difference. First operand 149 states and 226 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) [2021-08-25 20:36:23,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:23,236 INFO L93 Difference]: Finished difference Result 292 states and 445 transitions. [2021-08-25 20:36:23,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:23,237 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 [2021-08-25 20:36:23,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:23,237 INFO L225 Difference]: With dead ends: 292 [2021-08-25 20:36:23,237 INFO L226 Difference]: Without dead ends: 162 [2021-08-25 20:36:23,238 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:23,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-08-25 20:36:23,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2021-08-25 20:36:23,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.5202702702702702) internal successors, (225), 148 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) [2021-08-25 20:36:23,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 225 transitions. [2021-08-25 20:36:23,242 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 225 transitions. Word has length 59 [2021-08-25 20:36:23,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:23,242 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 225 transitions. [2021-08-25 20:36:23,242 INFO L471 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) [2021-08-25 20:36:23,242 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 225 transitions. [2021-08-25 20:36:23,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-25 20:36:23,242 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:23,243 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:23,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:36:23,243 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:23,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:23,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1380774754, now seen corresponding path program 1 times [2021-08-25 20:36:23,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:23,243 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094842326] [2021-08-25 20:36:23,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:23,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:23,274 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:36:23,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:23,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094842326] [2021-08-25 20:36:23,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094842326] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:23,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:23,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:23,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382448898] [2021-08-25 20:36:23,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:23,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:23,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:23,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:23,276 INFO L87 Difference]: Start difference. First operand 149 states and 225 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) [2021-08-25 20:36:23,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:23,436 INFO L93 Difference]: Finished difference Result 282 states and 431 transitions. [2021-08-25 20:36:23,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:23,436 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 [2021-08-25 20:36:23,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:23,437 INFO L225 Difference]: With dead ends: 282 [2021-08-25 20:36:23,437 INFO L226 Difference]: Without dead ends: 152 [2021-08-25 20:36:23,437 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:23,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-08-25 20:36:23,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2021-08-25 20:36:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.5135135135135136) internal successors, (224), 148 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2021-08-25 20:36:23,440 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 224 transitions. Word has length 60 [2021-08-25 20:36:23,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:23,440 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 224 transitions. [2021-08-25 20:36:23,440 INFO L471 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) [2021-08-25 20:36:23,440 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 224 transitions. [2021-08-25 20:36:23,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-25 20:36:23,441 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:23,441 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:23,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:36:23,441 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:23,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:23,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1992648186, now seen corresponding path program 1 times [2021-08-25 20:36:23,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:23,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591206807] [2021-08-25 20:36:23,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:23,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:23,487 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:36:23,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:23,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591206807] [2021-08-25 20:36:23,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591206807] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:23,488 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:23,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:23,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848986784] [2021-08-25 20:36:23,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:23,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:23,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:23,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:23,491 INFO L87 Difference]: Start difference. First operand 149 states and 224 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) [2021-08-25 20:36:23,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:23,704 INFO L93 Difference]: Finished difference Result 322 states and 492 transitions. [2021-08-25 20:36:23,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:23,704 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 [2021-08-25 20:36:23,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:23,705 INFO L225 Difference]: With dead ends: 322 [2021-08-25 20:36:23,705 INFO L226 Difference]: Without dead ends: 192 [2021-08-25 20:36:23,705 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:23,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-08-25 20:36:23,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 171. [2021-08-25 20:36:23,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.5411764705882354) internal successors, (262), 170 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:23,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 262 transitions. [2021-08-25 20:36:23,709 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 262 transitions. Word has length 60 [2021-08-25 20:36:23,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:23,709 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 262 transitions. [2021-08-25 20:36:23,709 INFO L471 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) [2021-08-25 20:36:23,709 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 262 transitions. [2021-08-25 20:36:23,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-25 20:36:23,709 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:23,709 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:23,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:36:23,710 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:23,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:23,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1514156125, now seen corresponding path program 1 times [2021-08-25 20:36:23,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:23,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473030589] [2021-08-25 20:36:23,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:23,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:23,740 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:36:23,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:23,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473030589] [2021-08-25 20:36:23,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473030589] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:23,741 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:23,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:23,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042904722] [2021-08-25 20:36:23,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:23,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:23,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:23,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:23,742 INFO L87 Difference]: Start difference. First operand 171 states and 262 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:23,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:23,942 INFO L93 Difference]: Finished difference Result 344 states and 529 transitions. [2021-08-25 20:36:23,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:23,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-08-25 20:36:23,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:23,943 INFO L225 Difference]: With dead ends: 344 [2021-08-25 20:36:23,943 INFO L226 Difference]: Without dead ends: 192 [2021-08-25 20:36:23,944 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:23,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-08-25 20:36:23,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 171. [2021-08-25 20:36:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.535294117647059) internal successors, (261), 170 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 261 transitions. [2021-08-25 20:36:23,947 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 261 transitions. Word has length 73 [2021-08-25 20:36:23,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:23,947 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 261 transitions. [2021-08-25 20:36:23,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:23,947 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 261 transitions. [2021-08-25 20:36:23,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-25 20:36:23,948 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:23,948 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:23,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:36:23,948 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:23,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:23,948 INFO L82 PathProgramCache]: Analyzing trace with hash 112745967, now seen corresponding path program 1 times [2021-08-25 20:36:23,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:23,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570900380] [2021-08-25 20:36:23,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:23,949 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:23,978 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:36:23,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:23,978 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570900380] [2021-08-25 20:36:23,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570900380] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:23,978 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:23,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:23,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446550715] [2021-08-25 20:36:23,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:23,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:23,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:23,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:23,979 INFO L87 Difference]: Start difference. First operand 171 states and 261 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:24,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:24,162 INFO L93 Difference]: Finished difference Result 343 states and 526 transitions. [2021-08-25 20:36:24,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:24,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-08-25 20:36:24,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:24,163 INFO L225 Difference]: With dead ends: 343 [2021-08-25 20:36:24,163 INFO L226 Difference]: Without dead ends: 191 [2021-08-25 20:36:24,163 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:24,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-08-25 20:36:24,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 171. [2021-08-25 20:36:24,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.5294117647058822) internal successors, (260), 170 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:24,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 260 transitions. [2021-08-25 20:36:24,166 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 260 transitions. Word has length 74 [2021-08-25 20:36:24,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:24,168 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 260 transitions. [2021-08-25 20:36:24,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:24,170 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 260 transitions. [2021-08-25 20:36:24,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-25 20:36:24,170 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:24,170 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:24,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:36:24,171 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:24,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:24,172 INFO L82 PathProgramCache]: Analyzing trace with hash -855687654, now seen corresponding path program 1 times [2021-08-25 20:36:24,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:24,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342711560] [2021-08-25 20:36:24,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:24,172 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:24,213 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:36:24,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:24,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342711560] [2021-08-25 20:36:24,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342711560] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:24,214 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:24,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:24,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580761428] [2021-08-25 20:36:24,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:24,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:24,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:24,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:24,215 INFO L87 Difference]: Start difference. First operand 171 states and 260 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:24,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:24,417 INFO L93 Difference]: Finished difference Result 341 states and 522 transitions. [2021-08-25 20:36:24,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:24,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-08-25 20:36:24,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:24,418 INFO L225 Difference]: With dead ends: 341 [2021-08-25 20:36:24,418 INFO L226 Difference]: Without dead ends: 189 [2021-08-25 20:36:24,419 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:24,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-08-25 20:36:24,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 171. [2021-08-25 20:36:24,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.5235294117647058) internal successors, (259), 170 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) [2021-08-25 20:36:24,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 259 transitions. [2021-08-25 20:36:24,421 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 259 transitions. Word has length 74 [2021-08-25 20:36:24,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:24,422 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 259 transitions. [2021-08-25 20:36:24,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:24,422 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 259 transitions. [2021-08-25 20:36:24,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-25 20:36:24,422 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:24,422 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:24,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:36:24,422 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:24,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:24,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1147532634, now seen corresponding path program 1 times [2021-08-25 20:36:24,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:24,423 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658666818] [2021-08-25 20:36:24,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:24,423 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:36:24,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:24,463 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658666818] [2021-08-25 20:36:24,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658666818] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:24,463 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:24,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:24,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242674304] [2021-08-25 20:36:24,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:24,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:24,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:24,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:24,464 INFO L87 Difference]: Start difference. First operand 171 states and 259 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:24,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:24,632 INFO L93 Difference]: Finished difference Result 340 states and 519 transitions. [2021-08-25 20:36:24,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:24,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-08-25 20:36:24,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:24,633 INFO L225 Difference]: With dead ends: 340 [2021-08-25 20:36:24,633 INFO L226 Difference]: Without dead ends: 188 [2021-08-25 20:36:24,634 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:24,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-08-25 20:36:24,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2021-08-25 20:36:24,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.5176470588235293) internal successors, (258), 170 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) [2021-08-25 20:36:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 258 transitions. [2021-08-25 20:36:24,636 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 258 transitions. Word has length 74 [2021-08-25 20:36:24,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:24,636 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 258 transitions. [2021-08-25 20:36:24,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:24,636 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 258 transitions. [2021-08-25 20:36:24,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-25 20:36:24,637 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:24,637 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:24,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:36:24,637 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:24,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:24,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1999649411, now seen corresponding path program 1 times [2021-08-25 20:36:24,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:24,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161002394] [2021-08-25 20:36:24,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:24,638 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:36:24,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:24,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161002394] [2021-08-25 20:36:24,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161002394] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:24,664 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:24,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:24,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611937103] [2021-08-25 20:36:24,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:24,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:24,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:24,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:24,665 INFO L87 Difference]: Start difference. First operand 171 states and 258 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:24,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:24,840 INFO L93 Difference]: Finished difference Result 340 states and 517 transitions. [2021-08-25 20:36:24,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:24,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-08-25 20:36:24,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:24,841 INFO L225 Difference]: With dead ends: 340 [2021-08-25 20:36:24,841 INFO L226 Difference]: Without dead ends: 188 [2021-08-25 20:36:24,841 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:24,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-08-25 20:36:24,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2021-08-25 20:36:24,844 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) [2021-08-25 20:36:24,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 257 transitions. [2021-08-25 20:36:24,844 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 257 transitions. Word has length 74 [2021-08-25 20:36:24,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:24,844 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 257 transitions. [2021-08-25 20:36:24,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:24,844 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 257 transitions. [2021-08-25 20:36:24,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-25 20:36:24,845 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:24,845 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:24,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:36:24,845 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:24,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:24,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1249890732, now seen corresponding path program 1 times [2021-08-25 20:36:24,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:24,845 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103667560] [2021-08-25 20:36:24,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:24,845 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:24,871 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:36:24,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:24,872 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103667560] [2021-08-25 20:36:24,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103667560] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:24,872 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:24,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:24,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972012319] [2021-08-25 20:36:24,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:24,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:24,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:24,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:24,873 INFO L87 Difference]: Start difference. First operand 171 states and 257 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:25,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:25,049 INFO L93 Difference]: Finished difference Result 340 states and 515 transitions. [2021-08-25 20:36:25,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:25,049 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 [2021-08-25 20:36:25,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:25,050 INFO L225 Difference]: With dead ends: 340 [2021-08-25 20:36:25,050 INFO L226 Difference]: Without dead ends: 188 [2021-08-25 20:36:25,050 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:25,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-08-25 20:36:25,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2021-08-25 20:36:25,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.5058823529411764) internal successors, (256), 170 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 256 transitions. [2021-08-25 20:36:25,053 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 256 transitions. Word has length 75 [2021-08-25 20:36:25,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:25,053 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 256 transitions. [2021-08-25 20:36:25,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 256 transitions. [2021-08-25 20:36:25,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-25 20:36:25,054 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:25,054 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:25,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-25 20:36:25,055 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:25,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:25,055 INFO L82 PathProgramCache]: Analyzing trace with hash 746970856, now seen corresponding path program 1 times [2021-08-25 20:36:25,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:25,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675947730] [2021-08-25 20:36:25,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:25,055 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:36:25,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:25,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675947730] [2021-08-25 20:36:25,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675947730] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:25,084 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:25,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:25,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983824796] [2021-08-25 20:36:25,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:25,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:25,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:25,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:25,085 INFO L87 Difference]: Start difference. First operand 171 states and 256 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:25,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:25,268 INFO L93 Difference]: Finished difference Result 340 states and 513 transitions. [2021-08-25 20:36:25,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:25,269 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 [2021-08-25 20:36:25,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:25,270 INFO L225 Difference]: With dead ends: 340 [2021-08-25 20:36:25,270 INFO L226 Difference]: Without dead ends: 188 [2021-08-25 20:36:25,270 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:25,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-08-25 20:36:25,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2021-08-25 20:36:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.5) internal successors, (255), 170 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 255 transitions. [2021-08-25 20:36:25,273 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 255 transitions. Word has length 76 [2021-08-25 20:36:25,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:25,273 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 255 transitions. [2021-08-25 20:36:25,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 255 transitions. [2021-08-25 20:36:25,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-25 20:36:25,273 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:25,273 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:25,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-25 20:36:25,273 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:25,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:25,274 INFO L82 PathProgramCache]: Analyzing trace with hash -693880719, now seen corresponding path program 1 times [2021-08-25 20:36:25,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:25,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060874532] [2021-08-25 20:36:25,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:25,274 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:25,302 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:36:25,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:25,303 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060874532] [2021-08-25 20:36:25,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060874532] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:25,303 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:25,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:25,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497378788] [2021-08-25 20:36:25,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:25,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:25,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:25,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:25,304 INFO L87 Difference]: Start difference. First operand 171 states and 255 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:25,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:25,461 INFO L93 Difference]: Finished difference Result 330 states and 498 transitions. [2021-08-25 20:36:25,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:25,461 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 [2021-08-25 20:36:25,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:25,462 INFO L225 Difference]: With dead ends: 330 [2021-08-25 20:36:25,462 INFO L226 Difference]: Without dead ends: 178 [2021-08-25 20:36:25,462 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:25,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-08-25 20:36:25,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 171. [2021-08-25 20:36:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.4941176470588236) internal successors, (254), 170 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:25,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 254 transitions. [2021-08-25 20:36:25,465 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 254 transitions. Word has length 77 [2021-08-25 20:36:25,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:25,465 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 254 transitions. [2021-08-25 20:36:25,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 254 transitions. [2021-08-25 20:36:25,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-25 20:36:25,466 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:25,466 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:25,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-25 20:36:25,466 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:25,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:25,466 INFO L82 PathProgramCache]: Analyzing trace with hash -242622967, now seen corresponding path program 1 times [2021-08-25 20:36:25,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:25,466 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512939195] [2021-08-25 20:36:25,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:25,466 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:25,502 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:25,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:25,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512939195] [2021-08-25 20:36:25,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512939195] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:25,502 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:25,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:25,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755962560] [2021-08-25 20:36:25,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:25,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:25,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:25,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:25,503 INFO L87 Difference]: Start difference. First operand 171 states and 254 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:25,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:25,793 INFO L93 Difference]: Finished difference Result 432 states and 655 transitions. [2021-08-25 20:36:25,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:25,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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 82 [2021-08-25 20:36:25,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:25,794 INFO L225 Difference]: With dead ends: 432 [2021-08-25 20:36:25,795 INFO L226 Difference]: Without dead ends: 280 [2021-08-25 20:36:25,795 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:25,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-08-25 20:36:25,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 212. [2021-08-25 20:36:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 1.5545023696682465) internal successors, (328), 211 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:25,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 328 transitions. [2021-08-25 20:36:25,799 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 328 transitions. Word has length 82 [2021-08-25 20:36:25,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:25,799 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 328 transitions. [2021-08-25 20:36:25,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:25,799 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 328 transitions. [2021-08-25 20:36:25,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-25 20:36:25,799 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:25,800 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:25,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-25 20:36:25,800 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:25,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:25,800 INFO L82 PathProgramCache]: Analyzing trace with hash 181023755, now seen corresponding path program 1 times [2021-08-25 20:36:25,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:25,800 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265352045] [2021-08-25 20:36:25,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:25,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:25,832 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:25,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:25,833 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265352045] [2021-08-25 20:36:25,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265352045] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:25,833 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:25,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:25,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255189420] [2021-08-25 20:36:25,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:25,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:25,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:25,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:25,834 INFO L87 Difference]: Start difference. First operand 212 states and 328 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:26,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:26,044 INFO L93 Difference]: Finished difference Result 454 states and 709 transitions. [2021-08-25 20:36:26,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:26,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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 82 [2021-08-25 20:36:26,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:26,045 INFO L225 Difference]: With dead ends: 454 [2021-08-25 20:36:26,045 INFO L226 Difference]: Without dead ends: 261 [2021-08-25 20:36:26,046 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:26,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-08-25 20:36:26,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 236. [2021-08-25 20:36:26,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.574468085106383) internal successors, (370), 235 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:26,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 370 transitions. [2021-08-25 20:36:26,049 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 370 transitions. Word has length 82 [2021-08-25 20:36:26,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:26,049 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 370 transitions. [2021-08-25 20:36:26,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:26,049 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 370 transitions. [2021-08-25 20:36:26,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-08-25 20:36:26,050 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:26,050 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:26,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-25 20:36:26,050 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:26,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:26,050 INFO L82 PathProgramCache]: Analyzing trace with hash -910969721, now seen corresponding path program 1 times [2021-08-25 20:36:26,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:26,050 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657765110] [2021-08-25 20:36:26,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:26,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:26,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:26,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657765110] [2021-08-25 20:36:26,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657765110] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:26,102 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:26,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:26,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750784819] [2021-08-25 20:36:26,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:26,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:26,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:26,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:26,102 INFO L87 Difference]: Start difference. First operand 236 states and 370 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:26,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:26,368 INFO L93 Difference]: Finished difference Result 513 states and 801 transitions. [2021-08-25 20:36:26,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:26,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-08-25 20:36:26,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:26,370 INFO L225 Difference]: With dead ends: 513 [2021-08-25 20:36:26,370 INFO L226 Difference]: Without dead ends: 296 [2021-08-25 20:36:26,370 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:26,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-08-25 20:36:26,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 237. [2021-08-25 20:36:26,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 1.5720338983050848) internal successors, (371), 236 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:26,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 371 transitions. [2021-08-25 20:36:26,374 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 371 transitions. Word has length 83 [2021-08-25 20:36:26,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:26,374 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 371 transitions. [2021-08-25 20:36:26,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:26,374 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 371 transitions. [2021-08-25 20:36:26,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-08-25 20:36:26,374 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:26,374 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2021-08-25 20:36:26,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-25 20:36:26,375 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:26,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:26,375 INFO L82 PathProgramCache]: Analyzing trace with hash 83388544, now seen corresponding path program 1 times [2021-08-25 20:36:26,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:26,375 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443115779] [2021-08-25 20:36:26,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:26,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:26,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:26,407 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443115779] [2021-08-25 20:36:26,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443115779] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:26,407 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:26,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:26,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78933190] [2021-08-25 20:36:26,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:26,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:26,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:26,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:26,408 INFO L87 Difference]: Start difference. First operand 237 states and 371 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:26,676 INFO L93 Difference]: Finished difference Result 514 states and 801 transitions. [2021-08-25 20:36:26,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:26,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-08-25 20:36:26,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:26,679 INFO L225 Difference]: With dead ends: 514 [2021-08-25 20:36:26,679 INFO L226 Difference]: Without dead ends: 296 [2021-08-25 20:36:26,679 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:26,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-08-25 20:36:26,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 237. [2021-08-25 20:36:26,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 1.5677966101694916) internal successors, (370), 236 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:26,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 370 transitions. [2021-08-25 20:36:26,683 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 370 transitions. Word has length 95 [2021-08-25 20:36:26,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:26,683 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 370 transitions. [2021-08-25 20:36:26,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:26,684 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 370 transitions. [2021-08-25 20:36:26,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-08-25 20:36:26,684 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:26,684 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2021-08-25 20:36:26,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-25 20:36:26,685 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:26,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:26,685 INFO L82 PathProgramCache]: Analyzing trace with hash 959407550, now seen corresponding path program 1 times [2021-08-25 20:36:26,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:26,685 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651295921] [2021-08-25 20:36:26,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:26,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:26,738 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:26,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:26,738 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651295921] [2021-08-25 20:36:26,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651295921] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:26,739 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:26,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:26,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390927371] [2021-08-25 20:36:26,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:26,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:26,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:26,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:26,741 INFO L87 Difference]: Start difference. First operand 237 states and 370 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:26,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:26,960 INFO L93 Difference]: Finished difference Result 480 states and 750 transitions. [2021-08-25 20:36:26,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:26,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-08-25 20:36:26,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:26,961 INFO L225 Difference]: With dead ends: 480 [2021-08-25 20:36:26,961 INFO L226 Difference]: Without dead ends: 262 [2021-08-25 20:36:26,961 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:26,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-08-25 20:36:26,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 237. [2021-08-25 20:36:26,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 1.5635593220338984) internal successors, (369), 236 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) [2021-08-25 20:36:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 369 transitions. [2021-08-25 20:36:26,965 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 369 transitions. Word has length 95 [2021-08-25 20:36:26,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:26,965 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 369 transitions. [2021-08-25 20:36:26,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 369 transitions. [2021-08-25 20:36:26,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-08-25 20:36:26,966 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:26,966 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2021-08-25 20:36:26,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-25 20:36:26,966 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:26,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:26,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1902976846, now seen corresponding path program 1 times [2021-08-25 20:36:26,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:26,966 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073544572] [2021-08-25 20:36:26,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:26,966 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:26,999 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:26,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:26,999 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073544572] [2021-08-25 20:36:26,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073544572] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:26,999 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:26,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:26,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758582701] [2021-08-25 20:36:27,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:27,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:27,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:27,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:27,000 INFO L87 Difference]: Start difference. First operand 237 states and 369 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:27,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:27,259 INFO L93 Difference]: Finished difference Result 513 states and 796 transitions. [2021-08-25 20:36:27,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:27,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2021-08-25 20:36:27,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:27,261 INFO L225 Difference]: With dead ends: 513 [2021-08-25 20:36:27,261 INFO L226 Difference]: Without dead ends: 295 [2021-08-25 20:36:27,261 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:27,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-08-25 20:36:27,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 237. [2021-08-25 20:36:27,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 1.5593220338983051) internal successors, (368), 236 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 368 transitions. [2021-08-25 20:36:27,265 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 368 transitions. Word has length 96 [2021-08-25 20:36:27,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:27,265 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 368 transitions. [2021-08-25 20:36:27,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:27,265 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 368 transitions. [2021-08-25 20:36:27,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-08-25 20:36:27,265 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:27,266 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-08-25 20:36:27,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-25 20:36:27,266 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:27,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:27,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1423556829, now seen corresponding path program 1 times [2021-08-25 20:36:27,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:27,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818518065] [2021-08-25 20:36:27,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:27,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:27,303 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:27,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:27,303 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818518065] [2021-08-25 20:36:27,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818518065] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:27,304 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:27,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:27,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641138962] [2021-08-25 20:36:27,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:27,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:27,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:27,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:27,304 INFO L87 Difference]: Start difference. First operand 237 states and 368 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:27,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:27,555 INFO L93 Difference]: Finished difference Result 511 states and 792 transitions. [2021-08-25 20:36:27,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:27,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2021-08-25 20:36:27,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:27,556 INFO L225 Difference]: With dead ends: 511 [2021-08-25 20:36:27,556 INFO L226 Difference]: Without dead ends: 293 [2021-08-25 20:36:27,557 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:27,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-08-25 20:36:27,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 237. [2021-08-25 20:36:27,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 1.555084745762712) internal successors, (367), 236 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:27,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 367 transitions. [2021-08-25 20:36:27,560 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 367 transitions. Word has length 96 [2021-08-25 20:36:27,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:27,560 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 367 transitions. [2021-08-25 20:36:27,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:27,560 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 367 transitions. [2021-08-25 20:36:27,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-08-25 20:36:27,561 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:27,561 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-08-25 20:36:27,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-25 20:36:27,561 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:27,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:27,561 INFO L82 PathProgramCache]: Analyzing trace with hash -868190179, now seen corresponding path program 1 times [2021-08-25 20:36:27,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:27,562 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806614654] [2021-08-25 20:36:27,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:27,562 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:27,601 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:27,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:27,601 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806614654] [2021-08-25 20:36:27,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806614654] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:27,602 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:27,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:27,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580289001] [2021-08-25 20:36:27,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:27,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:27,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:27,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:27,603 INFO L87 Difference]: Start difference. First operand 237 states and 367 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:27,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:27,860 INFO L93 Difference]: Finished difference Result 510 states and 789 transitions. [2021-08-25 20:36:27,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:27,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2021-08-25 20:36:27,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:27,861 INFO L225 Difference]: With dead ends: 510 [2021-08-25 20:36:27,862 INFO L226 Difference]: Without dead ends: 292 [2021-08-25 20:36:27,862 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:27,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-08-25 20:36:27,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 237. [2021-08-25 20:36:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 1.5508474576271187) internal successors, (366), 236 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:27,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 366 transitions. [2021-08-25 20:36:27,866 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 366 transitions. Word has length 96 [2021-08-25 20:36:27,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:27,866 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 366 transitions. [2021-08-25 20:36:27,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:27,866 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 366 transitions. [2021-08-25 20:36:27,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-08-25 20:36:27,867 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:27,867 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1] [2021-08-25 20:36:27,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-25 20:36:27,867 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:27,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:27,867 INFO L82 PathProgramCache]: Analyzing trace with hash -16073402, now seen corresponding path program 1 times [2021-08-25 20:36:27,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:27,868 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714830943] [2021-08-25 20:36:27,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:27,868 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:27,932 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-08-25 20:36:27,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:27,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714830943] [2021-08-25 20:36:27,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714830943] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:27,933 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:27,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:36:27,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412457728] [2021-08-25 20:36:27,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:36:27,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:27,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:36:27,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:27,934 INFO L87 Difference]: Start difference. First operand 237 states and 366 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:28,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:28,191 INFO L93 Difference]: Finished difference Result 476 states and 740 transitions. [2021-08-25 20:36:28,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:36:28,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2021-08-25 20:36:28,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:28,193 INFO L225 Difference]: With dead ends: 476 [2021-08-25 20:36:28,193 INFO L226 Difference]: Without dead ends: 258 [2021-08-25 20:36:28,193 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 23.4ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:36:28,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-08-25 20:36:28,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2021-08-25 20:36:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.53125) internal successors, (392), 256 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 392 transitions. [2021-08-25 20:36:28,196 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 392 transitions. Word has length 96 [2021-08-25 20:36:28,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:28,197 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 392 transitions. [2021-08-25 20:36:28,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:28,197 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 392 transitions. [2021-08-25 20:36:28,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-08-25 20:36:28,197 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:28,197 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-08-25 20:36:28,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-25 20:36:28,197 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:28,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:28,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1484625057, now seen corresponding path program 1 times [2021-08-25 20:36:28,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:28,198 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557678027] [2021-08-25 20:36:28,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:28,198 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:28,232 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:28,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:28,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557678027] [2021-08-25 20:36:28,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557678027] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:28,233 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:28,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:28,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792353155] [2021-08-25 20:36:28,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:28,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:28,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:28,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:28,234 INFO L87 Difference]: Start difference. First operand 257 states and 392 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:28,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:28,442 INFO L93 Difference]: Finished difference Result 517 states and 790 transitions. [2021-08-25 20:36:28,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:28,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2021-08-25 20:36:28,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:28,444 INFO L225 Difference]: With dead ends: 517 [2021-08-25 20:36:28,444 INFO L226 Difference]: Without dead ends: 279 [2021-08-25 20:36:28,444 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:28,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-08-25 20:36:28,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 257. [2021-08-25 20:36:28,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.52734375) internal successors, (391), 256 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:28,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 391 transitions. [2021-08-25 20:36:28,448 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 391 transitions. Word has length 96 [2021-08-25 20:36:28,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:28,448 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 391 transitions. [2021-08-25 20:36:28,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:28,448 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 391 transitions. [2021-08-25 20:36:28,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-08-25 20:36:28,449 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:28,449 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-08-25 20:36:28,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-25 20:36:28,449 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:28,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:28,449 INFO L82 PathProgramCache]: Analyzing trace with hash 518595231, now seen corresponding path program 1 times [2021-08-25 20:36:28,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:28,449 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421146265] [2021-08-25 20:36:28,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:28,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:28,485 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:28,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:28,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421146265] [2021-08-25 20:36:28,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421146265] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:28,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:28,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:28,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339011641] [2021-08-25 20:36:28,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:28,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:28,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:28,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:28,487 INFO L87 Difference]: Start difference. First operand 257 states and 391 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:28,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:28,693 INFO L93 Difference]: Finished difference Result 516 states and 787 transitions. [2021-08-25 20:36:28,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:28,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2021-08-25 20:36:28,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:28,694 INFO L225 Difference]: With dead ends: 516 [2021-08-25 20:36:28,694 INFO L226 Difference]: Without dead ends: 278 [2021-08-25 20:36:28,695 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:28,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-08-25 20:36:28,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2021-08-25 20:36:28,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.5234375) internal successors, (390), 256 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) [2021-08-25 20:36:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 390 transitions. [2021-08-25 20:36:28,699 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 390 transitions. Word has length 96 [2021-08-25 20:36:28,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:28,699 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 390 transitions. [2021-08-25 20:36:28,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 390 transitions. [2021-08-25 20:36:28,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-08-25 20:36:28,699 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:28,699 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2021-08-25 20:36:28,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-25 20:36:28,700 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:28,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:28,700 INFO L82 PathProgramCache]: Analyzing trace with hash -445614852, now seen corresponding path program 1 times [2021-08-25 20:36:28,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:28,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142994225] [2021-08-25 20:36:28,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:28,700 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:28,733 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:28,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:28,733 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142994225] [2021-08-25 20:36:28,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142994225] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:28,733 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:28,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:28,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086216045] [2021-08-25 20:36:28,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:28,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:28,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:28,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:28,735 INFO L87 Difference]: Start difference. First operand 257 states and 390 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:28,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:28,979 INFO L93 Difference]: Finished difference Result 550 states and 834 transitions. [2021-08-25 20:36:28,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:28,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-08-25 20:36:28,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:28,983 INFO L225 Difference]: With dead ends: 550 [2021-08-25 20:36:28,983 INFO L226 Difference]: Without dead ends: 312 [2021-08-25 20:36:28,983 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:28,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-08-25 20:36:28,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 257. [2021-08-25 20:36:28,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.51953125) internal successors, (389), 256 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) [2021-08-25 20:36:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 389 transitions. [2021-08-25 20:36:28,987 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 389 transitions. Word has length 97 [2021-08-25 20:36:28,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:28,988 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 389 transitions. [2021-08-25 20:36:28,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:28,988 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 389 transitions. [2021-08-25 20:36:28,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-08-25 20:36:28,988 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:28,989 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2021-08-25 20:36:28,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-25 20:36:28,989 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:28,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:28,989 INFO L82 PathProgramCache]: Analyzing trace with hash -404940102, now seen corresponding path program 1 times [2021-08-25 20:36:28,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:28,990 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632635408] [2021-08-25 20:36:28,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:28,990 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:29,021 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:29,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:29,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632635408] [2021-08-25 20:36:29,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632635408] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:29,022 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:29,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:29,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023919518] [2021-08-25 20:36:29,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:29,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:29,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:29,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:29,023 INFO L87 Difference]: Start difference. First operand 257 states and 389 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:29,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:29,210 INFO L93 Difference]: Finished difference Result 516 states and 783 transitions. [2021-08-25 20:36:29,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:29,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-08-25 20:36:29,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:29,212 INFO L225 Difference]: With dead ends: 516 [2021-08-25 20:36:29,212 INFO L226 Difference]: Without dead ends: 278 [2021-08-25 20:36:29,212 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:29,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-08-25 20:36:29,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2021-08-25 20:36:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.515625) internal successors, (388), 256 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:29,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 388 transitions. [2021-08-25 20:36:29,216 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 388 transitions. Word has length 97 [2021-08-25 20:36:29,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:29,216 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 388 transitions. [2021-08-25 20:36:29,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 388 transitions. [2021-08-25 20:36:29,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:36:29,217 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:29,217 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1] [2021-08-25 20:36:29,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-25 20:36:29,217 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:29,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:29,217 INFO L82 PathProgramCache]: Analyzing trace with hash 65194841, now seen corresponding path program 1 times [2021-08-25 20:36:29,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:29,217 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249832046] [2021-08-25 20:36:29,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:29,217 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:29,249 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:29,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:29,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249832046] [2021-08-25 20:36:29,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249832046] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:29,250 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:29,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:29,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831602077] [2021-08-25 20:36:29,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:29,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:29,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:29,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:29,252 INFO L87 Difference]: Start difference. First operand 257 states and 388 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:29,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:29,507 INFO L93 Difference]: Finished difference Result 550 states and 830 transitions. [2021-08-25 20:36:29,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:29,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-25 20:36:29,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:29,508 INFO L225 Difference]: With dead ends: 550 [2021-08-25 20:36:29,508 INFO L226 Difference]: Without dead ends: 312 [2021-08-25 20:36:29,509 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:29,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-08-25 20:36:29,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 257. [2021-08-25 20:36:29,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.51171875) internal successors, (387), 256 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:29,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 387 transitions. [2021-08-25 20:36:29,513 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 387 transitions. Word has length 98 [2021-08-25 20:36:29,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:29,513 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 387 transitions. [2021-08-25 20:36:29,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:29,513 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 387 transitions. [2021-08-25 20:36:29,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:36:29,514 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:29,514 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1] [2021-08-25 20:36:29,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-25 20:36:29,514 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:29,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:29,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1326112091, now seen corresponding path program 1 times [2021-08-25 20:36:29,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:29,514 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635050270] [2021-08-25 20:36:29,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:29,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:29,545 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:29,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:29,545 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635050270] [2021-08-25 20:36:29,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635050270] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:29,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:29,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:29,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601160183] [2021-08-25 20:36:29,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:29,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:29,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:29,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:29,546 INFO L87 Difference]: Start difference. First operand 257 states and 387 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:29,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:29,727 INFO L93 Difference]: Finished difference Result 516 states and 779 transitions. [2021-08-25 20:36:29,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:29,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-25 20:36:29,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:29,728 INFO L225 Difference]: With dead ends: 516 [2021-08-25 20:36:29,728 INFO L226 Difference]: Without dead ends: 278 [2021-08-25 20:36:29,729 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:29,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-08-25 20:36:29,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2021-08-25 20:36:29,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.5078125) internal successors, (386), 256 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:29,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 386 transitions. [2021-08-25 20:36:29,732 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 386 transitions. Word has length 98 [2021-08-25 20:36:29,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:29,732 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 386 transitions. [2021-08-25 20:36:29,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:29,732 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 386 transitions. [2021-08-25 20:36:29,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-25 20:36:29,733 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:29,733 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1] [2021-08-25 20:36:29,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-25 20:36:29,733 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:29,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:29,733 INFO L82 PathProgramCache]: Analyzing trace with hash -726636041, now seen corresponding path program 1 times [2021-08-25 20:36:29,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:29,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136432684] [2021-08-25 20:36:29,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:29,734 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:29,773 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:29,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:29,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136432684] [2021-08-25 20:36:29,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136432684] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:29,774 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:29,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:29,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888047332] [2021-08-25 20:36:29,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:29,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:29,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:29,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:29,775 INFO L87 Difference]: Start difference. First operand 257 states and 386 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:30,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:30,016 INFO L93 Difference]: Finished difference Result 550 states and 826 transitions. [2021-08-25 20:36:30,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:30,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 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 99 [2021-08-25 20:36:30,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:30,017 INFO L225 Difference]: With dead ends: 550 [2021-08-25 20:36:30,017 INFO L226 Difference]: Without dead ends: 312 [2021-08-25 20:36:30,018 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:30,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-08-25 20:36:30,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 257. [2021-08-25 20:36:30,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.50390625) internal successors, (385), 256 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) [2021-08-25 20:36:30,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 385 transitions. [2021-08-25 20:36:30,021 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 385 transitions. Word has length 99 [2021-08-25 20:36:30,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:30,022 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 385 transitions. [2021-08-25 20:36:30,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:30,022 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 385 transitions. [2021-08-25 20:36:30,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-25 20:36:30,022 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:30,022 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1] [2021-08-25 20:36:30,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-25 20:36:30,022 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:30,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:30,023 INFO L82 PathProgramCache]: Analyzing trace with hash -292906955, now seen corresponding path program 1 times [2021-08-25 20:36:30,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:30,023 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257982822] [2021-08-25 20:36:30,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:30,023 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:30,055 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:30,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:30,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257982822] [2021-08-25 20:36:30,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257982822] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:30,056 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:30,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:30,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088223223] [2021-08-25 20:36:30,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:30,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:30,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:30,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:30,057 INFO L87 Difference]: Start difference. First operand 257 states and 385 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:30,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:30,246 INFO L93 Difference]: Finished difference Result 516 states and 775 transitions. [2021-08-25 20:36:30,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:30,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 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 99 [2021-08-25 20:36:30,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:30,247 INFO L225 Difference]: With dead ends: 516 [2021-08-25 20:36:30,247 INFO L226 Difference]: Without dead ends: 278 [2021-08-25 20:36:30,248 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:30,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-08-25 20:36:30,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2021-08-25 20:36:30,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.5) internal successors, (384), 256 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:30,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 384 transitions. [2021-08-25 20:36:30,251 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 384 transitions. Word has length 99 [2021-08-25 20:36:30,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:30,251 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 384 transitions. [2021-08-25 20:36:30,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:30,252 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 384 transitions. [2021-08-25 20:36:30,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-25 20:36:30,252 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:30,252 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2021-08-25 20:36:30,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-25 20:36:30,252 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:30,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:30,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1049348212, now seen corresponding path program 1 times [2021-08-25 20:36:30,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:30,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868461780] [2021-08-25 20:36:30,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:30,253 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:30,285 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:30,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:30,285 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868461780] [2021-08-25 20:36:30,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868461780] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:30,285 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:30,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:30,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919267654] [2021-08-25 20:36:30,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:30,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:30,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:30,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:30,286 INFO L87 Difference]: Start difference. First operand 257 states and 384 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:30,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:30,517 INFO L93 Difference]: Finished difference Result 540 states and 810 transitions. [2021-08-25 20:36:30,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:30,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-25 20:36:30,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:30,518 INFO L225 Difference]: With dead ends: 540 [2021-08-25 20:36:30,518 INFO L226 Difference]: Without dead ends: 302 [2021-08-25 20:36:30,518 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:30,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-08-25 20:36:30,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 257. [2021-08-25 20:36:30,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.49609375) internal successors, (383), 256 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:30,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 383 transitions. [2021-08-25 20:36:30,522 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 383 transitions. Word has length 100 [2021-08-25 20:36:30,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:30,522 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 383 transitions. [2021-08-25 20:36:30,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:30,523 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 383 transitions. [2021-08-25 20:36:30,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-25 20:36:30,523 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:30,523 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2021-08-25 20:36:30,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-25 20:36:30,523 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:30,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:30,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1610047990, now seen corresponding path program 1 times [2021-08-25 20:36:30,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:30,524 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022058415] [2021-08-25 20:36:30,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:30,524 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:30,575 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:30,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:30,575 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022058415] [2021-08-25 20:36:30,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022058415] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:30,575 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:30,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:30,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388562448] [2021-08-25 20:36:30,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:30,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:30,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:30,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:30,577 INFO L87 Difference]: Start difference. First operand 257 states and 383 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:30,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:30,773 INFO L93 Difference]: Finished difference Result 506 states and 759 transitions. [2021-08-25 20:36:30,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:30,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-25 20:36:30,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:30,774 INFO L225 Difference]: With dead ends: 506 [2021-08-25 20:36:30,774 INFO L226 Difference]: Without dead ends: 268 [2021-08-25 20:36:30,775 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:30,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-08-25 20:36:30,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 257. [2021-08-25 20:36:30,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.4921875) internal successors, (382), 256 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:30,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 382 transitions. [2021-08-25 20:36:30,779 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 382 transitions. Word has length 100 [2021-08-25 20:36:30,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:30,779 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 382 transitions. [2021-08-25 20:36:30,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:30,779 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 382 transitions. [2021-08-25 20:36:30,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-08-25 20:36:30,780 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:30,780 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-08-25 20:36:30,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-08-25 20:36:30,780 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:30,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:30,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1540193984, now seen corresponding path program 1 times [2021-08-25 20:36:30,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:30,781 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82870532] [2021-08-25 20:36:30,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:30,781 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:30,811 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:30,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:30,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82870532] [2021-08-25 20:36:30,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82870532] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:30,812 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:30,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:30,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373999166] [2021-08-25 20:36:30,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:30,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:30,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:30,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:30,813 INFO L87 Difference]: Start difference. First operand 257 states and 382 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:31,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:31,042 INFO L93 Difference]: Finished difference Result 540 states and 806 transitions. [2021-08-25 20:36:31,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:31,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-08-25 20:36:31,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:31,043 INFO L225 Difference]: With dead ends: 540 [2021-08-25 20:36:31,043 INFO L226 Difference]: Without dead ends: 302 [2021-08-25 20:36:31,044 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:31,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-08-25 20:36:31,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 257. [2021-08-25 20:36:31,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.48828125) internal successors, (381), 256 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) [2021-08-25 20:36:31,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 381 transitions. [2021-08-25 20:36:31,051 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 381 transitions. Word has length 104 [2021-08-25 20:36:31,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:31,052 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 381 transitions. [2021-08-25 20:36:31,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:31,052 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 381 transitions. [2021-08-25 20:36:31,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-08-25 20:36:31,052 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:31,053 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-08-25 20:36:31,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-08-25 20:36:31,053 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:31,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:31,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1957590590, now seen corresponding path program 1 times [2021-08-25 20:36:31,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:31,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273567463] [2021-08-25 20:36:31,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:31,054 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:31,086 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:36:31,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:31,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273567463] [2021-08-25 20:36:31,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273567463] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:31,087 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:31,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:31,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398201483] [2021-08-25 20:36:31,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:31,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:31,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:31,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:31,088 INFO L87 Difference]: Start difference. First operand 257 states and 381 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) [2021-08-25 20:36:31,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:31,273 INFO L93 Difference]: Finished difference Result 547 states and 819 transitions. [2021-08-25 20:36:31,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:31,274 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 104 [2021-08-25 20:36:31,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:31,275 INFO L225 Difference]: With dead ends: 547 [2021-08-25 20:36:31,275 INFO L226 Difference]: Without dead ends: 309 [2021-08-25 20:36:31,275 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-08-25 20:36:31,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 283. [2021-08-25 20:36:31,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.5106382978723405) internal successors, (426), 282 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:31,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 426 transitions. [2021-08-25 20:36:31,279 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 426 transitions. Word has length 104 [2021-08-25 20:36:31,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:31,279 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 426 transitions. [2021-08-25 20:36:31,279 INFO L471 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) [2021-08-25 20:36:31,279 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 426 transitions. [2021-08-25 20:36:31,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-08-25 20:36:31,280 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:31,280 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-08-25 20:36:31,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-08-25 20:36:31,280 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:31,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:31,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1642233629, now seen corresponding path program 1 times [2021-08-25 20:36:31,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:31,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351180184] [2021-08-25 20:36:31,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:31,281 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:31,315 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:31,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:31,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351180184] [2021-08-25 20:36:31,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351180184] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:31,316 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:31,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:31,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158872774] [2021-08-25 20:36:31,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:31,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:31,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:31,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:31,318 INFO L87 Difference]: Start difference. First operand 283 states and 426 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) [2021-08-25 20:36:31,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:31,549 INFO L93 Difference]: Finished difference Result 592 states and 894 transitions. [2021-08-25 20:36:31,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:31,549 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 107 [2021-08-25 20:36:31,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:31,550 INFO L225 Difference]: With dead ends: 592 [2021-08-25 20:36:31,550 INFO L226 Difference]: Without dead ends: 328 [2021-08-25 20:36:31,550 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:31,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-08-25 20:36:31,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 283. [2021-08-25 20:36:31,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.5070921985815602) internal successors, (425), 282 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:31,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 425 transitions. [2021-08-25 20:36:31,555 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 425 transitions. Word has length 107 [2021-08-25 20:36:31,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:31,555 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 425 transitions. [2021-08-25 20:36:31,555 INFO L471 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) [2021-08-25 20:36:31,555 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 425 transitions. [2021-08-25 20:36:31,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-08-25 20:36:31,556 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:31,556 INFO L512 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:31,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-08-25 20:36:31,556 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:31,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:31,556 INFO L82 PathProgramCache]: Analyzing trace with hash 35471872, now seen corresponding path program 1 times [2021-08-25 20:36:31,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:31,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378785639] [2021-08-25 20:36:31,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:31,556 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:31,595 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:31,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:31,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378785639] [2021-08-25 20:36:31,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378785639] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:31,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:31,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:31,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073485563] [2021-08-25 20:36:31,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:31,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:31,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:31,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:31,596 INFO L87 Difference]: Start difference. First operand 283 states and 425 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:31,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:31,814 INFO L93 Difference]: Finished difference Result 584 states and 879 transitions. [2021-08-25 20:36:31,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:31,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 108 [2021-08-25 20:36:31,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:31,815 INFO L225 Difference]: With dead ends: 584 [2021-08-25 20:36:31,815 INFO L226 Difference]: Without dead ends: 320 [2021-08-25 20:36:31,816 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:31,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-08-25 20:36:31,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 283. [2021-08-25 20:36:31,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.50354609929078) internal successors, (424), 282 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 424 transitions. [2021-08-25 20:36:31,820 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 424 transitions. Word has length 108 [2021-08-25 20:36:31,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:31,820 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 424 transitions. [2021-08-25 20:36:31,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 424 transitions. [2021-08-25 20:36:31,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-08-25 20:36:31,821 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:31,821 INFO L512 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:31,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-08-25 20:36:31,821 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:31,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:31,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1751499325, now seen corresponding path program 1 times [2021-08-25 20:36:31,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:31,822 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455470339] [2021-08-25 20:36:31,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:31,822 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:31,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:31,859 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455470339] [2021-08-25 20:36:31,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455470339] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:31,859 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:31,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:31,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308264338] [2021-08-25 20:36:31,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:31,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:31,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:31,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:31,860 INFO L87 Difference]: Start difference. First operand 283 states and 424 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:32,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:32,075 INFO L93 Difference]: Finished difference Result 584 states and 877 transitions. [2021-08-25 20:36:32,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:32,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 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 109 [2021-08-25 20:36:32,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:32,077 INFO L225 Difference]: With dead ends: 584 [2021-08-25 20:36:32,077 INFO L226 Difference]: Without dead ends: 320 [2021-08-25 20:36:32,077 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:32,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-08-25 20:36:32,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 283. [2021-08-25 20:36:32,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.5) internal successors, (423), 282 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:32,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 423 transitions. [2021-08-25 20:36:32,082 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 423 transitions. Word has length 109 [2021-08-25 20:36:32,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:32,082 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 423 transitions. [2021-08-25 20:36:32,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:32,082 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 423 transitions. [2021-08-25 20:36:32,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-08-25 20:36:32,083 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:32,083 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2021-08-25 20:36:32,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-08-25 20:36:32,083 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:32,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:32,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1247479925, now seen corresponding path program 1 times [2021-08-25 20:36:32,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:32,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623580614] [2021-08-25 20:36:32,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:32,084 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:32,119 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:32,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:32,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623580614] [2021-08-25 20:36:32,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623580614] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:32,120 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:32,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:32,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722352024] [2021-08-25 20:36:32,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:32,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:32,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:32,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:32,121 INFO L87 Difference]: Start difference. First operand 283 states and 423 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) [2021-08-25 20:36:32,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:32,356 INFO L93 Difference]: Finished difference Result 584 states and 875 transitions. [2021-08-25 20:36:32,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:32,357 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 110 [2021-08-25 20:36:32,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:32,358 INFO L225 Difference]: With dead ends: 584 [2021-08-25 20:36:32,358 INFO L226 Difference]: Without dead ends: 320 [2021-08-25 20:36:32,358 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:32,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-08-25 20:36:32,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 283. [2021-08-25 20:36:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.49645390070922) internal successors, (422), 282 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) [2021-08-25 20:36:32,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 422 transitions. [2021-08-25 20:36:32,363 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 422 transitions. Word has length 110 [2021-08-25 20:36:32,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:32,363 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 422 transitions. [2021-08-25 20:36:32,363 INFO L471 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) [2021-08-25 20:36:32,363 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 422 transitions. [2021-08-25 20:36:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-08-25 20:36:32,364 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:32,364 INFO L512 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:32,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-08-25 20:36:32,364 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:32,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:32,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1790632826, now seen corresponding path program 1 times [2021-08-25 20:36:32,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:32,365 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567870332] [2021-08-25 20:36:32,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:32,365 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:32,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:32,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567870332] [2021-08-25 20:36:32,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567870332] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:32,403 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:32,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:32,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681196119] [2021-08-25 20:36:32,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:32,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:32,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:32,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:32,404 INFO L87 Difference]: Start difference. First operand 283 states and 422 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) [2021-08-25 20:36:32,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:32,625 INFO L93 Difference]: Finished difference Result 582 states and 871 transitions. [2021-08-25 20:36:32,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:32,626 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 110 [2021-08-25 20:36:32,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:32,627 INFO L225 Difference]: With dead ends: 582 [2021-08-25 20:36:32,627 INFO L226 Difference]: Without dead ends: 318 [2021-08-25 20:36:32,627 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:32,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-08-25 20:36:32,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 283. [2021-08-25 20:36:32,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.4929078014184398) internal successors, (421), 282 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 421 transitions. [2021-08-25 20:36:32,632 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 421 transitions. Word has length 110 [2021-08-25 20:36:32,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:32,632 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 421 transitions. [2021-08-25 20:36:32,633 INFO L471 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) [2021-08-25 20:36:32,633 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 421 transitions. [2021-08-25 20:36:32,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-08-25 20:36:32,633 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:32,633 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1] [2021-08-25 20:36:32,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-08-25 20:36:32,634 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:32,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:32,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1521793640, now seen corresponding path program 1 times [2021-08-25 20:36:32,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:32,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383434037] [2021-08-25 20:36:32,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:32,635 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:32,667 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:32,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:32,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383434037] [2021-08-25 20:36:32,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383434037] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:32,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:32,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:32,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725872258] [2021-08-25 20:36:32,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:32,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:32,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:32,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:32,669 INFO L87 Difference]: Start difference. First operand 283 states and 421 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:32,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:32,886 INFO L93 Difference]: Finished difference Result 580 states and 866 transitions. [2021-08-25 20:36:32,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:32,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 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 111 [2021-08-25 20:36:32,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:32,888 INFO L225 Difference]: With dead ends: 580 [2021-08-25 20:36:32,888 INFO L226 Difference]: Without dead ends: 316 [2021-08-25 20:36:32,888 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:32,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-08-25 20:36:32,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 283. [2021-08-25 20:36:32,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.4893617021276595) internal successors, (420), 282 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 420 transitions. [2021-08-25 20:36:32,893 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 420 transitions. Word has length 111 [2021-08-25 20:36:32,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:32,893 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 420 transitions. [2021-08-25 20:36:32,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:32,894 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 420 transitions. [2021-08-25 20:36:32,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-08-25 20:36:32,894 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:32,894 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:32,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-08-25 20:36:32,895 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:32,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:32,895 INFO L82 PathProgramCache]: Analyzing trace with hash 244047579, now seen corresponding path program 1 times [2021-08-25 20:36:32,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:32,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743395597] [2021-08-25 20:36:32,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:32,896 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:32,930 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:32,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:32,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743395597] [2021-08-25 20:36:32,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743395597] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:32,931 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:32,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:32,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018774399] [2021-08-25 20:36:32,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:32,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:32,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:32,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:32,932 INFO L87 Difference]: Start difference. First operand 283 states and 420 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:33,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:33,131 INFO L93 Difference]: Finished difference Result 577 states and 860 transitions. [2021-08-25 20:36:33,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:33,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 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 111 [2021-08-25 20:36:33,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:33,133 INFO L225 Difference]: With dead ends: 577 [2021-08-25 20:36:33,133 INFO L226 Difference]: Without dead ends: 313 [2021-08-25 20:36:33,133 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:33,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-08-25 20:36:33,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 283. [2021-08-25 20:36:33,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.4858156028368794) internal successors, (419), 282 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:33,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 419 transitions. [2021-08-25 20:36:33,138 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 419 transitions. Word has length 111 [2021-08-25 20:36:33,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:33,138 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 419 transitions. [2021-08-25 20:36:33,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:33,139 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 419 transitions. [2021-08-25 20:36:33,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-08-25 20:36:33,139 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:33,139 INFO L512 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:33,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-08-25 20:36:33,140 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:33,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:33,140 INFO L82 PathProgramCache]: Analyzing trace with hash -344193252, now seen corresponding path program 1 times [2021-08-25 20:36:33,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:33,140 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468342312] [2021-08-25 20:36:33,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:33,140 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:33,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:33,174 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468342312] [2021-08-25 20:36:33,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468342312] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:33,174 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:33,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:33,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070951541] [2021-08-25 20:36:33,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:33,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:33,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:33,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:33,175 INFO L87 Difference]: Start difference. First operand 283 states and 419 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) [2021-08-25 20:36:33,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:33,382 INFO L93 Difference]: Finished difference Result 577 states and 858 transitions. [2021-08-25 20:36:33,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:33,382 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 [2021-08-25 20:36:33,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:33,383 INFO L225 Difference]: With dead ends: 577 [2021-08-25 20:36:33,383 INFO L226 Difference]: Without dead ends: 313 [2021-08-25 20:36:33,383 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:33,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-08-25 20:36:33,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 283. [2021-08-25 20:36:33,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.4822695035460993) internal successors, (418), 282 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:33,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 418 transitions. [2021-08-25 20:36:33,396 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 418 transitions. Word has length 113 [2021-08-25 20:36:33,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:33,396 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 418 transitions. [2021-08-25 20:36:33,396 INFO L471 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) [2021-08-25 20:36:33,396 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 418 transitions. [2021-08-25 20:36:33,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-08-25 20:36:33,397 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:33,397 INFO L512 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:33,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-08-25 20:36:33,400 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:33,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:33,401 INFO L82 PathProgramCache]: Analyzing trace with hash -574798082, now seen corresponding path program 1 times [2021-08-25 20:36:33,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:33,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459071999] [2021-08-25 20:36:33,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:33,401 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:33,434 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:33,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:33,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459071999] [2021-08-25 20:36:33,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459071999] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:33,435 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:33,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:33,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562939295] [2021-08-25 20:36:33,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:33,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:33,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:33,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:33,436 INFO L87 Difference]: Start difference. First operand 283 states and 418 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) [2021-08-25 20:36:33,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:33,651 INFO L93 Difference]: Finished difference Result 573 states and 851 transitions. [2021-08-25 20:36:33,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:33,652 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 114 [2021-08-25 20:36:33,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:33,653 INFO L225 Difference]: With dead ends: 573 [2021-08-25 20:36:33,653 INFO L226 Difference]: Without dead ends: 309 [2021-08-25 20:36:33,653 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:33,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-08-25 20:36:33,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 283. [2021-08-25 20:36:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.4787234042553192) internal successors, (417), 282 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 417 transitions. [2021-08-25 20:36:33,658 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 417 transitions. Word has length 114 [2021-08-25 20:36:33,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:33,658 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 417 transitions. [2021-08-25 20:36:33,658 INFO L471 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) [2021-08-25 20:36:33,658 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 417 transitions. [2021-08-25 20:36:33,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-08-25 20:36:33,659 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:33,659 INFO L512 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:33,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-08-25 20:36:33,659 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:33,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:33,660 INFO L82 PathProgramCache]: Analyzing trace with hash -53439120, now seen corresponding path program 1 times [2021-08-25 20:36:33,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:33,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193624575] [2021-08-25 20:36:33,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:33,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:33,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:33,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193624575] [2021-08-25 20:36:33,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193624575] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:33,696 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:33,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:33,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179092237] [2021-08-25 20:36:33,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:33,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:33,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:33,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:33,698 INFO L87 Difference]: Start difference. First operand 283 states and 417 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) [2021-08-25 20:36:33,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:33,903 INFO L93 Difference]: Finished difference Result 573 states and 849 transitions. [2021-08-25 20:36:33,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:33,903 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 114 [2021-08-25 20:36:33,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:33,904 INFO L225 Difference]: With dead ends: 573 [2021-08-25 20:36:33,904 INFO L226 Difference]: Without dead ends: 309 [2021-08-25 20:36:33,905 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:33,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-08-25 20:36:33,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 283. [2021-08-25 20:36:33,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.475177304964539) internal successors, (416), 282 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 416 transitions. [2021-08-25 20:36:33,909 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 416 transitions. Word has length 114 [2021-08-25 20:36:33,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:33,909 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 416 transitions. [2021-08-25 20:36:33,909 INFO L471 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) [2021-08-25 20:36:33,909 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 416 transitions. [2021-08-25 20:36:33,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-08-25 20:36:33,910 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:33,910 INFO L512 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:33,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-08-25 20:36:33,910 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:33,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:33,910 INFO L82 PathProgramCache]: Analyzing trace with hash -235371218, now seen corresponding path program 1 times [2021-08-25 20:36:33,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:33,910 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219053512] [2021-08-25 20:36:33,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:33,911 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:33,946 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:33,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:33,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219053512] [2021-08-25 20:36:33,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219053512] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:33,946 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:33,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:33,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109278716] [2021-08-25 20:36:33,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:33,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:33,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:33,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:33,947 INFO L87 Difference]: Start difference. First operand 283 states and 416 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) [2021-08-25 20:36:34,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:34,147 INFO L93 Difference]: Finished difference Result 571 states and 845 transitions. [2021-08-25 20:36:34,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:34,147 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 115 [2021-08-25 20:36:34,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:34,148 INFO L225 Difference]: With dead ends: 571 [2021-08-25 20:36:34,148 INFO L226 Difference]: Without dead ends: 307 [2021-08-25 20:36:34,148 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:34,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-08-25 20:36:34,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 283. [2021-08-25 20:36:34,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.4716312056737588) internal successors, (415), 282 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:34,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 415 transitions. [2021-08-25 20:36:34,153 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 415 transitions. Word has length 115 [2021-08-25 20:36:34,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:34,153 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 415 transitions. [2021-08-25 20:36:34,153 INFO L471 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) [2021-08-25 20:36:34,153 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 415 transitions. [2021-08-25 20:36:34,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-08-25 20:36:34,154 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:34,154 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:34,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-08-25 20:36:34,154 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:34,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:34,154 INFO L82 PathProgramCache]: Analyzing trace with hash 16472555, now seen corresponding path program 1 times [2021-08-25 20:36:34,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:34,154 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828904050] [2021-08-25 20:36:34,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:34,154 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:34,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:34,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828904050] [2021-08-25 20:36:34,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828904050] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:34,188 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:34,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:34,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122551381] [2021-08-25 20:36:34,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:34,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:34,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:34,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:34,189 INFO L87 Difference]: Start difference. First operand 283 states and 415 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) [2021-08-25 20:36:34,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:34,393 INFO L93 Difference]: Finished difference Result 571 states and 843 transitions. [2021-08-25 20:36:34,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:34,394 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 116 [2021-08-25 20:36:34,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:34,395 INFO L225 Difference]: With dead ends: 571 [2021-08-25 20:36:34,395 INFO L226 Difference]: Without dead ends: 307 [2021-08-25 20:36:34,395 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:34,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-08-25 20:36:34,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 283. [2021-08-25 20:36:34,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.4680851063829787) internal successors, (414), 282 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:34,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 414 transitions. [2021-08-25 20:36:34,400 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 414 transitions. Word has length 116 [2021-08-25 20:36:34,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:34,400 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 414 transitions. [2021-08-25 20:36:34,400 INFO L471 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) [2021-08-25 20:36:34,400 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 414 transitions. [2021-08-25 20:36:34,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-08-25 20:36:34,401 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:34,401 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:34,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-08-25 20:36:34,401 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:34,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:34,401 INFO L82 PathProgramCache]: Analyzing trace with hash -349731447, now seen corresponding path program 1 times [2021-08-25 20:36:34,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:34,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929027282] [2021-08-25 20:36:34,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:34,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:34,435 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:34,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:34,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929027282] [2021-08-25 20:36:34,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929027282] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:34,436 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:34,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:34,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719160277] [2021-08-25 20:36:34,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:34,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:34,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:34,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:34,437 INFO L87 Difference]: Start difference. First operand 283 states and 414 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) [2021-08-25 20:36:34,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:34,640 INFO L93 Difference]: Finished difference Result 569 states and 839 transitions. [2021-08-25 20:36:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:34,640 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 117 [2021-08-25 20:36:34,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:34,641 INFO L225 Difference]: With dead ends: 569 [2021-08-25 20:36:34,641 INFO L226 Difference]: Without dead ends: 305 [2021-08-25 20:36:34,642 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:34,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-08-25 20:36:34,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 283. [2021-08-25 20:36:34,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.4645390070921986) internal successors, (413), 282 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:34,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 413 transitions. [2021-08-25 20:36:34,646 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 413 transitions. Word has length 117 [2021-08-25 20:36:34,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:34,647 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 413 transitions. [2021-08-25 20:36:34,647 INFO L471 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) [2021-08-25 20:36:34,647 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 413 transitions. [2021-08-25 20:36:34,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-08-25 20:36:34,647 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:34,648 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1] [2021-08-25 20:36:34,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-08-25 20:36:34,648 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:34,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:34,648 INFO L82 PathProgramCache]: Analyzing trace with hash 629494119, now seen corresponding path program 1 times [2021-08-25 20:36:34,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:34,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868179444] [2021-08-25 20:36:34,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:34,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:34,681 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-08-25 20:36:34,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:34,682 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868179444] [2021-08-25 20:36:34,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868179444] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:34,682 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:34,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:34,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60369217] [2021-08-25 20:36:34,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:34,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:34,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:34,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:34,683 INFO L87 Difference]: Start difference. First operand 283 states and 413 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:34,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:34,901 INFO L93 Difference]: Finished difference Result 618 states and 914 transitions. [2021-08-25 20:36:34,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:34,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2021-08-25 20:36:34,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:34,903 INFO L225 Difference]: With dead ends: 618 [2021-08-25 20:36:34,903 INFO L226 Difference]: Without dead ends: 354 [2021-08-25 20:36:34,903 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:34,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-08-25 20:36:34,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 315. [2021-08-25 20:36:34,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 1.4968152866242037) internal successors, (470), 314 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:34,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 470 transitions. [2021-08-25 20:36:34,908 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 470 transitions. Word has length 117 [2021-08-25 20:36:34,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:34,908 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 470 transitions. [2021-08-25 20:36:34,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:34,909 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 470 transitions. [2021-08-25 20:36:34,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-08-25 20:36:34,909 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:34,909 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1] [2021-08-25 20:36:34,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-08-25 20:36:34,910 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:34,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:34,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1118786538, now seen corresponding path program 1 times [2021-08-25 20:36:34,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:34,910 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595208917] [2021-08-25 20:36:34,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:34,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:34,940 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:36:34,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:34,941 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595208917] [2021-08-25 20:36:34,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595208917] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:34,941 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:34,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:34,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524491243] [2021-08-25 20:36:34,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:34,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:34,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:34,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:34,942 INFO L87 Difference]: Start difference. First operand 315 states and 470 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) [2021-08-25 20:36:35,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:35,215 INFO L93 Difference]: Finished difference Result 717 states and 1082 transitions. [2021-08-25 20:36:35,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:35,215 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 118 [2021-08-25 20:36:35,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:35,216 INFO L225 Difference]: With dead ends: 717 [2021-08-25 20:36:35,216 INFO L226 Difference]: Without dead ends: 421 [2021-08-25 20:36:35,217 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:35,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2021-08-25 20:36:35,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 354. [2021-08-25 20:36:35,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 1.5325779036827196) internal successors, (541), 353 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:35,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 541 transitions. [2021-08-25 20:36:35,224 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 541 transitions. Word has length 118 [2021-08-25 20:36:35,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:35,224 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 541 transitions. [2021-08-25 20:36:35,224 INFO L471 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) [2021-08-25 20:36:35,224 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 541 transitions. [2021-08-25 20:36:35,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-08-25 20:36:35,225 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:35,225 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1] [2021-08-25 20:36:35,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-08-25 20:36:35,225 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:35,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:35,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1992730650, now seen corresponding path program 1 times [2021-08-25 20:36:35,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:35,226 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253093798] [2021-08-25 20:36:35,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:35,226 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:35,256 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:36:35,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:35,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253093798] [2021-08-25 20:36:35,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253093798] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:35,257 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:35,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:35,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419498874] [2021-08-25 20:36:35,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:35,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:35,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:35,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:35,258 INFO L87 Difference]: Start difference. First operand 354 states and 541 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:35,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:35,538 INFO L93 Difference]: Finished difference Result 748 states and 1141 transitions. [2021-08-25 20:36:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:35,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-08-25 20:36:35,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:35,540 INFO L225 Difference]: With dead ends: 748 [2021-08-25 20:36:35,540 INFO L226 Difference]: Without dead ends: 413 [2021-08-25 20:36:35,540 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:35,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-08-25 20:36:35,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 353. [2021-08-25 20:36:35,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 1.5340909090909092) internal successors, (540), 352 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 540 transitions. [2021-08-25 20:36:35,546 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 540 transitions. Word has length 119 [2021-08-25 20:36:35,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:35,547 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 540 transitions. [2021-08-25 20:36:35,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:35,547 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 540 transitions. [2021-08-25 20:36:35,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-08-25 20:36:35,548 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:35,548 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:35,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-08-25 20:36:35,548 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:35,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:35,548 INFO L82 PathProgramCache]: Analyzing trace with hash 375832611, now seen corresponding path program 1 times [2021-08-25 20:36:35,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:35,549 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478669242] [2021-08-25 20:36:35,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:35,549 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:35,586 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:36:35,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:35,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478669242] [2021-08-25 20:36:35,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478669242] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:35,586 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:35,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:35,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297902928] [2021-08-25 20:36:35,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:35,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:35,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:35,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:35,588 INFO L87 Difference]: Start difference. First operand 353 states and 540 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:35,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:35,800 INFO L93 Difference]: Finished difference Result 713 states and 1091 transitions. [2021-08-25 20:36:35,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:35,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-08-25 20:36:35,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:35,802 INFO L225 Difference]: With dead ends: 713 [2021-08-25 20:36:35,802 INFO L226 Difference]: Without dead ends: 379 [2021-08-25 20:36:35,802 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:35,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-08-25 20:36:35,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 353. [2021-08-25 20:36:35,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 1.53125) internal successors, (539), 352 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:35,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 539 transitions. [2021-08-25 20:36:35,807 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 539 transitions. Word has length 119 [2021-08-25 20:36:35,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:35,808 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 539 transitions. [2021-08-25 20:36:35,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:35,808 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 539 transitions. [2021-08-25 20:36:35,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-25 20:36:35,808 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:35,808 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:35,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-08-25 20:36:35,809 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:35,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:35,809 INFO L82 PathProgramCache]: Analyzing trace with hash -239737582, now seen corresponding path program 1 times [2021-08-25 20:36:35,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:35,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033566457] [2021-08-25 20:36:35,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:35,809 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:36:35,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:35,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033566457] [2021-08-25 20:36:35,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033566457] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:35,840 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:35,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:35,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197082606] [2021-08-25 20:36:35,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:35,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:35,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:35,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:35,841 INFO L87 Difference]: Start difference. First operand 353 states and 539 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:36,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:36,030 INFO L93 Difference]: Finished difference Result 713 states and 1089 transitions. [2021-08-25 20:36:36,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:36,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2021-08-25 20:36:36,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:36,032 INFO L225 Difference]: With dead ends: 713 [2021-08-25 20:36:36,032 INFO L226 Difference]: Without dead ends: 379 [2021-08-25 20:36:36,032 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:36,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-08-25 20:36:36,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 353. [2021-08-25 20:36:36,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 1.5284090909090908) internal successors, (538), 352 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:36,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 538 transitions. [2021-08-25 20:36:36,038 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 538 transitions. Word has length 120 [2021-08-25 20:36:36,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:36,038 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 538 transitions. [2021-08-25 20:36:36,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:36,038 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 538 transitions. [2021-08-25 20:36:36,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-08-25 20:36:36,039 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:36,039 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:36,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-08-25 20:36:36,039 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:36,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:36,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1589606562, now seen corresponding path program 1 times [2021-08-25 20:36:36,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:36,040 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655946762] [2021-08-25 20:36:36,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:36,040 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:36,070 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:36:36,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:36,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655946762] [2021-08-25 20:36:36,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655946762] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:36,071 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:36,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:36,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617609182] [2021-08-25 20:36:36,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:36,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:36,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:36,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:36,072 INFO L87 Difference]: Start difference. First operand 353 states and 538 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:36,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:36,253 INFO L93 Difference]: Finished difference Result 713 states and 1087 transitions. [2021-08-25 20:36:36,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:36,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2021-08-25 20:36:36,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:36,254 INFO L225 Difference]: With dead ends: 713 [2021-08-25 20:36:36,254 INFO L226 Difference]: Without dead ends: 379 [2021-08-25 20:36:36,255 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:36,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-08-25 20:36:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 353. [2021-08-25 20:36:36,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 1.5255681818181819) internal successors, (537), 352 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:36,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 537 transitions. [2021-08-25 20:36:36,265 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 537 transitions. Word has length 121 [2021-08-25 20:36:36,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:36,265 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 537 transitions. [2021-08-25 20:36:36,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 537 transitions. [2021-08-25 20:36:36,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-08-25 20:36:36,266 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:36,266 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:36,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-08-25 20:36:36,266 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:36,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:36,267 INFO L82 PathProgramCache]: Analyzing trace with hash 67065837, now seen corresponding path program 1 times [2021-08-25 20:36:36,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:36,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129498549] [2021-08-25 20:36:36,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:36,267 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:36:36,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:36,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129498549] [2021-08-25 20:36:36,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129498549] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:36,302 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:36,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:36,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818216560] [2021-08-25 20:36:36,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:36,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:36,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:36,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:36,303 INFO L87 Difference]: Start difference. First operand 353 states and 537 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:36,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:36,494 INFO L93 Difference]: Finished difference Result 703 states and 1073 transitions. [2021-08-25 20:36:36,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:36,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2021-08-25 20:36:36,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:36,495 INFO L225 Difference]: With dead ends: 703 [2021-08-25 20:36:36,495 INFO L226 Difference]: Without dead ends: 369 [2021-08-25 20:36:36,496 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:36,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-08-25 20:36:36,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 353. [2021-08-25 20:36:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 1.5227272727272727) internal successors, (536), 352 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 536 transitions. [2021-08-25 20:36:36,501 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 536 transitions. Word has length 122 [2021-08-25 20:36:36,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:36,502 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 536 transitions. [2021-08-25 20:36:36,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:36,502 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 536 transitions. [2021-08-25 20:36:36,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-08-25 20:36:36,502 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:36,503 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:36,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-08-25 20:36:36,503 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:36,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:36,503 INFO L82 PathProgramCache]: Analyzing trace with hash -184111027, now seen corresponding path program 1 times [2021-08-25 20:36:36,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:36,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725134253] [2021-08-25 20:36:36,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:36,504 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:36,534 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:36:36,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:36,535 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725134253] [2021-08-25 20:36:36,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725134253] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:36,535 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:36,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:36,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276489722] [2021-08-25 20:36:36,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:36,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:36,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:36,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:36,536 INFO L87 Difference]: Start difference. First operand 353 states and 536 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) [2021-08-25 20:36:36,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:36,817 INFO L93 Difference]: Finished difference Result 793 states and 1214 transitions. [2021-08-25 20:36:36,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:36,817 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 123 [2021-08-25 20:36:36,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:36,819 INFO L225 Difference]: With dead ends: 793 [2021-08-25 20:36:36,819 INFO L226 Difference]: Without dead ends: 459 [2021-08-25 20:36:36,819 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:36,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-08-25 20:36:36,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 392. [2021-08-25 20:36:36,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 1.5524296675191815) internal successors, (607), 391 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:36,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 607 transitions. [2021-08-25 20:36:36,830 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 607 transitions. Word has length 123 [2021-08-25 20:36:36,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:36,830 INFO L470 AbstractCegarLoop]: Abstraction has 392 states and 607 transitions. [2021-08-25 20:36:36,830 INFO L471 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) [2021-08-25 20:36:36,831 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 607 transitions. [2021-08-25 20:36:36,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-08-25 20:36:36,831 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:36,831 INFO L512 BasicCegarLoop]: 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:36,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-08-25 20:36:36,832 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:36,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:36,832 INFO L82 PathProgramCache]: Analyzing trace with hash 902900419, now seen corresponding path program 1 times [2021-08-25 20:36:36,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:36,832 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029221561] [2021-08-25 20:36:36,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:36,832 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:36:36,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:36,867 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029221561] [2021-08-25 20:36:36,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029221561] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:36,867 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:36,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:36,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470457763] [2021-08-25 20:36:36,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:36,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:36,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:36,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:36,868 INFO L87 Difference]: Start difference. First operand 392 states and 607 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:37,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:37,128 INFO L93 Difference]: Finished difference Result 824 states and 1273 transitions. [2021-08-25 20:36:37,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:37,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 124 [2021-08-25 20:36:37,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:37,130 INFO L225 Difference]: With dead ends: 824 [2021-08-25 20:36:37,130 INFO L226 Difference]: Without dead ends: 451 [2021-08-25 20:36:37,130 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:37,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-08-25 20:36:37,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 353. [2021-08-25 20:36:37,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 1.5227272727272727) internal successors, (536), 352 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:37,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 536 transitions. [2021-08-25 20:36:37,136 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 536 transitions. Word has length 124 [2021-08-25 20:36:37,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:37,137 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 536 transitions. [2021-08-25 20:36:37,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:37,137 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 536 transitions. [2021-08-25 20:36:37,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-08-25 20:36:37,137 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:37,138 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:37,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-08-25 20:36:37,138 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:37,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:37,138 INFO L82 PathProgramCache]: Analyzing trace with hash 155929017, now seen corresponding path program 1 times [2021-08-25 20:36:37,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:37,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767789150] [2021-08-25 20:36:37,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:37,139 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:37,170 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:36:37,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:37,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767789150] [2021-08-25 20:36:37,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767789150] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:37,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:37,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:37,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074001653] [2021-08-25 20:36:37,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:37,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:37,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:37,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:37,172 INFO L87 Difference]: Start difference. First operand 353 states and 536 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:37,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:37,360 INFO L93 Difference]: Finished difference Result 702 states and 1070 transitions. [2021-08-25 20:36:37,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:37,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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 125 [2021-08-25 20:36:37,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:37,361 INFO L225 Difference]: With dead ends: 702 [2021-08-25 20:36:37,361 INFO L226 Difference]: Without dead ends: 368 [2021-08-25 20:36:37,362 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:37,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-08-25 20:36:37,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 356. [2021-08-25 20:36:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 1.5183098591549296) internal successors, (539), 355 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:37,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 539 transitions. [2021-08-25 20:36:37,368 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 539 transitions. Word has length 125 [2021-08-25 20:36:37,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:37,368 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 539 transitions. [2021-08-25 20:36:37,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:37,368 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 539 transitions. [2021-08-25 20:36:37,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-08-25 20:36:37,369 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:37,369 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:37,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-08-25 20:36:37,369 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:37,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:37,370 INFO L82 PathProgramCache]: Analyzing trace with hash 911219166, now seen corresponding path program 1 times [2021-08-25 20:36:37,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:37,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473694770] [2021-08-25 20:36:37,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:37,370 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:37,403 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-25 20:36:37,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:37,404 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473694770] [2021-08-25 20:36:37,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473694770] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:37,404 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:37,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:37,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111810527] [2021-08-25 20:36:37,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:37,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:37,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:37,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:37,405 INFO L87 Difference]: Start difference. First operand 356 states and 539 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) [2021-08-25 20:36:37,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:37,572 INFO L93 Difference]: Finished difference Result 709 states and 1077 transitions. [2021-08-25 20:36:37,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:37,577 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 132 [2021-08-25 20:36:37,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:37,578 INFO L225 Difference]: With dead ends: 709 [2021-08-25 20:36:37,578 INFO L226 Difference]: Without dead ends: 372 [2021-08-25 20:36:37,578 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:37,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-08-25 20:36:37,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 356. [2021-08-25 20:36:37,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 1.5154929577464789) internal successors, (538), 355 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 538 transitions. [2021-08-25 20:36:37,584 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 538 transitions. Word has length 132 [2021-08-25 20:36:37,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:37,584 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 538 transitions. [2021-08-25 20:36:37,585 INFO L471 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) [2021-08-25 20:36:37,585 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 538 transitions. [2021-08-25 20:36:37,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-08-25 20:36:37,585 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:37,585 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:37,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-08-25 20:36:37,586 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:37,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:37,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1006654638, now seen corresponding path program 1 times [2021-08-25 20:36:37,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:37,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356905943] [2021-08-25 20:36:37,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:37,587 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:37,624 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:36:37,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:37,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356905943] [2021-08-25 20:36:37,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356905943] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:37,625 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:37,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:37,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59385612] [2021-08-25 20:36:37,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:37,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:37,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:37,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:37,626 INFO L87 Difference]: Start difference. First operand 356 states and 538 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:37,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:37,840 INFO L93 Difference]: Finished difference Result 755 states and 1150 transitions. [2021-08-25 20:36:37,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:37,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2021-08-25 20:36:37,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:37,845 INFO L225 Difference]: With dead ends: 755 [2021-08-25 20:36:37,845 INFO L226 Difference]: Without dead ends: 418 [2021-08-25 20:36:37,845 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:37,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-08-25 20:36:37,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 384. [2021-08-25 20:36:37,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 1.5326370757180157) internal successors, (587), 383 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:37,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 587 transitions. [2021-08-25 20:36:37,852 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 587 transitions. Word has length 132 [2021-08-25 20:36:37,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:37,852 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 587 transitions. [2021-08-25 20:36:37,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:37,852 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 587 transitions. [2021-08-25 20:36:37,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-08-25 20:36:37,853 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:37,853 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:37,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-08-25 20:36:37,853 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:37,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:37,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1878018703, now seen corresponding path program 1 times [2021-08-25 20:36:37,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:37,854 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503547833] [2021-08-25 20:36:37,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:37,854 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:37,899 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-25 20:36:37,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:37,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503547833] [2021-08-25 20:36:37,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503547833] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:37,899 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:37,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:37,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003962331] [2021-08-25 20:36:37,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:37,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:37,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:37,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:37,901 INFO L87 Difference]: Start difference. First operand 384 states and 587 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:38,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:38,067 INFO L93 Difference]: Finished difference Result 763 states and 1171 transitions. [2021-08-25 20:36:38,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:38,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2021-08-25 20:36:38,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:38,069 INFO L225 Difference]: With dead ends: 763 [2021-08-25 20:36:38,069 INFO L226 Difference]: Without dead ends: 398 [2021-08-25 20:36:38,069 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:38,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-08-25 20:36:38,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 384. [2021-08-25 20:36:38,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 1.5300261096605745) internal successors, (586), 383 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:38,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 586 transitions. [2021-08-25 20:36:38,076 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 586 transitions. Word has length 133 [2021-08-25 20:36:38,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:38,076 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 586 transitions. [2021-08-25 20:36:38,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:38,076 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 586 transitions. [2021-08-25 20:36:38,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-08-25 20:36:38,076 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:38,076 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:38,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-08-25 20:36:38,077 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:38,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:38,077 INFO L82 PathProgramCache]: Analyzing trace with hash 702294863, now seen corresponding path program 1 times [2021-08-25 20:36:38,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:38,077 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284549880] [2021-08-25 20:36:38,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:38,077 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:38,108 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:36:38,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:38,109 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284549880] [2021-08-25 20:36:38,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284549880] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:38,109 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:38,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:38,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400721253] [2021-08-25 20:36:38,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:38,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:38,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:38,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:38,110 INFO L87 Difference]: Start difference. First operand 384 states and 586 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:38,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:38,345 INFO L93 Difference]: Finished difference Result 847 states and 1301 transitions. [2021-08-25 20:36:38,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:38,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2021-08-25 20:36:38,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:38,346 INFO L225 Difference]: With dead ends: 847 [2021-08-25 20:36:38,346 INFO L226 Difference]: Without dead ends: 482 [2021-08-25 20:36:38,347 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:38,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-08-25 20:36:38,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 396. [2021-08-25 20:36:38,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.5265822784810126) internal successors, (603), 395 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 603 transitions. [2021-08-25 20:36:38,354 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 603 transitions. Word has length 133 [2021-08-25 20:36:38,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:38,354 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 603 transitions. [2021-08-25 20:36:38,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:38,354 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 603 transitions. [2021-08-25 20:36:38,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-08-25 20:36:38,355 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:38,355 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:38,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-08-25 20:36:38,356 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:38,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:38,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1290657638, now seen corresponding path program 1 times [2021-08-25 20:36:38,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:38,356 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294261331] [2021-08-25 20:36:38,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:38,356 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:38,391 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:36:38,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:38,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294261331] [2021-08-25 20:36:38,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294261331] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:38,392 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:38,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:38,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123643723] [2021-08-25 20:36:38,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:38,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:38,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:38,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:38,393 INFO L87 Difference]: Start difference. First operand 396 states and 603 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:38,622 INFO L93 Difference]: Finished difference Result 859 states and 1317 transitions. [2021-08-25 20:36:38,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:38,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2021-08-25 20:36:38,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:38,623 INFO L225 Difference]: With dead ends: 859 [2021-08-25 20:36:38,623 INFO L226 Difference]: Without dead ends: 482 [2021-08-25 20:36:38,623 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:38,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-08-25 20:36:38,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 397. [2021-08-25 20:36:38,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.5252525252525253) internal successors, (604), 396 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:38,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 604 transitions. [2021-08-25 20:36:38,630 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 604 transitions. Word has length 134 [2021-08-25 20:36:38,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:38,630 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 604 transitions. [2021-08-25 20:36:38,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:38,631 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 604 transitions. [2021-08-25 20:36:38,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-08-25 20:36:38,631 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:38,631 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:38,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-08-25 20:36:38,632 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:38,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:38,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1391994998, now seen corresponding path program 1 times [2021-08-25 20:36:38,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:38,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525337293] [2021-08-25 20:36:38,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:38,632 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:38,664 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:36:38,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:38,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525337293] [2021-08-25 20:36:38,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525337293] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:38,665 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:38,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:38,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800595337] [2021-08-25 20:36:38,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:38,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:38,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:38,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:38,666 INFO L87 Difference]: Start difference. First operand 397 states and 604 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) [2021-08-25 20:36:38,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:38,912 INFO L93 Difference]: Finished difference Result 860 states and 1317 transitions. [2021-08-25 20:36:38,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:38,912 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 135 [2021-08-25 20:36:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:38,913 INFO L225 Difference]: With dead ends: 860 [2021-08-25 20:36:38,913 INFO L226 Difference]: Without dead ends: 482 [2021-08-25 20:36:38,914 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:38,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-08-25 20:36:38,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 398. [2021-08-25 20:36:38,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 1.5239294710327456) internal successors, (605), 397 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:38,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 605 transitions. [2021-08-25 20:36:38,921 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 605 transitions. Word has length 135 [2021-08-25 20:36:38,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:38,921 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 605 transitions. [2021-08-25 20:36:38,922 INFO L471 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) [2021-08-25 20:36:38,922 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 605 transitions. [2021-08-25 20:36:38,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-08-25 20:36:38,922 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:38,922 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:38,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-08-25 20:36:38,923 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:38,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:38,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1898057025, now seen corresponding path program 1 times [2021-08-25 20:36:38,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:38,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302837329] [2021-08-25 20:36:38,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:38,923 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:38,957 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:36:38,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:38,957 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302837329] [2021-08-25 20:36:38,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302837329] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:38,957 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:38,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:38,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57574689] [2021-08-25 20:36:38,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:38,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:38,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:38,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:38,958 INFO L87 Difference]: Start difference. First operand 398 states and 605 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:39,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:39,193 INFO L93 Difference]: Finished difference Result 851 states and 1305 transitions. [2021-08-25 20:36:39,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:39,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 136 [2021-08-25 20:36:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:39,195 INFO L225 Difference]: With dead ends: 851 [2021-08-25 20:36:39,195 INFO L226 Difference]: Without dead ends: 472 [2021-08-25 20:36:39,195 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:39,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-08-25 20:36:39,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 399. [2021-08-25 20:36:39,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 398 states have (on average 1.5226130653266332) internal successors, (606), 398 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:39,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 606 transitions. [2021-08-25 20:36:39,203 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 606 transitions. Word has length 136 [2021-08-25 20:36:39,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:39,203 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 606 transitions. [2021-08-25 20:36:39,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:39,204 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 606 transitions. [2021-08-25 20:36:39,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-08-25 20:36:39,204 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:39,205 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2021-08-25 20:36:39,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-08-25 20:36:39,205 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:39,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:39,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1925950920, now seen corresponding path program 1 times [2021-08-25 20:36:39,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:39,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034511208] [2021-08-25 20:36:39,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:39,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:36:39,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:39,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034511208] [2021-08-25 20:36:39,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034511208] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:39,238 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:39,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:39,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776518964] [2021-08-25 20:36:39,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:39,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:39,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:39,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:39,239 INFO L87 Difference]: Start difference. First operand 399 states and 606 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) [2021-08-25 20:36:39,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:39,569 INFO L93 Difference]: Finished difference Result 862 states and 1317 transitions. [2021-08-25 20:36:39,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:39,569 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 138 [2021-08-25 20:36:39,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:39,570 INFO L225 Difference]: With dead ends: 862 [2021-08-25 20:36:39,570 INFO L226 Difference]: Without dead ends: 482 [2021-08-25 20:36:39,571 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:39,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-08-25 20:36:39,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 399. [2021-08-25 20:36:39,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 398 states have (on average 1.520100502512563) internal successors, (605), 398 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:39,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 605 transitions. [2021-08-25 20:36:39,588 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 605 transitions. Word has length 138 [2021-08-25 20:36:39,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:39,589 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 605 transitions. [2021-08-25 20:36:39,589 INFO L471 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) [2021-08-25 20:36:39,589 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 605 transitions. [2021-08-25 20:36:39,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-25 20:36:39,590 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:39,590 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2021-08-25 20:36:39,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-08-25 20:36:39,590 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:39,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:39,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1419416989, now seen corresponding path program 1 times [2021-08-25 20:36:39,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:39,591 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088098770] [2021-08-25 20:36:39,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:39,591 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:39,621 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:36:39,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:39,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088098770] [2021-08-25 20:36:39,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088098770] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:39,622 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:39,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:39,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882319131] [2021-08-25 20:36:39,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:39,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:39,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:39,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:39,623 INFO L87 Difference]: Start difference. First operand 399 states and 605 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:39,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:39,868 INFO L93 Difference]: Finished difference Result 862 states and 1315 transitions. [2021-08-25 20:36:39,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:39,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 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 139 [2021-08-25 20:36:39,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:39,870 INFO L225 Difference]: With dead ends: 862 [2021-08-25 20:36:39,870 INFO L226 Difference]: Without dead ends: 482 [2021-08-25 20:36:39,870 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:39,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-08-25 20:36:39,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 399. [2021-08-25 20:36:39,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 398 states have (on average 1.5175879396984924) internal successors, (604), 398 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:39,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 604 transitions. [2021-08-25 20:36:39,878 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 604 transitions. Word has length 139 [2021-08-25 20:36:39,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:39,878 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 604 transitions. [2021-08-25 20:36:39,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 604 transitions. [2021-08-25 20:36:39,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-08-25 20:36:39,879 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:39,879 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2021-08-25 20:36:39,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-08-25 20:36:39,880 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:39,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:39,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1695422413, now seen corresponding path program 1 times [2021-08-25 20:36:39,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:39,880 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922611304] [2021-08-25 20:36:39,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:39,880 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:39,911 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:36:39,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:39,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922611304] [2021-08-25 20:36:39,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922611304] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:39,912 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:39,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:39,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390385197] [2021-08-25 20:36:39,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:39,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:39,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:39,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:39,913 INFO L87 Difference]: Start difference. First operand 399 states and 604 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:40,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:40,195 INFO L93 Difference]: Finished difference Result 862 states and 1313 transitions. [2021-08-25 20:36:40,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:40,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 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 140 [2021-08-25 20:36:40,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:40,196 INFO L225 Difference]: With dead ends: 862 [2021-08-25 20:36:40,196 INFO L226 Difference]: Without dead ends: 482 [2021-08-25 20:36:40,197 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:40,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-08-25 20:36:40,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 399. [2021-08-25 20:36:40,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 398 states have (on average 1.515075376884422) internal successors, (603), 398 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:40,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 603 transitions. [2021-08-25 20:36:40,205 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 603 transitions. Word has length 140 [2021-08-25 20:36:40,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:40,205 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 603 transitions. [2021-08-25 20:36:40,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:40,205 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 603 transitions. [2021-08-25 20:36:40,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-08-25 20:36:40,206 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:40,206 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2021-08-25 20:36:40,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-08-25 20:36:40,207 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:40,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:40,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1081741752, now seen corresponding path program 1 times [2021-08-25 20:36:40,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:40,207 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480865963] [2021-08-25 20:36:40,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:40,207 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:36:40,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:40,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480865963] [2021-08-25 20:36:40,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480865963] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:40,239 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:40,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:40,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135276386] [2021-08-25 20:36:40,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:40,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:40,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:40,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:40,240 INFO L87 Difference]: Start difference. First operand 399 states and 603 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:40,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:40,513 INFO L93 Difference]: Finished difference Result 852 states and 1299 transitions. [2021-08-25 20:36:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:40,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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 [2021-08-25 20:36:40,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:40,515 INFO L225 Difference]: With dead ends: 852 [2021-08-25 20:36:40,515 INFO L226 Difference]: Without dead ends: 472 [2021-08-25 20:36:40,515 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:40,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-08-25 20:36:40,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 384. [2021-08-25 20:36:40,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 1.5195822454308094) internal successors, (582), 383 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 582 transitions. [2021-08-25 20:36:40,523 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 582 transitions. Word has length 141 [2021-08-25 20:36:40,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:40,524 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 582 transitions. [2021-08-25 20:36:40,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:40,524 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 582 transitions. [2021-08-25 20:36:40,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-08-25 20:36:40,524 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:40,525 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2021-08-25 20:36:40,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-08-25 20:36:40,525 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:40,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:40,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1979951990, now seen corresponding path program 1 times [2021-08-25 20:36:40,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:40,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867901943] [2021-08-25 20:36:40,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:40,526 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:40,556 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:36:40,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:40,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867901943] [2021-08-25 20:36:40,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867901943] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:40,557 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:40,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:40,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98222976] [2021-08-25 20:36:40,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:40,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:40,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:40,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:40,558 INFO L87 Difference]: Start difference. First operand 384 states and 582 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) [2021-08-25 20:36:40,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:40,787 INFO L93 Difference]: Finished difference Result 837 states and 1277 transitions. [2021-08-25 20:36:40,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:40,788 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 143 [2021-08-25 20:36:40,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:40,789 INFO L225 Difference]: With dead ends: 837 [2021-08-25 20:36:40,789 INFO L226 Difference]: Without dead ends: 472 [2021-08-25 20:36:40,789 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:40,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-08-25 20:36:40,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 412. [2021-08-25 20:36:40,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.5255474452554745) internal successors, (627), 411 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:40,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 627 transitions. [2021-08-25 20:36:40,797 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 627 transitions. Word has length 143 [2021-08-25 20:36:40,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:40,798 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 627 transitions. [2021-08-25 20:36:40,798 INFO L471 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) [2021-08-25 20:36:40,798 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 627 transitions. [2021-08-25 20:36:40,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-08-25 20:36:40,799 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:40,799 INFO L512 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:40,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-08-25 20:36:40,799 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:40,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:40,799 INFO L82 PathProgramCache]: Analyzing trace with hash 654076365, now seen corresponding path program 1 times [2021-08-25 20:36:40,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:40,800 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331697110] [2021-08-25 20:36:40,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:40,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:40,831 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:36:40,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:40,831 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331697110] [2021-08-25 20:36:40,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331697110] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:40,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:40,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:40,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46144330] [2021-08-25 20:36:40,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:40,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:40,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:40,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:40,832 INFO L87 Difference]: Start difference. First operand 412 states and 627 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) [2021-08-25 20:36:41,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:41,046 INFO L93 Difference]: Finished difference Result 857 states and 1308 transitions. [2021-08-25 20:36:41,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:41,047 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 144 [2021-08-25 20:36:41,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:41,048 INFO L225 Difference]: With dead ends: 857 [2021-08-25 20:36:41,048 INFO L226 Difference]: Without dead ends: 464 [2021-08-25 20:36:41,049 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-08-25 20:36:41,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 413. [2021-08-25 20:36:41,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.5242718446601942) internal successors, (628), 412 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:41,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 628 transitions. [2021-08-25 20:36:41,058 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 628 transitions. Word has length 144 [2021-08-25 20:36:41,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:41,058 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 628 transitions. [2021-08-25 20:36:41,058 INFO L471 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) [2021-08-25 20:36:41,058 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 628 transitions. [2021-08-25 20:36:41,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-08-25 20:36:41,059 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:41,059 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:41,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-08-25 20:36:41,059 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:41,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:41,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1369491918, now seen corresponding path program 1 times [2021-08-25 20:36:41,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:41,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247863833] [2021-08-25 20:36:41,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:41,060 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:41,096 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-08-25 20:36:41,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:41,097 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247863833] [2021-08-25 20:36:41,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247863833] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:41,097 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:41,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:41,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279855917] [2021-08-25 20:36:41,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:41,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:41,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:41,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:41,098 INFO L87 Difference]: Start difference. First operand 413 states and 628 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:41,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:41,330 INFO L93 Difference]: Finished difference Result 858 states and 1308 transitions. [2021-08-25 20:36:41,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:41,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 146 [2021-08-25 20:36:41,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:41,331 INFO L225 Difference]: With dead ends: 858 [2021-08-25 20:36:41,331 INFO L226 Difference]: Without dead ends: 464 [2021-08-25 20:36:41,332 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:41,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-08-25 20:36:41,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 413. [2021-08-25 20:36:41,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.5218446601941749) internal successors, (627), 412 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:41,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 627 transitions. [2021-08-25 20:36:41,340 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 627 transitions. Word has length 146 [2021-08-25 20:36:41,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:41,340 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 627 transitions. [2021-08-25 20:36:41,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:41,340 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 627 transitions. [2021-08-25 20:36:41,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-08-25 20:36:41,341 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:41,341 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:41,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-08-25 20:36:41,341 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:41,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:41,341 INFO L82 PathProgramCache]: Analyzing trace with hash -104548165, now seen corresponding path program 1 times [2021-08-25 20:36:41,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:41,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897754683] [2021-08-25 20:36:41,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:41,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-08-25 20:36:41,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:41,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897754683] [2021-08-25 20:36:41,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897754683] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:41,374 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:41,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:41,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119234860] [2021-08-25 20:36:41,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:41,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:41,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:41,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:41,375 INFO L87 Difference]: Start difference. First operand 413 states and 627 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) [2021-08-25 20:36:41,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:41,597 INFO L93 Difference]: Finished difference Result 856 states and 1304 transitions. [2021-08-25 20:36:41,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:41,598 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 147 [2021-08-25 20:36:41,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:41,599 INFO L225 Difference]: With dead ends: 856 [2021-08-25 20:36:41,599 INFO L226 Difference]: Without dead ends: 462 [2021-08-25 20:36:41,599 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:41,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2021-08-25 20:36:41,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 413. [2021-08-25 20:36:41,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.5194174757281553) internal successors, (626), 412 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:41,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 626 transitions. [2021-08-25 20:36:41,608 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 626 transitions. Word has length 147 [2021-08-25 20:36:41,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:41,609 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 626 transitions. [2021-08-25 20:36:41,609 INFO L471 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) [2021-08-25 20:36:41,609 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 626 transitions. [2021-08-25 20:36:41,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-08-25 20:36:41,610 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:41,610 INFO L512 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:41,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-08-25 20:36:41,610 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:41,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:41,610 INFO L82 PathProgramCache]: Analyzing trace with hash -614168594, now seen corresponding path program 1 times [2021-08-25 20:36:41,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:41,611 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458335816] [2021-08-25 20:36:41,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:41,611 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:41,655 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:36:41,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:41,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458335816] [2021-08-25 20:36:41,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458335816] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:41,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:41,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:41,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410918354] [2021-08-25 20:36:41,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:41,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:41,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:41,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:41,657 INFO L87 Difference]: Start difference. First operand 413 states and 626 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) [2021-08-25 20:36:41,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:41,862 INFO L93 Difference]: Finished difference Result 853 states and 1298 transitions. [2021-08-25 20:36:41,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:41,863 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 147 [2021-08-25 20:36:41,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:41,864 INFO L225 Difference]: With dead ends: 853 [2021-08-25 20:36:41,864 INFO L226 Difference]: Without dead ends: 459 [2021-08-25 20:36:41,864 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:41,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-08-25 20:36:41,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 416. [2021-08-25 20:36:41,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 1.5204819277108435) internal successors, (631), 415 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:41,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 631 transitions. [2021-08-25 20:36:41,873 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 631 transitions. Word has length 147 [2021-08-25 20:36:41,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:41,873 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 631 transitions. [2021-08-25 20:36:41,873 INFO L471 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) [2021-08-25 20:36:41,874 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 631 transitions. [2021-08-25 20:36:41,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-08-25 20:36:41,874 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:41,874 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:41,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-08-25 20:36:41,875 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:41,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:41,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1065566135, now seen corresponding path program 1 times [2021-08-25 20:36:41,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:41,875 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959001475] [2021-08-25 20:36:41,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:41,876 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:36:41,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:41,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959001475] [2021-08-25 20:36:41,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959001475] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:41,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:41,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:41,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800994611] [2021-08-25 20:36:41,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:41,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:41,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:41,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:41,910 INFO L87 Difference]: Start difference. First operand 416 states and 631 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) [2021-08-25 20:36:42,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:42,131 INFO L93 Difference]: Finished difference Result 847 states and 1286 transitions. [2021-08-25 20:36:42,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:42,131 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 147 [2021-08-25 20:36:42,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:42,133 INFO L225 Difference]: With dead ends: 847 [2021-08-25 20:36:42,133 INFO L226 Difference]: Without dead ends: 450 [2021-08-25 20:36:42,133 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:42,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-08-25 20:36:42,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 416. [2021-08-25 20:36:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 1.5180722891566265) internal successors, (630), 415 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:42,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 630 transitions. [2021-08-25 20:36:42,142 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 630 transitions. Word has length 147 [2021-08-25 20:36:42,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:42,142 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 630 transitions. [2021-08-25 20:36:42,142 INFO L471 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) [2021-08-25 20:36:42,142 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 630 transitions. [2021-08-25 20:36:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-08-25 20:36:42,143 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:42,143 INFO L512 BasicCegarLoop]: 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, 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] [2021-08-25 20:36:42,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-08-25 20:36:42,143 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:42,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:42,144 INFO L82 PathProgramCache]: Analyzing trace with hash 34276127, now seen corresponding path program 1 times [2021-08-25 20:36:42,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:42,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077204599] [2021-08-25 20:36:42,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:42,144 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:42,179 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:36:42,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:42,179 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077204599] [2021-08-25 20:36:42,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077204599] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:42,179 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:42,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:42,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253391376] [2021-08-25 20:36:42,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:42,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:42,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:42,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:42,180 INFO L87 Difference]: Start difference. First operand 416 states and 630 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:42,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:42,425 INFO L93 Difference]: Finished difference Result 869 states and 1319 transitions. [2021-08-25 20:36:42,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:42,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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 [2021-08-25 20:36:42,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:42,427 INFO L225 Difference]: With dead ends: 869 [2021-08-25 20:36:42,427 INFO L226 Difference]: Without dead ends: 472 [2021-08-25 20:36:42,428 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:42,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-08-25 20:36:42,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 416. [2021-08-25 20:36:42,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 1.5156626506024096) internal successors, (629), 415 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:42,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 629 transitions. [2021-08-25 20:36:42,437 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 629 transitions. Word has length 148 [2021-08-25 20:36:42,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:42,437 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 629 transitions. [2021-08-25 20:36:42,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:42,438 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 629 transitions. [2021-08-25 20:36:42,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-08-25 20:36:42,438 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:42,439 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:42,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-08-25 20:36:42,439 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:42,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:42,439 INFO L82 PathProgramCache]: Analyzing trace with hash -332834818, now seen corresponding path program 1 times [2021-08-25 20:36:42,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:42,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434888681] [2021-08-25 20:36:42,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:42,440 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:42,471 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:36:42,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:42,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434888681] [2021-08-25 20:36:42,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434888681] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:42,472 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:42,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:42,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363361071] [2021-08-25 20:36:42,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:42,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:42,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:42,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:42,473 INFO L87 Difference]: Start difference. First operand 416 states and 629 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) [2021-08-25 20:36:42,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:42,706 INFO L93 Difference]: Finished difference Result 847 states and 1282 transitions. [2021-08-25 20:36:42,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:42,706 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 148 [2021-08-25 20:36:42,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:42,707 INFO L225 Difference]: With dead ends: 847 [2021-08-25 20:36:42,707 INFO L226 Difference]: Without dead ends: 450 [2021-08-25 20:36:42,708 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:42,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-08-25 20:36:42,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 416. [2021-08-25 20:36:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 1.5132530120481928) internal successors, (628), 415 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:42,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 628 transitions. [2021-08-25 20:36:42,717 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 628 transitions. Word has length 148 [2021-08-25 20:36:42,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:42,717 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 628 transitions. [2021-08-25 20:36:42,717 INFO L471 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) [2021-08-25 20:36:42,717 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 628 transitions. [2021-08-25 20:36:42,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-08-25 20:36:42,718 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:42,718 INFO L512 BasicCegarLoop]: 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, 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] [2021-08-25 20:36:42,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-08-25 20:36:42,718 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:42,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:42,719 INFO L82 PathProgramCache]: Analyzing trace with hash 467666756, now seen corresponding path program 1 times [2021-08-25 20:36:42,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:42,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179319159] [2021-08-25 20:36:42,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:42,719 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:42,750 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:36:42,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:42,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179319159] [2021-08-25 20:36:42,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179319159] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:42,751 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:42,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:42,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315729942] [2021-08-25 20:36:42,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:42,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:42,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:42,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:42,752 INFO L87 Difference]: Start difference. First operand 416 states and 628 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:42,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:42,979 INFO L93 Difference]: Finished difference Result 861 states and 1302 transitions. [2021-08-25 20:36:42,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:42,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 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 [2021-08-25 20:36:42,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:42,981 INFO L225 Difference]: With dead ends: 861 [2021-08-25 20:36:42,981 INFO L226 Difference]: Without dead ends: 464 [2021-08-25 20:36:42,981 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:42,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-08-25 20:36:42,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 416. [2021-08-25 20:36:42,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 1.510843373493976) internal successors, (627), 415 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:42,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 627 transitions. [2021-08-25 20:36:42,990 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 627 transitions. Word has length 149 [2021-08-25 20:36:42,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:42,991 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 627 transitions. [2021-08-25 20:36:42,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:42,991 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 627 transitions. [2021-08-25 20:36:42,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-08-25 20:36:42,991 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:42,991 INFO L512 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:42,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-08-25 20:36:42,992 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:42,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:42,992 INFO L82 PathProgramCache]: Analyzing trace with hash -456214673, now seen corresponding path program 1 times [2021-08-25 20:36:42,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:42,992 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388375074] [2021-08-25 20:36:42,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:42,992 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:36:43,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:43,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388375074] [2021-08-25 20:36:43,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388375074] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:43,023 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:43,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:43,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117363489] [2021-08-25 20:36:43,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:43,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:43,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:43,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:43,024 INFO L87 Difference]: Start difference. First operand 416 states and 627 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) [2021-08-25 20:36:43,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:43,232 INFO L93 Difference]: Finished difference Result 856 states and 1294 transitions. [2021-08-25 20:36:43,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:43,237 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 149 [2021-08-25 20:36:43,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:43,238 INFO L225 Difference]: With dead ends: 856 [2021-08-25 20:36:43,238 INFO L226 Difference]: Without dead ends: 459 [2021-08-25 20:36:43,239 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:43,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-08-25 20:36:43,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 417. [2021-08-25 20:36:43,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 1.5096153846153846) internal successors, (628), 416 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:43,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 628 transitions. [2021-08-25 20:36:43,248 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 628 transitions. Word has length 149 [2021-08-25 20:36:43,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:43,249 INFO L470 AbstractCegarLoop]: Abstraction has 417 states and 628 transitions. [2021-08-25 20:36:43,249 INFO L471 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) [2021-08-25 20:36:43,249 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 628 transitions. [2021-08-25 20:36:43,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-08-25 20:36:43,249 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:43,249 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:43,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-08-25 20:36:43,250 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:43,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:43,250 INFO L82 PathProgramCache]: Analyzing trace with hash -180653582, now seen corresponding path program 1 times [2021-08-25 20:36:43,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:43,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238208235] [2021-08-25 20:36:43,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:43,250 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:43,284 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:36:43,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:43,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238208235] [2021-08-25 20:36:43,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238208235] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:43,284 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:43,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:43,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865309910] [2021-08-25 20:36:43,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:43,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:43,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:43,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:43,285 INFO L87 Difference]: Start difference. First operand 417 states and 628 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) [2021-08-25 20:36:43,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:43,505 INFO L93 Difference]: Finished difference Result 849 states and 1280 transitions. [2021-08-25 20:36:43,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:43,506 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 149 [2021-08-25 20:36:43,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:43,507 INFO L225 Difference]: With dead ends: 849 [2021-08-25 20:36:43,507 INFO L226 Difference]: Without dead ends: 451 [2021-08-25 20:36:43,507 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:43,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-08-25 20:36:43,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 417. [2021-08-25 20:36:43,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 1.5072115384615385) internal successors, (627), 416 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:43,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 627 transitions. [2021-08-25 20:36:43,517 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 627 transitions. Word has length 149 [2021-08-25 20:36:43,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:43,517 INFO L470 AbstractCegarLoop]: Abstraction has 417 states and 627 transitions. [2021-08-25 20:36:43,517 INFO L471 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) [2021-08-25 20:36:43,517 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 627 transitions. [2021-08-25 20:36:43,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-08-25 20:36:43,518 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:43,518 INFO L512 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:43,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-08-25 20:36:43,519 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:43,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:43,520 INFO L82 PathProgramCache]: Analyzing trace with hash 247505163, now seen corresponding path program 1 times [2021-08-25 20:36:43,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:43,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243066726] [2021-08-25 20:36:43,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:43,520 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:36:43,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:43,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243066726] [2021-08-25 20:36:43,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243066726] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:43,558 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:43,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:43,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504833363] [2021-08-25 20:36:43,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:43,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:43,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:43,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:43,559 INFO L87 Difference]: Start difference. First operand 417 states and 627 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) [2021-08-25 20:36:43,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:43,778 INFO L93 Difference]: Finished difference Result 853 states and 1287 transitions. [2021-08-25 20:36:43,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:43,778 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 150 [2021-08-25 20:36:43,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:43,779 INFO L225 Difference]: With dead ends: 853 [2021-08-25 20:36:43,779 INFO L226 Difference]: Without dead ends: 455 [2021-08-25 20:36:43,779 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:43,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2021-08-25 20:36:43,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 418. [2021-08-25 20:36:43,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.5059952038369304) internal successors, (628), 417 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:43,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 628 transitions. [2021-08-25 20:36:43,790 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 628 transitions. Word has length 150 [2021-08-25 20:36:43,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:43,790 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 628 transitions. [2021-08-25 20:36:43,790 INFO L471 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) [2021-08-25 20:36:43,790 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 628 transitions. [2021-08-25 20:36:43,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-08-25 20:36:43,791 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:43,791 INFO L512 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:43,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-08-25 20:36:43,791 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:43,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:43,791 INFO L82 PathProgramCache]: Analyzing trace with hash 768864125, now seen corresponding path program 1 times [2021-08-25 20:36:43,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:43,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178053173] [2021-08-25 20:36:43,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:43,792 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:43,822 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:36:43,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:43,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178053173] [2021-08-25 20:36:43,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178053173] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:43,823 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:43,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:43,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112229084] [2021-08-25 20:36:43,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:43,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:43,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:43,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:43,824 INFO L87 Difference]: Start difference. First operand 418 states and 628 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) [2021-08-25 20:36:44,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:44,041 INFO L93 Difference]: Finished difference Result 854 states and 1287 transitions. [2021-08-25 20:36:44,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:44,041 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 150 [2021-08-25 20:36:44,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:44,042 INFO L225 Difference]: With dead ends: 854 [2021-08-25 20:36:44,042 INFO L226 Difference]: Without dead ends: 455 [2021-08-25 20:36:44,042 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:44,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2021-08-25 20:36:44,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 419. [2021-08-25 20:36:44,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 418 states have (on average 1.5047846889952152) internal successors, (629), 418 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:44,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 629 transitions. [2021-08-25 20:36:44,052 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 629 transitions. Word has length 150 [2021-08-25 20:36:44,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:44,053 INFO L470 AbstractCegarLoop]: Abstraction has 419 states and 629 transitions. [2021-08-25 20:36:44,053 INFO L471 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) [2021-08-25 20:36:44,053 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 629 transitions. [2021-08-25 20:36:44,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-08-25 20:36:44,053 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:44,053 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:44,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-08-25 20:36:44,054 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:44,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:44,054 INFO L82 PathProgramCache]: Analyzing trace with hash 794935257, now seen corresponding path program 1 times [2021-08-25 20:36:44,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:44,054 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581695794] [2021-08-25 20:36:44,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:44,054 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:36:44,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:44,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581695794] [2021-08-25 20:36:44,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581695794] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:44,087 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:44,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:44,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075930928] [2021-08-25 20:36:44,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:44,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:44,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:44,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:44,088 INFO L87 Difference]: Start difference. First operand 419 states and 629 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) [2021-08-25 20:36:44,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:44,332 INFO L93 Difference]: Finished difference Result 843 states and 1270 transitions. [2021-08-25 20:36:44,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:44,332 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 150 [2021-08-25 20:36:44,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:44,333 INFO L225 Difference]: With dead ends: 843 [2021-08-25 20:36:44,333 INFO L226 Difference]: Without dead ends: 443 [2021-08-25 20:36:44,333 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:44,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-08-25 20:36:44,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 419. [2021-08-25 20:36:44,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 418 states have (on average 1.5023923444976077) internal successors, (628), 418 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:44,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 628 transitions. [2021-08-25 20:36:44,345 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 628 transitions. Word has length 150 [2021-08-25 20:36:44,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:44,346 INFO L470 AbstractCegarLoop]: Abstraction has 419 states and 628 transitions. [2021-08-25 20:36:44,346 INFO L471 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) [2021-08-25 20:36:44,346 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 628 transitions. [2021-08-25 20:36:44,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-08-25 20:36:44,347 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:44,347 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:44,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-08-25 20:36:44,347 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:44,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:44,347 INFO L82 PathProgramCache]: Analyzing trace with hash -120499735, now seen corresponding path program 1 times [2021-08-25 20:36:44,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:44,348 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175351086] [2021-08-25 20:36:44,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:44,348 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:44,378 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-25 20:36:44,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:44,379 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175351086] [2021-08-25 20:36:44,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175351086] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:44,379 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:44,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:44,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593172125] [2021-08-25 20:36:44,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:44,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:44,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:44,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:44,380 INFO L87 Difference]: Start difference. First operand 419 states and 628 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:44,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:44,621 INFO L93 Difference]: Finished difference Result 864 states and 1296 transitions. [2021-08-25 20:36:44,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:44,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 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 151 [2021-08-25 20:36:44,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:44,623 INFO L225 Difference]: With dead ends: 864 [2021-08-25 20:36:44,623 INFO L226 Difference]: Without dead ends: 464 [2021-08-25 20:36:44,625 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:44,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-08-25 20:36:44,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 419. [2021-08-25 20:36:44,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 418 states have (on average 1.5) internal successors, (627), 418 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:44,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 627 transitions. [2021-08-25 20:36:44,636 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 627 transitions. Word has length 151 [2021-08-25 20:36:44,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:44,636 INFO L470 AbstractCegarLoop]: Abstraction has 419 states and 627 transitions. [2021-08-25 20:36:44,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:44,636 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 627 transitions. [2021-08-25 20:36:44,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-08-25 20:36:44,637 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:44,637 INFO L512 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:44,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-08-25 20:36:44,637 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:44,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:44,637 INFO L82 PathProgramCache]: Analyzing trace with hash -513774399, now seen corresponding path program 1 times [2021-08-25 20:36:44,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:44,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828854619] [2021-08-25 20:36:44,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:44,637 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:44,668 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:36:44,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:44,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828854619] [2021-08-25 20:36:44,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828854619] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:44,669 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:44,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:44,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956416047] [2021-08-25 20:36:44,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:44,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:44,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:44,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:44,670 INFO L87 Difference]: Start difference. First operand 419 states and 627 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:44,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:44,881 INFO L93 Difference]: Finished difference Result 853 states and 1281 transitions. [2021-08-25 20:36:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:44,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 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 151 [2021-08-25 20:36:44,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:44,882 INFO L225 Difference]: With dead ends: 853 [2021-08-25 20:36:44,882 INFO L226 Difference]: Without dead ends: 453 [2021-08-25 20:36:44,883 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:44,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-08-25 20:36:44,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 420. [2021-08-25 20:36:44,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.4988066825775657) internal successors, (628), 419 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:44,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 628 transitions. [2021-08-25 20:36:44,893 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 628 transitions. Word has length 151 [2021-08-25 20:36:44,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:44,894 INFO L470 AbstractCegarLoop]: Abstraction has 420 states and 628 transitions. [2021-08-25 20:36:44,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:44,894 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 628 transitions. [2021-08-25 20:36:44,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-08-25 20:36:44,894 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:44,894 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:44,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-08-25 20:36:44,894 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:44,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:44,895 INFO L82 PathProgramCache]: Analyzing trace with hash -40496156, now seen corresponding path program 1 times [2021-08-25 20:36:44,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:44,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843038745] [2021-08-25 20:36:44,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:44,895 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:44,928 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-25 20:36:44,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:44,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843038745] [2021-08-25 20:36:44,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843038745] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:44,928 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:44,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:44,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957165899] [2021-08-25 20:36:44,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:44,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:44,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:44,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:44,929 INFO L87 Difference]: Start difference. First operand 420 states and 628 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:45,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:45,181 INFO L93 Difference]: Finished difference Result 863 states and 1292 transitions. [2021-08-25 20:36:45,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:45,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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 [2021-08-25 20:36:45,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:45,182 INFO L225 Difference]: With dead ends: 863 [2021-08-25 20:36:45,182 INFO L226 Difference]: Without dead ends: 462 [2021-08-25 20:36:45,182 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:45,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2021-08-25 20:36:45,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 420. [2021-08-25 20:36:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.496420047732697) internal successors, (627), 419 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:45,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 627 transitions. [2021-08-25 20:36:45,193 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 627 transitions. Word has length 152 [2021-08-25 20:36:45,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:45,193 INFO L470 AbstractCegarLoop]: Abstraction has 420 states and 627 transitions. [2021-08-25 20:36:45,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:45,193 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 627 transitions. [2021-08-25 20:36:45,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-08-25 20:36:45,194 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:45,194 INFO L512 BasicCegarLoop]: 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, 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] [2021-08-25 20:36:45,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-08-25 20:36:45,194 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:45,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:45,195 INFO L82 PathProgramCache]: Analyzing trace with hash -550116585, now seen corresponding path program 1 times [2021-08-25 20:36:45,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:45,195 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342134441] [2021-08-25 20:36:45,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:45,195 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:45,226 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:36:45,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:45,226 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342134441] [2021-08-25 20:36:45,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342134441] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:45,226 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:45,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:45,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098211864] [2021-08-25 20:36:45,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:45,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:45,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:45,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:45,227 INFO L87 Difference]: Start difference. First operand 420 states and 627 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:45,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:45,459 INFO L93 Difference]: Finished difference Result 860 states and 1286 transitions. [2021-08-25 20:36:45,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:45,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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 [2021-08-25 20:36:45,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:45,460 INFO L225 Difference]: With dead ends: 860 [2021-08-25 20:36:45,461 INFO L226 Difference]: Without dead ends: 459 [2021-08-25 20:36:45,461 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:45,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-08-25 20:36:45,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 420. [2021-08-25 20:36:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.494033412887828) internal successors, (626), 419 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:45,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 626 transitions. [2021-08-25 20:36:45,472 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 626 transitions. Word has length 152 [2021-08-25 20:36:45,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:45,473 INFO L470 AbstractCegarLoop]: Abstraction has 420 states and 626 transitions. [2021-08-25 20:36:45,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:45,473 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 626 transitions. [2021-08-25 20:36:45,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-08-25 20:36:45,474 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:45,474 INFO L512 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:45,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-08-25 20:36:45,474 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:45,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:45,474 INFO L82 PathProgramCache]: Analyzing trace with hash -24091464, now seen corresponding path program 1 times [2021-08-25 20:36:45,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:45,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003215406] [2021-08-25 20:36:45,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:45,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:45,506 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:36:45,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:45,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003215406] [2021-08-25 20:36:45,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003215406] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:45,506 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:45,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:45,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535663005] [2021-08-25 20:36:45,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:45,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:45,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:45,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:45,507 INFO L87 Difference]: Start difference. First operand 420 states and 626 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:45,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:45,722 INFO L93 Difference]: Finished difference Result 854 states and 1277 transitions. [2021-08-25 20:36:45,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:45,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 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 152 [2021-08-25 20:36:45,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:45,723 INFO L225 Difference]: With dead ends: 854 [2021-08-25 20:36:45,723 INFO L226 Difference]: Without dead ends: 453 [2021-08-25 20:36:45,723 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:45,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-08-25 20:36:45,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 421. [2021-08-25 20:36:45,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.4928571428571429) internal successors, (627), 420 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:45,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 627 transitions. [2021-08-25 20:36:45,735 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 627 transitions. Word has length 152 [2021-08-25 20:36:45,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:45,735 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 627 transitions. [2021-08-25 20:36:45,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:45,736 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 627 transitions. [2021-08-25 20:36:45,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-08-25 20:36:45,736 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:45,736 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:45,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-08-25 20:36:45,737 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:45,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:45,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1607216036, now seen corresponding path program 1 times [2021-08-25 20:36:45,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:45,737 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006522615] [2021-08-25 20:36:45,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:45,737 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:45,768 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:36:45,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:45,769 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006522615] [2021-08-25 20:36:45,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006522615] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:45,769 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:45,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:45,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382835100] [2021-08-25 20:36:45,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:45,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:45,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:45,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:45,770 INFO L87 Difference]: Start difference. First operand 421 states and 627 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:45,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:45,985 INFO L93 Difference]: Finished difference Result 853 states and 1275 transitions. [2021-08-25 20:36:45,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:45,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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 [2021-08-25 20:36:45,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:45,986 INFO L225 Difference]: With dead ends: 853 [2021-08-25 20:36:45,986 INFO L226 Difference]: Without dead ends: 451 [2021-08-25 20:36:45,986 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:45,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-08-25 20:36:45,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 422. [2021-08-25 20:36:45,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 1.491686460807601) internal successors, (628), 421 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:45,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 628 transitions. [2021-08-25 20:36:45,997 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 628 transitions. Word has length 153 [2021-08-25 20:36:45,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:45,998 INFO L470 AbstractCegarLoop]: Abstraction has 422 states and 628 transitions. [2021-08-25 20:36:45,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:45,998 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 628 transitions. [2021-08-25 20:36:45,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-08-25 20:36:45,998 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:45,999 INFO L512 BasicCegarLoop]: 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:45,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-08-25 20:36:45,999 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:45,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:45,999 INFO L82 PathProgramCache]: Analyzing trace with hash 968223832, now seen corresponding path program 1 times [2021-08-25 20:36:45,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:45,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735643342] [2021-08-25 20:36:45,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:46,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:46,030 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:36:46,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:46,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735643342] [2021-08-25 20:36:46,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735643342] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:46,031 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:46,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:46,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060410619] [2021-08-25 20:36:46,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:46,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:46,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:46,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:46,032 INFO L87 Difference]: Start difference. First operand 422 states and 628 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) [2021-08-25 20:36:46,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:46,244 INFO L93 Difference]: Finished difference Result 862 states and 1284 transitions. [2021-08-25 20:36:46,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:46,244 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 154 [2021-08-25 20:36:46,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:46,245 INFO L225 Difference]: With dead ends: 862 [2021-08-25 20:36:46,245 INFO L226 Difference]: Without dead ends: 459 [2021-08-25 20:36:46,245 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:46,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-08-25 20:36:46,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 422. [2021-08-25 20:36:46,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 1.489311163895487) internal successors, (627), 421 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:46,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 627 transitions. [2021-08-25 20:36:46,257 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 627 transitions. Word has length 154 [2021-08-25 20:36:46,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:46,257 INFO L470 AbstractCegarLoop]: Abstraction has 422 states and 627 transitions. [2021-08-25 20:36:46,257 INFO L471 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) [2021-08-25 20:36:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 627 transitions. [2021-08-25 20:36:46,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-08-25 20:36:46,257 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:46,257 INFO L512 BasicCegarLoop]: 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:46,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-08-25 20:36:46,258 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:46,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:46,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1455425858, now seen corresponding path program 1 times [2021-08-25 20:36:46,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:46,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209750534] [2021-08-25 20:36:46,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:46,258 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:36:46,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:46,289 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209750534] [2021-08-25 20:36:46,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209750534] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:46,290 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:46,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:46,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952737423] [2021-08-25 20:36:46,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:46,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:46,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:46,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:46,291 INFO L87 Difference]: Start difference. First operand 422 states and 627 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:46,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:46,511 INFO L93 Difference]: Finished difference Result 858 states and 1277 transitions. [2021-08-25 20:36:46,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:46,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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 155 [2021-08-25 20:36:46,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:46,512 INFO L225 Difference]: With dead ends: 858 [2021-08-25 20:36:46,512 INFO L226 Difference]: Without dead ends: 455 [2021-08-25 20:36:46,512 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:46,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2021-08-25 20:36:46,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 422. [2021-08-25 20:36:46,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 1.486935866983373) internal successors, (626), 421 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 626 transitions. [2021-08-25 20:36:46,529 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 626 transitions. Word has length 155 [2021-08-25 20:36:46,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:46,529 INFO L470 AbstractCegarLoop]: Abstraction has 422 states and 626 transitions. [2021-08-25 20:36:46,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:46,530 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 626 transitions. [2021-08-25 20:36:46,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-08-25 20:36:46,530 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:46,531 INFO L512 BasicCegarLoop]: 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, 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] [2021-08-25 20:36:46,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-08-25 20:36:46,531 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:46,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:46,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1976784820, now seen corresponding path program 1 times [2021-08-25 20:36:46,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:46,531 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029709891] [2021-08-25 20:36:46,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:46,532 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:46,562 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:36:46,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:46,563 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029709891] [2021-08-25 20:36:46,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029709891] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:46,563 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:46,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:46,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334384986] [2021-08-25 20:36:46,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:46,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:46,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:46,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:46,564 INFO L87 Difference]: Start difference. First operand 422 states and 626 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:46,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:46,792 INFO L93 Difference]: Finished difference Result 858 states and 1275 transitions. [2021-08-25 20:36:46,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:46,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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 155 [2021-08-25 20:36:46,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:46,793 INFO L225 Difference]: With dead ends: 858 [2021-08-25 20:36:46,793 INFO L226 Difference]: Without dead ends: 455 [2021-08-25 20:36:46,793 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:46,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2021-08-25 20:36:46,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 422. [2021-08-25 20:36:46,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 1.484560570071259) internal successors, (625), 421 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:46,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 625 transitions. [2021-08-25 20:36:46,805 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 625 transitions. Word has length 155 [2021-08-25 20:36:46,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:46,806 INFO L470 AbstractCegarLoop]: Abstraction has 422 states and 625 transitions. [2021-08-25 20:36:46,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:46,806 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 625 transitions. [2021-08-25 20:36:46,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-08-25 20:36:46,807 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:46,807 INFO L512 BasicCegarLoop]: 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, 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] [2021-08-25 20:36:46,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-08-25 20:36:46,807 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:46,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:46,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1722938518, now seen corresponding path program 1 times [2021-08-25 20:36:46,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:46,808 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620212404] [2021-08-25 20:36:46,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:46,808 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:36:46,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:46,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620212404] [2021-08-25 20:36:46,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620212404] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:46,839 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:46,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:46,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962550611] [2021-08-25 20:36:46,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:46,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:46,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:46,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:46,840 INFO L87 Difference]: Start difference. First operand 422 states and 625 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:47,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:47,054 INFO L93 Difference]: Finished difference Result 856 states and 1271 transitions. [2021-08-25 20:36:47,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:47,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 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 [2021-08-25 20:36:47,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:47,056 INFO L225 Difference]: With dead ends: 856 [2021-08-25 20:36:47,056 INFO L226 Difference]: Without dead ends: 453 [2021-08-25 20:36:47,056 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:47,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-08-25 20:36:47,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 422. [2021-08-25 20:36:47,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 1.482185273159145) internal successors, (624), 421 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:47,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 624 transitions. [2021-08-25 20:36:47,069 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 624 transitions. Word has length 156 [2021-08-25 20:36:47,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:47,069 INFO L470 AbstractCegarLoop]: Abstraction has 422 states and 624 transitions. [2021-08-25 20:36:47,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:47,069 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 624 transitions. [2021-08-25 20:36:47,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-08-25 20:36:47,070 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:47,070 INFO L512 BasicCegarLoop]: 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, 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] [2021-08-25 20:36:47,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-08-25 20:36:47,070 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:47,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:47,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1146526511, now seen corresponding path program 1 times [2021-08-25 20:36:47,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:47,071 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184894021] [2021-08-25 20:36:47,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:47,071 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:47,117 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:36:47,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:47,117 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184894021] [2021-08-25 20:36:47,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184894021] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:47,118 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:47,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:47,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894439534] [2021-08-25 20:36:47,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:47,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:47,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:47,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:47,119 INFO L87 Difference]: Start difference. First operand 422 states and 624 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:47,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:47,348 INFO L93 Difference]: Finished difference Result 856 states and 1269 transitions. [2021-08-25 20:36:47,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:47,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 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 157 [2021-08-25 20:36:47,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:47,349 INFO L225 Difference]: With dead ends: 856 [2021-08-25 20:36:47,349 INFO L226 Difference]: Without dead ends: 453 [2021-08-25 20:36:47,350 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:47,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-08-25 20:36:47,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 422. [2021-08-25 20:36:47,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 1.479809976247031) internal successors, (623), 421 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:47,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 623 transitions. [2021-08-25 20:36:47,362 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 623 transitions. Word has length 157 [2021-08-25 20:36:47,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:47,362 INFO L470 AbstractCegarLoop]: Abstraction has 422 states and 623 transitions. [2021-08-25 20:36:47,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:47,362 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 623 transitions. [2021-08-25 20:36:47,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-08-25 20:36:47,363 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:47,363 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:47,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2021-08-25 20:36:47,363 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:47,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:47,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1103781342, now seen corresponding path program 1 times [2021-08-25 20:36:47,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:47,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012615325] [2021-08-25 20:36:47,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:47,363 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:36:47,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:47,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012615325] [2021-08-25 20:36:47,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012615325] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:47,396 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:47,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:47,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703093867] [2021-08-25 20:36:47,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:47,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:47,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:47,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:47,397 INFO L87 Difference]: Start difference. First operand 422 states and 623 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:47,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:47,625 INFO L93 Difference]: Finished difference Result 891 states and 1326 transitions. [2021-08-25 20:36:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:47,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2021-08-25 20:36:47,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:47,626 INFO L225 Difference]: With dead ends: 891 [2021-08-25 20:36:47,626 INFO L226 Difference]: Without dead ends: 488 [2021-08-25 20:36:47,626 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:47,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2021-08-25 20:36:47,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 452. [2021-08-25 20:36:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 1.498891352549889) internal successors, (676), 451 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:47,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 676 transitions. [2021-08-25 20:36:47,639 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 676 transitions. Word has length 157 [2021-08-25 20:36:47,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:47,639 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 676 transitions. [2021-08-25 20:36:47,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 676 transitions. [2021-08-25 20:36:47,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-08-25 20:36:47,640 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:47,640 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:47,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-08-25 20:36:47,640 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:47,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:47,641 INFO L82 PathProgramCache]: Analyzing trace with hash 322202821, now seen corresponding path program 1 times [2021-08-25 20:36:47,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:47,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924972023] [2021-08-25 20:36:47,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:47,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:36:47,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:47,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924972023] [2021-08-25 20:36:47,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924972023] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:47,688 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:47,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:47,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658368273] [2021-08-25 20:36:47,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:47,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:47,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:47,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:47,689 INFO L87 Difference]: Start difference. First operand 452 states and 676 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:47,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:47,893 INFO L93 Difference]: Finished difference Result 914 states and 1371 transitions. [2021-08-25 20:36:47,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:47,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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 158 [2021-08-25 20:36:47,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:47,894 INFO L225 Difference]: With dead ends: 914 [2021-08-25 20:36:47,894 INFO L226 Difference]: Without dead ends: 481 [2021-08-25 20:36:47,895 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:47,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-08-25 20:36:47,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 414. [2021-08-25 20:36:47,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 1.5012106537530265) internal successors, (620), 413 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:47,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 620 transitions. [2021-08-25 20:36:47,907 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 620 transitions. Word has length 158 [2021-08-25 20:36:47,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:47,907 INFO L470 AbstractCegarLoop]: Abstraction has 414 states and 620 transitions. [2021-08-25 20:36:47,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:47,907 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 620 transitions. [2021-08-25 20:36:47,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-08-25 20:36:47,908 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:47,908 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:47,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-08-25 20:36:47,908 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:47,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:47,909 INFO L82 PathProgramCache]: Analyzing trace with hash 942215189, now seen corresponding path program 1 times [2021-08-25 20:36:47,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:47,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136900800] [2021-08-25 20:36:47,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:47,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:47,939 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-08-25 20:36:47,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:47,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136900800] [2021-08-25 20:36:47,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136900800] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:47,939 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:47,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:47,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271580259] [2021-08-25 20:36:47,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:47,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:47,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:47,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:47,940 INFO L87 Difference]: Start difference. First operand 414 states and 620 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:48,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:48,145 INFO L93 Difference]: Finished difference Result 876 states and 1314 transitions. [2021-08-25 20:36:48,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:48,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 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 160 [2021-08-25 20:36:48,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:48,146 INFO L225 Difference]: With dead ends: 876 [2021-08-25 20:36:48,146 INFO L226 Difference]: Without dead ends: 481 [2021-08-25 20:36:48,147 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:48,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-08-25 20:36:48,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 444. [2021-08-25 20:36:48,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 1.5011286681715577) internal successors, (665), 443 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:48,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 665 transitions. [2021-08-25 20:36:48,159 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 665 transitions. Word has length 160 [2021-08-25 20:36:48,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:48,159 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 665 transitions. [2021-08-25 20:36:48,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:48,159 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 665 transitions. [2021-08-25 20:36:48,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-08-25 20:36:48,160 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:48,160 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:48,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-08-25 20:36:48,160 INFO L402 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:48,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:48,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1441958602, now seen corresponding path program 1 times [2021-08-25 20:36:48,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:48,161 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974629904] [2021-08-25 20:36:48,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:48,161 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:48,198 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-08-25 20:36:48,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:48,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974629904] [2021-08-25 20:36:48,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974629904] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:48,198 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:48,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:48,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097921333] [2021-08-25 20:36:48,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:48,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:48,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:48,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:48,199 INFO L87 Difference]: Start difference. First operand 444 states and 665 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) [2021-08-25 20:36:48,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:48,428 INFO L93 Difference]: Finished difference Result 893 states and 1342 transitions. [2021-08-25 20:36:48,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:48,429 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 160 [2021-08-25 20:36:48,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:48,429 INFO L225 Difference]: With dead ends: 893 [2021-08-25 20:36:48,429 INFO L226 Difference]: Without dead ends: 468 [2021-08-25 20:36:48,430 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:48,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-08-25 20:36:48,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 444. [2021-08-25 20:36:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 1.4988713318284423) internal successors, (664), 443 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:48,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 664 transitions. [2021-08-25 20:36:48,443 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 664 transitions. Word has length 160 [2021-08-25 20:36:48,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:48,443 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 664 transitions. [2021-08-25 20:36:48,443 INFO L471 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) [2021-08-25 20:36:48,443 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 664 transitions. [2021-08-25 20:36:48,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-08-25 20:36:48,444 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:48,444 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 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, 1] [2021-08-25 20:36:48,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-08-25 20:36:48,444 INFO L402 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:48,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:48,444 INFO L82 PathProgramCache]: Analyzing trace with hash 639470398, now seen corresponding path program 1 times [2021-08-25 20:36:48,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:48,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009083562] [2021-08-25 20:36:48,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:48,445 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:48,475 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-08-25 20:36:48,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:48,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009083562] [2021-08-25 20:36:48,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009083562] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:48,476 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:48,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:48,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631476209] [2021-08-25 20:36:48,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:48,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:48,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:48,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:48,477 INFO L87 Difference]: Start difference. First operand 444 states and 664 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) [2021-08-25 20:36:48,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:48,700 INFO L93 Difference]: Finished difference Result 904 states and 1354 transitions. [2021-08-25 20:36:48,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:48,700 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 161 [2021-08-25 20:36:48,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:48,701 INFO L225 Difference]: With dead ends: 904 [2021-08-25 20:36:48,701 INFO L226 Difference]: Without dead ends: 479 [2021-08-25 20:36:48,701 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:48,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-08-25 20:36:48,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 445. [2021-08-25 20:36:48,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 1.4977477477477477) internal successors, (665), 444 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:48,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 665 transitions. [2021-08-25 20:36:48,715 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 665 transitions. Word has length 161 [2021-08-25 20:36:48,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:48,715 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 665 transitions. [2021-08-25 20:36:48,715 INFO L471 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) [2021-08-25 20:36:48,715 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 665 transitions. [2021-08-25 20:36:48,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-08-25 20:36:48,716 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:48,716 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:48,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-08-25 20:36:48,716 INFO L402 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:48,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:48,716 INFO L82 PathProgramCache]: Analyzing trace with hash 9508236, now seen corresponding path program 1 times [2021-08-25 20:36:48,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:48,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562988850] [2021-08-25 20:36:48,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:48,716 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:48,743 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-08-25 20:36:48,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:48,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562988850] [2021-08-25 20:36:48,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562988850] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:48,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:48,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:36:48,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243996080] [2021-08-25 20:36:48,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:36:48,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:48,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:36:48,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:36:48,744 INFO L87 Difference]: Start difference. First operand 445 states and 665 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:48,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:48,808 INFO L93 Difference]: Finished difference Result 1257 states and 1890 transitions. [2021-08-25 20:36:48,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:36:48,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 [2021-08-25 20:36:48,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:48,809 INFO L225 Difference]: With dead ends: 1257 [2021-08-25 20:36:48,809 INFO L226 Difference]: Without dead ends: 831 [2021-08-25 20:36:48,810 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:36:48,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2021-08-25 20:36:48,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 829. [2021-08-25 20:36:48,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 828 states have (on average 1.4927536231884058) internal successors, (1236), 828 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:48,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1236 transitions. [2021-08-25 20:36:48,833 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1236 transitions. Word has length 161 [2021-08-25 20:36:48,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:48,833 INFO L470 AbstractCegarLoop]: Abstraction has 829 states and 1236 transitions. [2021-08-25 20:36:48,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:48,833 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1236 transitions. [2021-08-25 20:36:48,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-08-25 20:36:48,834 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:48,834 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:48,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2021-08-25 20:36:48,835 INFO L402 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:48,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:48,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1151072035, now seen corresponding path program 1 times [2021-08-25 20:36:48,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:48,835 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299905386] [2021-08-25 20:36:48,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:48,835 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-08-25 20:36:48,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:48,867 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299905386] [2021-08-25 20:36:48,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299905386] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:48,867 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:48,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:48,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171017234] [2021-08-25 20:36:48,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:48,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:48,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:48,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:48,868 INFO L87 Difference]: Start difference. First operand 829 states and 1236 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) [2021-08-25 20:36:49,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:49,073 INFO L93 Difference]: Finished difference Result 1683 states and 2512 transitions. [2021-08-25 20:36:49,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:49,073 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 161 [2021-08-25 20:36:49,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:49,074 INFO L225 Difference]: With dead ends: 1683 [2021-08-25 20:36:49,074 INFO L226 Difference]: Without dead ends: 873 [2021-08-25 20:36:49,074 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:49,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2021-08-25 20:36:49,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 829. [2021-08-25 20:36:49,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 828 states have (on average 1.4903381642512077) internal successors, (1234), 828 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1234 transitions. [2021-08-25 20:36:49,098 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1234 transitions. Word has length 161 [2021-08-25 20:36:49,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:49,099 INFO L470 AbstractCegarLoop]: Abstraction has 829 states and 1234 transitions. [2021-08-25 20:36:49,099 INFO L471 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) [2021-08-25 20:36:49,099 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1234 transitions. [2021-08-25 20:36:49,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-08-25 20:36:49,099 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:49,100 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:49,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-08-25 20:36:49,100 INFO L402 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:49,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:49,100 INFO L82 PathProgramCache]: Analyzing trace with hash -2040900662, now seen corresponding path program 1 times [2021-08-25 20:36:49,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:49,100 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209402245] [2021-08-25 20:36:49,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:49,101 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:49,129 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2021-08-25 20:36:49,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:49,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209402245] [2021-08-25 20:36:49,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209402245] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:49,129 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:49,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:36:49,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496717557] [2021-08-25 20:36:49,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:36:49,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:49,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:36:49,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:36:49,130 INFO L87 Difference]: Start difference. First operand 829 states and 1234 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:49,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:49,187 INFO L93 Difference]: Finished difference Result 1666 states and 2483 transitions. [2021-08-25 20:36:49,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:36:49,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 [2021-08-25 20:36:49,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:49,188 INFO L225 Difference]: With dead ends: 1666 [2021-08-25 20:36:49,188 INFO L226 Difference]: Without dead ends: 856 [2021-08-25 20:36:49,189 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:36:49,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2021-08-25 20:36:49,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2021-08-25 20:36:49,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 855 states have (on average 1.4842105263157894) internal successors, (1269), 855 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:49,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1269 transitions. [2021-08-25 20:36:49,215 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1269 transitions. Word has length 161 [2021-08-25 20:36:49,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:49,215 INFO L470 AbstractCegarLoop]: Abstraction has 856 states and 1269 transitions. [2021-08-25 20:36:49,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:49,215 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1269 transitions. [2021-08-25 20:36:49,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-08-25 20:36:49,216 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:49,216 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:49,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2021-08-25 20:36:49,220 INFO L402 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:49,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:49,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1713637128, now seen corresponding path program 1 times [2021-08-25 20:36:49,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:49,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088040080] [2021-08-25 20:36:49,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:49,220 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:49,239 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2021-08-25 20:36:49,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:49,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088040080] [2021-08-25 20:36:49,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088040080] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:49,240 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:49,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:36:49,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977014710] [2021-08-25 20:36:49,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:36:49,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:49,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:36:49,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:36:49,241 INFO L87 Difference]: Start difference. First operand 856 states and 1269 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:49,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:49,283 INFO L93 Difference]: Finished difference Result 1695 states and 2519 transitions. [2021-08-25 20:36:49,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:36:49,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2021-08-25 20:36:49,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:49,284 INFO L225 Difference]: With dead ends: 1695 [2021-08-25 20:36:49,284 INFO L226 Difference]: Without dead ends: 858 [2021-08-25 20:36:49,285 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:36:49,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2021-08-25 20:36:49,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 858. [2021-08-25 20:36:49,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 857 states have (on average 1.4830805134189031) internal successors, (1271), 857 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:49,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1271 transitions. [2021-08-25 20:36:49,312 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1271 transitions. Word has length 161 [2021-08-25 20:36:49,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:49,312 INFO L470 AbstractCegarLoop]: Abstraction has 858 states and 1271 transitions. [2021-08-25 20:36:49,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:49,312 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1271 transitions. [2021-08-25 20:36:49,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-08-25 20:36:49,313 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:49,313 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:49,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-08-25 20:36:49,313 INFO L402 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:49,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:49,314 INFO L82 PathProgramCache]: Analyzing trace with hash -712421640, now seen corresponding path program 1 times [2021-08-25 20:36:49,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:49,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935462053] [2021-08-25 20:36:49,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:49,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:49,380 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:36:49,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:49,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935462053] [2021-08-25 20:36:49,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935462053] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:49,381 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:49,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:36:49,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114059825] [2021-08-25 20:36:49,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:36:49,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:49,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:36:49,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:49,382 INFO L87 Difference]: Start difference. First operand 858 states and 1271 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:49,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:49,748 INFO L93 Difference]: Finished difference Result 1848 states and 2751 transitions. [2021-08-25 20:36:49,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:36:49,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 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 162 [2021-08-25 20:36:49,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:49,750 INFO L225 Difference]: With dead ends: 1848 [2021-08-25 20:36:49,750 INFO L226 Difference]: Without dead ends: 1011 [2021-08-25 20:36:49,750 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:36:49,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2021-08-25 20:36:49,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 924. [2021-08-25 20:36:49,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 923 states have (on average 1.504875406283857) internal successors, (1389), 923 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:49,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1389 transitions. [2021-08-25 20:36:49,779 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1389 transitions. Word has length 162 [2021-08-25 20:36:49,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:49,779 INFO L470 AbstractCegarLoop]: Abstraction has 924 states and 1389 transitions. [2021-08-25 20:36:49,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:49,779 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1389 transitions. [2021-08-25 20:36:49,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-08-25 20:36:49,780 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:49,780 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:49,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2021-08-25 20:36:49,781 INFO L402 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:49,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:49,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1482730618, now seen corresponding path program 1 times [2021-08-25 20:36:49,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:49,781 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207231624] [2021-08-25 20:36:49,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:49,781 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:49,814 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:36:49,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:49,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207231624] [2021-08-25 20:36:49,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207231624] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:49,814 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:49,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:49,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357651967] [2021-08-25 20:36:49,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:49,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:49,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:49,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:49,815 INFO L87 Difference]: Start difference. First operand 924 states and 1389 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:50,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:50,034 INFO L93 Difference]: Finished difference Result 1887 states and 2832 transitions. [2021-08-25 20:36:50,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:50,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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 164 [2021-08-25 20:36:50,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:50,035 INFO L225 Difference]: With dead ends: 1887 [2021-08-25 20:36:50,035 INFO L226 Difference]: Without dead ends: 984 [2021-08-25 20:36:50,036 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:50,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2021-08-25 20:36:50,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 939. [2021-08-25 20:36:50,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 938 states have (on average 1.5010660980810235) internal successors, (1408), 938 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1408 transitions. [2021-08-25 20:36:50,065 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1408 transitions. Word has length 164 [2021-08-25 20:36:50,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:50,065 INFO L470 AbstractCegarLoop]: Abstraction has 939 states and 1408 transitions. [2021-08-25 20:36:50,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:50,066 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1408 transitions. [2021-08-25 20:36:50,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-08-25 20:36:50,067 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:50,067 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 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] [2021-08-25 20:36:50,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-08-25 20:36:50,067 INFO L402 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:50,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:50,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1289166964, now seen corresponding path program 1 times [2021-08-25 20:36:50,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:50,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475738747] [2021-08-25 20:36:50,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:50,068 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:50,101 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-25 20:36:50,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:50,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475738747] [2021-08-25 20:36:50,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475738747] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:50,102 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:50,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:50,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222869029] [2021-08-25 20:36:50,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:50,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:50,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:50,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:50,103 INFO L87 Difference]: Start difference. First operand 939 states and 1408 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:50,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:50,335 INFO L93 Difference]: Finished difference Result 1887 states and 2835 transitions. [2021-08-25 20:36:50,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:50,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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 [2021-08-25 20:36:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:50,336 INFO L225 Difference]: With dead ends: 1887 [2021-08-25 20:36:50,336 INFO L226 Difference]: Without dead ends: 969 [2021-08-25 20:36:50,337 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:50,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2021-08-25 20:36:50,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 939. [2021-08-25 20:36:50,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 938 states have (on average 1.5) internal successors, (1407), 938 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:50,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1407 transitions. [2021-08-25 20:36:50,366 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1407 transitions. Word has length 165 [2021-08-25 20:36:50,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:50,366 INFO L470 AbstractCegarLoop]: Abstraction has 939 states and 1407 transitions. [2021-08-25 20:36:50,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:50,366 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1407 transitions. [2021-08-25 20:36:50,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-08-25 20:36:50,367 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:50,367 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:50,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2021-08-25 20:36:50,367 INFO L402 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:50,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:50,368 INFO L82 PathProgramCache]: Analyzing trace with hash 156450878, now seen corresponding path program 1 times [2021-08-25 20:36:50,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:50,368 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94956970] [2021-08-25 20:36:50,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:50,368 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:36:50,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:50,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94956970] [2021-08-25 20:36:50,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94956970] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:50,401 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:50,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:50,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560526669] [2021-08-25 20:36:50,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:50,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:50,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:50,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:50,402 INFO L87 Difference]: Start difference. First operand 939 states and 1407 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) [2021-08-25 20:36:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:50,648 INFO L93 Difference]: Finished difference Result 1890 states and 2831 transitions. [2021-08-25 20:36:50,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:50,648 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 [2021-08-25 20:36:50,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:50,650 INFO L225 Difference]: With dead ends: 1890 [2021-08-25 20:36:50,650 INFO L226 Difference]: Without dead ends: 968 [2021-08-25 20:36:50,650 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:50,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2021-08-25 20:36:50,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 937. [2021-08-25 20:36:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 936 states have (on average 1.498931623931624) internal successors, (1403), 936 states have internal predecessors, (1403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1403 transitions. [2021-08-25 20:36:50,680 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1403 transitions. Word has length 165 [2021-08-25 20:36:50,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:50,681 INFO L470 AbstractCegarLoop]: Abstraction has 937 states and 1403 transitions. [2021-08-25 20:36:50,681 INFO L471 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) [2021-08-25 20:36:50,681 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1403 transitions. [2021-08-25 20:36:50,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-08-25 20:36:50,682 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:50,682 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 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] [2021-08-25 20:36:50,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-08-25 20:36:50,682 INFO L402 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:50,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:50,682 INFO L82 PathProgramCache]: Analyzing trace with hash 186100391, now seen corresponding path program 1 times [2021-08-25 20:36:50,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:50,682 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65404148] [2021-08-25 20:36:50,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:50,682 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:50,724 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-25 20:36:50,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:50,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65404148] [2021-08-25 20:36:50,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65404148] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:50,725 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:50,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:50,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305974031] [2021-08-25 20:36:50,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:50,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:50,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:50,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:50,726 INFO L87 Difference]: Start difference. First operand 937 states and 1403 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:50,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:50,970 INFO L93 Difference]: Finished difference Result 1881 states and 2823 transitions. [2021-08-25 20:36:50,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:50,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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 [2021-08-25 20:36:50,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:50,971 INFO L225 Difference]: With dead ends: 1881 [2021-08-25 20:36:50,972 INFO L226 Difference]: Without dead ends: 965 [2021-08-25 20:36:50,972 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:50,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2021-08-25 20:36:51,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 937. [2021-08-25 20:36:51,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 936 states have (on average 1.4978632478632479) internal successors, (1402), 936 states have internal predecessors, (1402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:51,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1402 transitions. [2021-08-25 20:36:51,002 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1402 transitions. Word has length 166 [2021-08-25 20:36:51,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:51,002 INFO L470 AbstractCegarLoop]: Abstraction has 937 states and 1402 transitions. [2021-08-25 20:36:51,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:51,002 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1402 transitions. [2021-08-25 20:36:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-08-25 20:36:51,003 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:51,003 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:51,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2021-08-25 20:36:51,003 INFO L402 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:51,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:51,004 INFO L82 PathProgramCache]: Analyzing trace with hash -443861771, now seen corresponding path program 1 times [2021-08-25 20:36:51,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:51,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297920769] [2021-08-25 20:36:51,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:51,004 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:51,040 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-08-25 20:36:51,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:51,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297920769] [2021-08-25 20:36:51,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297920769] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:51,041 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:51,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:36:51,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642922580] [2021-08-25 20:36:51,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:36:51,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:51,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:36:51,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:36:51,042 INFO L87 Difference]: Start difference. First operand 937 states and 1402 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:51,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:51,124 INFO L93 Difference]: Finished difference Result 2315 states and 3481 transitions. [2021-08-25 20:36:51,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:36:51,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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 166 [2021-08-25 20:36:51,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:51,126 INFO L225 Difference]: With dead ends: 2315 [2021-08-25 20:36:51,126 INFO L226 Difference]: Without dead ends: 1399 [2021-08-25 20:36:51,127 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:36:51,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2021-08-25 20:36:51,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1399. [2021-08-25 20:36:51,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1399 states, 1398 states have (on average 1.496423462088698) internal successors, (2092), 1398 states have internal predecessors, (2092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:51,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 2092 transitions. [2021-08-25 20:36:51,171 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 2092 transitions. Word has length 166 [2021-08-25 20:36:51,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:51,171 INFO L470 AbstractCegarLoop]: Abstraction has 1399 states and 2092 transitions. [2021-08-25 20:36:51,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:51,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 2092 transitions. [2021-08-25 20:36:51,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-08-25 20:36:51,172 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:51,172 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:36:51,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2021-08-25 20:36:51,173 INFO L402 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:51,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:51,173 INFO L82 PathProgramCache]: Analyzing trace with hash -317547734, now seen corresponding path program 1 times [2021-08-25 20:36:51,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:51,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131218773] [2021-08-25 20:36:51,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:51,173 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:36:51,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:51,201 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131218773] [2021-08-25 20:36:51,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131218773] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:51,202 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:51,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:36:51,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132832126] [2021-08-25 20:36:51,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:36:51,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:51,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:36:51,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:36:51,203 INFO L87 Difference]: Start difference. First operand 1399 states and 2092 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:51,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:51,298 INFO L93 Difference]: Finished difference Result 3237 states and 4856 transitions. [2021-08-25 20:36:51,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:36:51,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 167 [2021-08-25 20:36:51,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:51,301 INFO L225 Difference]: With dead ends: 3237 [2021-08-25 20:36:51,301 INFO L226 Difference]: Without dead ends: 1859 [2021-08-25 20:36:51,302 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:36:51,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2021-08-25 20:36:51,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1853. [2021-08-25 20:36:51,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1852 states have (on average 1.4973002159827213) internal successors, (2773), 1852 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2773 transitions. [2021-08-25 20:36:51,361 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2773 transitions. Word has length 167 [2021-08-25 20:36:51,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:51,361 INFO L470 AbstractCegarLoop]: Abstraction has 1853 states and 2773 transitions. [2021-08-25 20:36:51,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:51,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2773 transitions. [2021-08-25 20:36:51,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-08-25 20:36:51,362 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:51,362 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:51,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2021-08-25 20:36:51,363 INFO L402 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:51,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:51,363 INFO L82 PathProgramCache]: Analyzing trace with hash 413118599, now seen corresponding path program 1 times [2021-08-25 20:36:51,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:51,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141137217] [2021-08-25 20:36:51,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:51,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:51,395 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:36:51,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:51,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141137217] [2021-08-25 20:36:51,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141137217] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:51,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:51,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:51,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544825994] [2021-08-25 20:36:51,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:51,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:51,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:51,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:51,397 INFO L87 Difference]: Start difference. First operand 1853 states and 2773 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) [2021-08-25 20:36:51,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:51,703 INFO L93 Difference]: Finished difference Result 3830 states and 5709 transitions. [2021-08-25 20:36:51,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:51,703 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 172 [2021-08-25 20:36:51,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:51,706 INFO L225 Difference]: With dead ends: 3830 [2021-08-25 20:36:51,706 INFO L226 Difference]: Without dead ends: 1998 [2021-08-25 20:36:51,707 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:51,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2021-08-25 20:36:51,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1853. [2021-08-25 20:36:51,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1852 states have (on average 1.4951403887688985) internal successors, (2769), 1852 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2769 transitions. [2021-08-25 20:36:51,767 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2769 transitions. Word has length 172 [2021-08-25 20:36:51,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:51,767 INFO L470 AbstractCegarLoop]: Abstraction has 1853 states and 2769 transitions. [2021-08-25 20:36:51,767 INFO L471 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) [2021-08-25 20:36:51,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2769 transitions. [2021-08-25 20:36:51,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-08-25 20:36:51,768 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:51,769 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:51,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-08-25 20:36:51,769 INFO L402 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:51,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:51,769 INFO L82 PathProgramCache]: Analyzing trace with hash 916128046, now seen corresponding path program 1 times [2021-08-25 20:36:51,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:51,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553283639] [2021-08-25 20:36:51,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:51,770 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:51,801 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:36:51,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:51,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553283639] [2021-08-25 20:36:51,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553283639] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:51,801 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:51,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:51,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115036352] [2021-08-25 20:36:51,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:51,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:51,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:51,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:51,802 INFO L87 Difference]: Start difference. First operand 1853 states and 2769 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) [2021-08-25 20:36:52,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:52,150 INFO L93 Difference]: Finished difference Result 3830 states and 5701 transitions. [2021-08-25 20:36:52,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:52,151 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 173 [2021-08-25 20:36:52,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:52,153 INFO L225 Difference]: With dead ends: 3830 [2021-08-25 20:36:52,153 INFO L226 Difference]: Without dead ends: 1998 [2021-08-25 20:36:52,154 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:52,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2021-08-25 20:36:52,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1853. [2021-08-25 20:36:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1852 states have (on average 1.4929805615550755) internal successors, (2765), 1852 states have internal predecessors, (2765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2765 transitions. [2021-08-25 20:36:52,214 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2765 transitions. Word has length 173 [2021-08-25 20:36:52,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:52,215 INFO L470 AbstractCegarLoop]: Abstraction has 1853 states and 2765 transitions. [2021-08-25 20:36:52,215 INFO L471 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) [2021-08-25 20:36:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2765 transitions. [2021-08-25 20:36:52,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-08-25 20:36:52,216 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:52,216 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:52,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2021-08-25 20:36:52,216 INFO L402 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:52,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:52,217 INFO L82 PathProgramCache]: Analyzing trace with hash -117510462, now seen corresponding path program 1 times [2021-08-25 20:36:52,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:52,217 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311399648] [2021-08-25 20:36:52,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:52,217 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:52,250 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:36:52,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:52,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311399648] [2021-08-25 20:36:52,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311399648] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:52,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:52,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:52,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503908379] [2021-08-25 20:36:52,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:52,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:52,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:52,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:52,252 INFO L87 Difference]: Start difference. First operand 1853 states and 2765 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) [2021-08-25 20:36:52,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:52,547 INFO L93 Difference]: Finished difference Result 3830 states and 5693 transitions. [2021-08-25 20:36:52,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:52,548 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 174 [2021-08-25 20:36:52,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:52,550 INFO L225 Difference]: With dead ends: 3830 [2021-08-25 20:36:52,550 INFO L226 Difference]: Without dead ends: 1998 [2021-08-25 20:36:52,551 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:52,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2021-08-25 20:36:52,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1853. [2021-08-25 20:36:52,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1852 states have (on average 1.4908207343412527) internal successors, (2761), 1852 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:52,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2761 transitions. [2021-08-25 20:36:52,607 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2761 transitions. Word has length 174 [2021-08-25 20:36:52,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:52,607 INFO L470 AbstractCegarLoop]: Abstraction has 1853 states and 2761 transitions. [2021-08-25 20:36:52,607 INFO L471 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) [2021-08-25 20:36:52,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2761 transitions. [2021-08-25 20:36:52,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-08-25 20:36:52,608 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:52,608 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:52,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-08-25 20:36:52,609 INFO L402 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:52,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:52,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1542595319, now seen corresponding path program 1 times [2021-08-25 20:36:52,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:52,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369759756] [2021-08-25 20:36:52,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:52,609 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:36:52,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:52,643 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369759756] [2021-08-25 20:36:52,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369759756] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:52,643 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:52,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:52,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914138947] [2021-08-25 20:36:52,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:52,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:52,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:52,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:52,644 INFO L87 Difference]: Start difference. First operand 1853 states and 2761 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) [2021-08-25 20:36:52,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:52,928 INFO L93 Difference]: Finished difference Result 3790 states and 5637 transitions. [2021-08-25 20:36:52,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:52,928 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 175 [2021-08-25 20:36:52,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:52,931 INFO L225 Difference]: With dead ends: 3790 [2021-08-25 20:36:52,931 INFO L226 Difference]: Without dead ends: 1958 [2021-08-25 20:36:52,932 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:52,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2021-08-25 20:36:52,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1853. [2021-08-25 20:36:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1852 states have (on average 1.4886609071274297) internal successors, (2757), 1852 states have internal predecessors, (2757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:53,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2757 transitions. [2021-08-25 20:36:53,000 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2757 transitions. Word has length 175 [2021-08-25 20:36:53,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:53,000 INFO L470 AbstractCegarLoop]: Abstraction has 1853 states and 2757 transitions. [2021-08-25 20:36:53,000 INFO L471 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) [2021-08-25 20:36:53,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2757 transitions. [2021-08-25 20:36:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-08-25 20:36:53,002 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:53,002 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:53,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2021-08-25 20:36:53,002 INFO L402 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:53,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:53,002 INFO L82 PathProgramCache]: Analyzing trace with hash 198256685, now seen corresponding path program 1 times [2021-08-25 20:36:53,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:53,003 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573822533] [2021-08-25 20:36:53,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:53,003 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:53,061 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-08-25 20:36:53,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:53,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573822533] [2021-08-25 20:36:53,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573822533] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:53,062 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:53,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:36:53,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759100906] [2021-08-25 20:36:53,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:36:53,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:53,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:36:53,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:53,063 INFO L87 Difference]: Start difference. First operand 1853 states and 2757 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:53,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:53,439 INFO L93 Difference]: Finished difference Result 4139 states and 6177 transitions. [2021-08-25 20:36:53,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:53,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 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 177 [2021-08-25 20:36:53,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:53,442 INFO L225 Difference]: With dead ends: 4139 [2021-08-25 20:36:53,442 INFO L226 Difference]: Without dead ends: 2307 [2021-08-25 20:36:53,443 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:36:53,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2021-08-25 20:36:53,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2012. [2021-08-25 20:36:53,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2012 states, 2011 states have (on average 1.513674788662357) internal successors, (3044), 2011 states have internal predecessors, (3044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:53,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 3044 transitions. [2021-08-25 20:36:53,505 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 3044 transitions. Word has length 177 [2021-08-25 20:36:53,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:53,505 INFO L470 AbstractCegarLoop]: Abstraction has 2012 states and 3044 transitions. [2021-08-25 20:36:53,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:53,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 3044 transitions. [2021-08-25 20:36:53,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-08-25 20:36:53,507 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:53,507 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:53,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2021-08-25 20:36:53,507 INFO L402 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:53,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:53,508 INFO L82 PathProgramCache]: Analyzing trace with hash -128602397, now seen corresponding path program 1 times [2021-08-25 20:36:53,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:53,508 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863301690] [2021-08-25 20:36:53,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:53,508 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:53,570 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-08-25 20:36:53,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:53,570 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863301690] [2021-08-25 20:36:53,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863301690] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:53,571 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:53,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:36:53,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844675250] [2021-08-25 20:36:53,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:36:53,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:53,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:36:53,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:53,572 INFO L87 Difference]: Start difference. First operand 2012 states and 3044 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 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) [2021-08-25 20:36:53,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:53,986 INFO L93 Difference]: Finished difference Result 4410 states and 6684 transitions. [2021-08-25 20:36:53,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:53,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 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 178 [2021-08-25 20:36:53,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:53,989 INFO L225 Difference]: With dead ends: 4410 [2021-08-25 20:36:53,989 INFO L226 Difference]: Without dead ends: 2419 [2021-08-25 20:36:53,990 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:36:53,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2021-08-25 20:36:54,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2122. [2021-08-25 20:36:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2122 states, 2121 states have (on average 1.5398396982555398) internal successors, (3266), 2121 states have internal predecessors, (3266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 3266 transitions. [2021-08-25 20:36:54,060 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 3266 transitions. Word has length 178 [2021-08-25 20:36:54,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:54,061 INFO L470 AbstractCegarLoop]: Abstraction has 2122 states and 3266 transitions. [2021-08-25 20:36:54,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 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) [2021-08-25 20:36:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3266 transitions. [2021-08-25 20:36:54,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-08-25 20:36:54,062 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:54,062 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:54,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2021-08-25 20:36:54,063 INFO L402 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:54,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:54,063 INFO L82 PathProgramCache]: Analyzing trace with hash 725002316, now seen corresponding path program 1 times [2021-08-25 20:36:54,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:54,063 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837543193] [2021-08-25 20:36:54,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:54,063 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:54,314 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:36:54,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:54,314 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837543193] [2021-08-25 20:36:54,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837543193] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:36:54,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438271097] [2021-08-25 20:36:54,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:54,315 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:36:54,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:36:54,324 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:36:54,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-25 20:36:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:54,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 36 conjunts are in the unsatisfiable core [2021-08-25 20:36:54,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:36:54,750 INFO L354 Elim1Store]: treesize reduction 199, result has 12.3 percent of original size [2021-08-25 20:36:54,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 74 [2021-08-25 20:36:54,767 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:36:54,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 37 [2021-08-25 20:36:54,776 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:36:54,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2021-08-25 20:36:54,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 14 [2021-08-25 20:36:54,800 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:36:54,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:36:54,855 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:36:54,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:36:54,895 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-25 20:36:54,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2021-08-25 20:36:54,968 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:36:54,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:36:54,982 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:36:54,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:36:55,059 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-25 20:36:55,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2021-08-25 20:36:55,129 INFO L354 Elim1Store]: treesize reduction 59, result has 13.2 percent of original size [2021-08-25 20:36:55,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 44 [2021-08-25 20:36:55,166 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-25 20:36:55,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2021-08-25 20:36:55,248 INFO L354 Elim1Store]: treesize reduction 59, result has 13.2 percent of original size [2021-08-25 20:36:55,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 44 [2021-08-25 20:36:55,303 INFO L354 Elim1Store]: treesize reduction 160, result has 16.2 percent of original size [2021-08-25 20:36:55,304 INFO L388 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 2 case distinctions, treesize of input 275 treesize of output 205 [2021-08-25 20:36:55,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 215 [2021-08-25 20:36:55,322 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:36:55,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 311 treesize of output 287 [2021-08-25 20:36:55,367 INFO L354 Elim1Store]: treesize reduction 244, result has 13.2 percent of original size [2021-08-25 20:36:55,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 359 treesize of output 309 [2021-08-25 20:36:55,393 INFO L354 Elim1Store]: treesize reduction 108, result has 15.0 percent of original size [2021-08-25 20:36:55,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 375 treesize of output 320 [2021-08-25 20:36:55,435 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-08-25 20:36:55,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:36:55,477 INFO L354 Elim1Store]: treesize reduction 83, result has 34.1 percent of original size [2021-08-25 20:36:55,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 83 [2021-08-25 20:36:55,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:36:55,518 INFO L354 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2021-08-25 20:36:55,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 191 treesize of output 134 [2021-08-25 20:36:55,540 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-08-25 20:36:55,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 61 [2021-08-25 20:36:55,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:36:55,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2021-08-25 20:36:56,126 INFO L388 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 81 treesize of output 63 [2021-08-25 20:36:56,130 INFO L388 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 63 treesize of output 51 [2021-08-25 20:36:56,144 INFO L354 Elim1Store]: treesize reduction 104, result has 15.4 percent of original size [2021-08-25 20:36:56,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 41 [2021-08-25 20:36:56,743 INFO L354 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2021-08-25 20:36:56,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 17 [2021-08-25 20:36:56,762 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:36:56,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438271097] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:36:56,762 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:36:56,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2021-08-25 20:36:56,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220604137] [2021-08-25 20:36:56,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-25 20:36:56,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:56,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-25 20:36:56,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-08-25 20:36:56,764 INFO L87 Difference]: Start difference. First operand 2122 states and 3266 transitions. Second operand has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:58,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:58,807 INFO L93 Difference]: Finished difference Result 5424 states and 8318 transitions. [2021-08-25 20:36:58,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-25 20:36:58,810 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 states have internal predecessors, (191), 0 states have call successors, (0), 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 191 [2021-08-25 20:36:58,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:58,813 INFO L225 Difference]: With dead ends: 5424 [2021-08-25 20:36:58,813 INFO L226 Difference]: Without dead ends: 3323 [2021-08-25 20:36:58,814 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 202.2ms TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2021-08-25 20:36:58,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2021-08-25 20:36:58,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 2751. [2021-08-25 20:36:58,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2751 states, 2750 states have (on average 1.5625454545454545) internal successors, (4297), 2750 states have internal predecessors, (4297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:58,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2751 states and 4297 transitions. [2021-08-25 20:36:58,899 INFO L78 Accepts]: Start accepts. Automaton has 2751 states and 4297 transitions. Word has length 191 [2021-08-25 20:36:58,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:58,899 INFO L470 AbstractCegarLoop]: Abstraction has 2751 states and 4297 transitions. [2021-08-25 20:36:58,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:58,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2751 states and 4297 transitions. [2021-08-25 20:36:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-08-25 20:36:58,901 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:58,901 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:58,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-25 20:36:59,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:36:59,103 INFO L402 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:59,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:59,103 INFO L82 PathProgramCache]: Analyzing trace with hash 877150553, now seen corresponding path program 1 times [2021-08-25 20:36:59,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:59,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825339666] [2021-08-25 20:36:59,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:59,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:59,156 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2021-08-25 20:36:59,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:59,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825339666] [2021-08-25 20:36:59,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825339666] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:59,157 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:59,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:59,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449090905] [2021-08-25 20:36:59,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:59,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:59,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:59,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:59,158 INFO L87 Difference]: Start difference. First operand 2751 states and 4297 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) [2021-08-25 20:36:59,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:59,496 INFO L93 Difference]: Finished difference Result 5585 states and 8708 transitions. [2021-08-25 20:36:59,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:59,497 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 199 [2021-08-25 20:36:59,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:59,501 INFO L225 Difference]: With dead ends: 5585 [2021-08-25 20:36:59,501 INFO L226 Difference]: Without dead ends: 2882 [2021-08-25 20:36:59,504 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:59,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2021-08-25 20:36:59,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2751. [2021-08-25 20:36:59,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2751 states, 2750 states have (on average 1.5607272727272727) internal successors, (4292), 2750 states have internal predecessors, (4292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:59,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2751 states and 4292 transitions. [2021-08-25 20:36:59,610 INFO L78 Accepts]: Start accepts. Automaton has 2751 states and 4292 transitions. Word has length 199 [2021-08-25 20:36:59,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:59,610 INFO L470 AbstractCegarLoop]: Abstraction has 2751 states and 4292 transitions. [2021-08-25 20:36:59,611 INFO L471 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) [2021-08-25 20:36:59,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2751 states and 4292 transitions. [2021-08-25 20:36:59,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-08-25 20:36:59,613 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:59,613 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:59,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2021-08-25 20:36:59,613 INFO L402 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:59,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:59,613 INFO L82 PathProgramCache]: Analyzing trace with hash -19453550, now seen corresponding path program 1 times [2021-08-25 20:36:59,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:36:59,614 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428377447] [2021-08-25 20:36:59,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:59,614 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:36:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:59,653 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2021-08-25 20:36:59,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:36:59,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428377447] [2021-08-25 20:36:59,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428377447] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:36:59,653 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:36:59,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:36:59,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041868993] [2021-08-25 20:36:59,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:36:59,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:36:59,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:36:59,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:36:59,654 INFO L87 Difference]: Start difference. First operand 2751 states and 4292 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) [2021-08-25 20:36:59,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:59,968 INFO L93 Difference]: Finished difference Result 5575 states and 8688 transitions. [2021-08-25 20:36:59,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:36:59,968 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 200 [2021-08-25 20:36:59,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:59,971 INFO L225 Difference]: With dead ends: 5575 [2021-08-25 20:36:59,971 INFO L226 Difference]: Without dead ends: 2872 [2021-08-25 20:36:59,972 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:36:59,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2872 states. [2021-08-25 20:37:00,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2872 to 2751. [2021-08-25 20:37:00,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2751 states, 2750 states have (on average 1.5589090909090908) internal successors, (4287), 2750 states have internal predecessors, (4287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:00,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2751 states and 4287 transitions. [2021-08-25 20:37:00,058 INFO L78 Accepts]: Start accepts. Automaton has 2751 states and 4287 transitions. Word has length 200 [2021-08-25 20:37:00,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:00,058 INFO L470 AbstractCegarLoop]: Abstraction has 2751 states and 4287 transitions. [2021-08-25 20:37:00,059 INFO L471 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) [2021-08-25 20:37:00,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2751 states and 4287 transitions. [2021-08-25 20:37:00,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-08-25 20:37:00,061 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:00,061 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:00,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2021-08-25 20:37:00,061 INFO L402 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:00,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:00,061 INFO L82 PathProgramCache]: Analyzing trace with hash 477049331, now seen corresponding path program 1 times [2021-08-25 20:37:00,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:00,062 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309835079] [2021-08-25 20:37:00,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:00,062 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:00,127 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2021-08-25 20:37:00,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:00,128 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309835079] [2021-08-25 20:37:00,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309835079] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:00,128 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:00,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-25 20:37:00,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352397305] [2021-08-25 20:37:00,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:37:00,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:00,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:37:00,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:37:00,129 INFO L87 Difference]: Start difference. First operand 2751 states and 4287 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:00,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:00,825 INFO L93 Difference]: Finished difference Result 6298 states and 9780 transitions. [2021-08-25 20:37:00,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:37:00,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 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 204 [2021-08-25 20:37:00,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:00,828 INFO L225 Difference]: With dead ends: 6298 [2021-08-25 20:37:00,828 INFO L226 Difference]: Without dead ends: 3595 [2021-08-25 20:37:00,830 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 23.8ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:37:00,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3595 states. [2021-08-25 20:37:00,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3595 to 2886. [2021-08-25 20:37:00,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2886 states, 2885 states have (on average 1.5649913344887347) internal successors, (4515), 2885 states have internal predecessors, (4515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:00,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2886 states to 2886 states and 4515 transitions. [2021-08-25 20:37:00,927 INFO L78 Accepts]: Start accepts. Automaton has 2886 states and 4515 transitions. Word has length 204 [2021-08-25 20:37:00,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:00,927 INFO L470 AbstractCegarLoop]: Abstraction has 2886 states and 4515 transitions. [2021-08-25 20:37:00,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:00,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2886 states and 4515 transitions. [2021-08-25 20:37:00,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2021-08-25 20:37:00,929 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:00,929 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:00,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2021-08-25 20:37:00,929 INFO L402 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:00,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:00,930 INFO L82 PathProgramCache]: Analyzing trace with hash 462310456, now seen corresponding path program 1 times [2021-08-25 20:37:00,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:00,930 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969189403] [2021-08-25 20:37:00,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:00,930 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2021-08-25 20:37:01,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:01,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969189403] [2021-08-25 20:37:01,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969189403] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:01,005 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:01,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-25 20:37:01,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684865649] [2021-08-25 20:37:01,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:37:01,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:01,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:37:01,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:37:01,006 INFO L87 Difference]: Start difference. First operand 2886 states and 4515 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:01,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:01,701 INFO L93 Difference]: Finished difference Result 6335 states and 9823 transitions. [2021-08-25 20:37:01,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:37:01,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 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 205 [2021-08-25 20:37:01,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:01,705 INFO L225 Difference]: With dead ends: 6335 [2021-08-25 20:37:01,705 INFO L226 Difference]: Without dead ends: 3497 [2021-08-25 20:37:01,707 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 22.8ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:37:01,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3497 states. [2021-08-25 20:37:01,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3497 to 2887. [2021-08-25 20:37:01,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2887 states, 2886 states have (on average 1.5613305613305613) internal successors, (4506), 2886 states have internal predecessors, (4506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:01,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2887 states and 4506 transitions. [2021-08-25 20:37:01,800 INFO L78 Accepts]: Start accepts. Automaton has 2887 states and 4506 transitions. Word has length 205 [2021-08-25 20:37:01,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:01,800 INFO L470 AbstractCegarLoop]: Abstraction has 2887 states and 4506 transitions. [2021-08-25 20:37:01,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:01,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 4506 transitions. [2021-08-25 20:37:01,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-08-25 20:37:01,803 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:01,803 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 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, 1, 1] [2021-08-25 20:37:01,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2021-08-25 20:37:01,803 INFO L402 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:01,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:01,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1162072735, now seen corresponding path program 1 times [2021-08-25 20:37:01,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:01,804 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812848391] [2021-08-25 20:37:01,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:01,804 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:01,838 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-08-25 20:37:01,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:01,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812848391] [2021-08-25 20:37:01,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812848391] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:01,839 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:01,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:37:01,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939790635] [2021-08-25 20:37:01,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:37:01,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:01,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:37:01,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:37:01,840 INFO L87 Difference]: Start difference. First operand 2887 states and 4506 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:02,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:02,125 INFO L93 Difference]: Finished difference Result 5260 states and 8169 transitions. [2021-08-25 20:37:02,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:02,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 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 210 [2021-08-25 20:37:02,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:02,127 INFO L225 Difference]: With dead ends: 5260 [2021-08-25 20:37:02,127 INFO L226 Difference]: Without dead ends: 2967 [2021-08-25 20:37:02,129 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:02,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2021-08-25 20:37:02,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 2887. [2021-08-25 20:37:02,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2887 states, 2886 states have (on average 1.5602910602910602) internal successors, (4503), 2886 states have internal predecessors, (4503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:02,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2887 states and 4503 transitions. [2021-08-25 20:37:02,225 INFO L78 Accepts]: Start accepts. Automaton has 2887 states and 4503 transitions. Word has length 210 [2021-08-25 20:37:02,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:02,225 INFO L470 AbstractCegarLoop]: Abstraction has 2887 states and 4503 transitions. [2021-08-25 20:37:02,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:02,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 4503 transitions. [2021-08-25 20:37:02,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2021-08-25 20:37:02,227 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:02,228 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 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, 1, 1] [2021-08-25 20:37:02,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2021-08-25 20:37:02,228 INFO L402 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:02,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:02,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1359690906, now seen corresponding path program 1 times [2021-08-25 20:37:02,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:02,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819100630] [2021-08-25 20:37:02,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:02,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:02,265 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-08-25 20:37:02,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:02,266 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819100630] [2021-08-25 20:37:02,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819100630] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:02,266 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:02,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:37:02,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421439286] [2021-08-25 20:37:02,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:37:02,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:02,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:37:02,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:37:02,267 INFO L87 Difference]: Start difference. First operand 2887 states and 4503 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) [2021-08-25 20:37:02,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:02,569 INFO L93 Difference]: Finished difference Result 5254 states and 8154 transitions. [2021-08-25 20:37:02,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:02,570 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 211 [2021-08-25 20:37:02,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:02,573 INFO L225 Difference]: With dead ends: 5254 [2021-08-25 20:37:02,573 INFO L226 Difference]: Without dead ends: 2961 [2021-08-25 20:37:02,574 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:02,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2021-08-25 20:37:02,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 2887. [2021-08-25 20:37:02,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2887 states, 2886 states have (on average 1.5592515592515592) internal successors, (4500), 2886 states have internal predecessors, (4500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:02,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2887 states and 4500 transitions. [2021-08-25 20:37:02,667 INFO L78 Accepts]: Start accepts. Automaton has 2887 states and 4500 transitions. Word has length 211 [2021-08-25 20:37:02,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:02,667 INFO L470 AbstractCegarLoop]: Abstraction has 2887 states and 4500 transitions. [2021-08-25 20:37:02,667 INFO L471 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) [2021-08-25 20:37:02,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 4500 transitions. [2021-08-25 20:37:02,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2021-08-25 20:37:02,669 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:02,669 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:02,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2021-08-25 20:37:02,670 INFO L402 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:02,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:02,670 INFO L82 PathProgramCache]: Analyzing trace with hash -412411121, now seen corresponding path program 1 times [2021-08-25 20:37:02,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:02,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334394402] [2021-08-25 20:37:02,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:02,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:02,728 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-08-25 20:37:02,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:02,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334394402] [2021-08-25 20:37:02,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334394402] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:02,729 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:02,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:37:02,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918267885] [2021-08-25 20:37:02,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:37:02,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:02,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:37:02,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:02,730 INFO L87 Difference]: Start difference. First operand 2887 states and 4500 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:03,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:03,153 INFO L93 Difference]: Finished difference Result 6295 states and 9798 transitions. [2021-08-25 20:37:03,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:03,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 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 211 [2021-08-25 20:37:03,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:03,156 INFO L225 Difference]: With dead ends: 6295 [2021-08-25 20:37:03,156 INFO L226 Difference]: Without dead ends: 3456 [2021-08-25 20:37:03,158 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:37:03,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3456 states. [2021-08-25 20:37:03,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3456 to 3072. [2021-08-25 20:37:03,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3072 states, 3071 states have (on average 1.5711494627157279) internal successors, (4825), 3071 states have internal predecessors, (4825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:03,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 4825 transitions. [2021-08-25 20:37:03,249 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 4825 transitions. Word has length 211 [2021-08-25 20:37:03,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:03,249 INFO L470 AbstractCegarLoop]: Abstraction has 3072 states and 4825 transitions. [2021-08-25 20:37:03,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:03,249 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 4825 transitions. [2021-08-25 20:37:03,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2021-08-25 20:37:03,251 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:03,251 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:03,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2021-08-25 20:37:03,251 INFO L402 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:03,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:03,252 INFO L82 PathProgramCache]: Analyzing trace with hash -760223515, now seen corresponding path program 1 times [2021-08-25 20:37:03,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:03,252 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555541558] [2021-08-25 20:37:03,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:03,252 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:03,307 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-08-25 20:37:03,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:03,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555541558] [2021-08-25 20:37:03,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555541558] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:03,308 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:03,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:37:03,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392924217] [2021-08-25 20:37:03,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:37:03,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:03,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:37:03,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:03,309 INFO L87 Difference]: Start difference. First operand 3072 states and 4825 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:03,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:03,736 INFO L93 Difference]: Finished difference Result 6465 states and 10093 transitions. [2021-08-25 20:37:03,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:03,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 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 212 [2021-08-25 20:37:03,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:03,740 INFO L225 Difference]: With dead ends: 6465 [2021-08-25 20:37:03,740 INFO L226 Difference]: Without dead ends: 3441 [2021-08-25 20:37:03,741 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 21.1ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:37:03,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3441 states. [2021-08-25 20:37:03,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3441 to 3066. [2021-08-25 20:37:03,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3066 states, 3065 states have (on average 1.569004893964111) internal successors, (4809), 3065 states have internal predecessors, (4809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:03,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 4809 transitions. [2021-08-25 20:37:03,831 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 4809 transitions. Word has length 212 [2021-08-25 20:37:03,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:03,832 INFO L470 AbstractCegarLoop]: Abstraction has 3066 states and 4809 transitions. [2021-08-25 20:37:03,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:03,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 4809 transitions. [2021-08-25 20:37:03,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2021-08-25 20:37:03,834 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:03,834 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:03,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2021-08-25 20:37:03,834 INFO L402 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:03,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:03,835 INFO L82 PathProgramCache]: Analyzing trace with hash 2003024104, now seen corresponding path program 1 times [2021-08-25 20:37:03,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:03,835 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948283126] [2021-08-25 20:37:03,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:03,835 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:03,909 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 307 proven. 4 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2021-08-25 20:37:03,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:03,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948283126] [2021-08-25 20:37:03,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948283126] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:37:03,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897428939] [2021-08-25 20:37:03,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:03,910 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:37:03,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:37:03,911 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:37:03,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-25 20:37:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:04,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-25 20:37:04,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:37:04,265 INFO L388 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 20 treesize of output 8 [2021-08-25 20:37:04,547 INFO L354 Elim1Store]: treesize reduction 74, result has 46.0 percent of original size [2021-08-25 20:37:04,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 163 [2021-08-25 20:37:04,550 INFO L388 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 140 treesize of output 110 [2021-08-25 20:37:04,552 INFO L388 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 110 treesize of output 80 [2021-08-25 20:37:04,570 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-08-25 20:37:04,590 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-08-25 20:37:04,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:37:04,696 INFO L388 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 29 treesize of output 11 [2021-08-25 20:37:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 276 proven. 17 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2021-08-25 20:37:04,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897428939] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:37:04,822 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:37:04,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2021-08-25 20:37:04,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437514683] [2021-08-25 20:37:04,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-25 20:37:04,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:04,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-25 20:37:04,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-08-25 20:37:04,823 INFO L87 Difference]: Start difference. First operand 3066 states and 4809 transitions. Second operand has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 11 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:06,291 INFO L93 Difference]: Finished difference Result 7208 states and 11139 transitions. [2021-08-25 20:37:06,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-25 20:37:06,291 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 11 states have internal predecessors, (166), 0 states have call successors, (0), 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 219 [2021-08-25 20:37:06,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:06,295 INFO L225 Difference]: With dead ends: 7208 [2021-08-25 20:37:06,295 INFO L226 Difference]: Without dead ends: 4190 [2021-08-25 20:37:06,297 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 140.5ms TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2021-08-25 20:37:06,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2021-08-25 20:37:06,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 3130. [2021-08-25 20:37:06,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3130 states, 3129 states have (on average 1.5592841163310962) internal successors, (4879), 3129 states have internal predecessors, (4879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:06,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 4879 transitions. [2021-08-25 20:37:06,392 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 4879 transitions. Word has length 219 [2021-08-25 20:37:06,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:06,392 INFO L470 AbstractCegarLoop]: Abstraction has 3130 states and 4879 transitions. [2021-08-25 20:37:06,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 11 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:06,392 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 4879 transitions. [2021-08-25 20:37:06,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2021-08-25 20:37:06,395 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:06,395 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:06,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-25 20:37:06,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable129 [2021-08-25 20:37:06,595 INFO L402 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:06,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:06,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1163438824, now seen corresponding path program 1 times [2021-08-25 20:37:06,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:06,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873497830] [2021-08-25 20:37:06,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:06,596 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:06,663 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 319 proven. 4 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2021-08-25 20:37:06,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:06,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873497830] [2021-08-25 20:37:06,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873497830] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:37:06,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760289778] [2021-08-25 20:37:06,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:06,664 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:37:06,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:37:06,665 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:37:06,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-25 20:37:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:07,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-25 20:37:07,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:37:07,122 INFO L388 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 20 treesize of output 8 [2021-08-25 20:37:07,393 INFO L354 Elim1Store]: treesize reduction 74, result has 46.0 percent of original size [2021-08-25 20:37:07,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 163 [2021-08-25 20:37:07,411 INFO L388 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 140 treesize of output 110 [2021-08-25 20:37:07,413 INFO L388 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 110 treesize of output 80 [2021-08-25 20:37:07,424 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-08-25 20:37:07,479 INFO L354 Elim1Store]: treesize reduction 5, result has 68.8 percent of original size [2021-08-25 20:37:07,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-08-25 20:37:07,552 INFO L388 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 29 treesize of output 11 [2021-08-25 20:37:07,685 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 286 proven. 13 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2021-08-25 20:37:07,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760289778] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:37:07,686 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:37:07,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2021-08-25 20:37:07,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502775965] [2021-08-25 20:37:07,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-25 20:37:07,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:07,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-25 20:37:07,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-08-25 20:37:07,687 INFO L87 Difference]: Start difference. First operand 3130 states and 4879 transitions. Second operand has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 11 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:09,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:09,140 INFO L93 Difference]: Finished difference Result 7222 states and 11113 transitions. [2021-08-25 20:37:09,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-25 20:37:09,140 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 11 states have internal predecessors, (166), 0 states have call successors, (0), 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 221 [2021-08-25 20:37:09,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:09,144 INFO L225 Difference]: With dead ends: 7222 [2021-08-25 20:37:09,144 INFO L226 Difference]: Without dead ends: 4140 [2021-08-25 20:37:09,146 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 136.8ms TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2021-08-25 20:37:09,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4140 states. [2021-08-25 20:37:09,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4140 to 3130. [2021-08-25 20:37:09,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3130 states, 3129 states have (on average 1.548418024928092) internal successors, (4845), 3129 states have internal predecessors, (4845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:09,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 4845 transitions. [2021-08-25 20:37:09,244 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 4845 transitions. Word has length 221 [2021-08-25 20:37:09,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:09,245 INFO L470 AbstractCegarLoop]: Abstraction has 3130 states and 4845 transitions. [2021-08-25 20:37:09,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 11 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:09,245 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 4845 transitions. [2021-08-25 20:37:09,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2021-08-25 20:37:09,247 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:09,247 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1] [2021-08-25 20:37:09,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-25 20:37:09,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:37:09,467 INFO L402 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:09,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:09,467 INFO L82 PathProgramCache]: Analyzing trace with hash -516078643, now seen corresponding path program 1 times [2021-08-25 20:37:09,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:09,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871981955] [2021-08-25 20:37:09,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:09,467 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:09,502 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-08-25 20:37:09,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:09,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871981955] [2021-08-25 20:37:09,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871981955] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:09,502 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:09,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:37:09,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322167850] [2021-08-25 20:37:09,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:37:09,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:09,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:37:09,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:37:09,503 INFO L87 Difference]: Start difference. First operand 3130 states and 4845 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:09,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:09,804 INFO L93 Difference]: Finished difference Result 6287 states and 9723 transitions. [2021-08-25 20:37:09,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:09,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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 224 [2021-08-25 20:37:09,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:09,807 INFO L225 Difference]: With dead ends: 6287 [2021-08-25 20:37:09,807 INFO L226 Difference]: Without dead ends: 3205 [2021-08-25 20:37:09,808 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:09,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3205 states. [2021-08-25 20:37:09,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3205 to 3130. [2021-08-25 20:37:09,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3130 states, 3129 states have (on average 1.5468200703100032) internal successors, (4840), 3129 states have internal predecessors, (4840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:09,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 4840 transitions. [2021-08-25 20:37:09,920 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 4840 transitions. Word has length 224 [2021-08-25 20:37:09,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:09,920 INFO L470 AbstractCegarLoop]: Abstraction has 3130 states and 4840 transitions. [2021-08-25 20:37:09,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:09,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 4840 transitions. [2021-08-25 20:37:09,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-08-25 20:37:09,923 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:09,923 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1] [2021-08-25 20:37:09,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2021-08-25 20:37:09,923 INFO L402 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:09,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:09,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1486256762, now seen corresponding path program 1 times [2021-08-25 20:37:09,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:09,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387037739] [2021-08-25 20:37:09,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:09,924 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:09,964 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-08-25 20:37:09,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:09,964 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387037739] [2021-08-25 20:37:09,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387037739] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:09,964 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:09,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:37:09,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353043880] [2021-08-25 20:37:09,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:37:09,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:09,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:37:09,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:37:09,966 INFO L87 Difference]: Start difference. First operand 3130 states and 4840 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:10,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:10,307 INFO L93 Difference]: Finished difference Result 6277 states and 9698 transitions. [2021-08-25 20:37:10,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:10,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 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 225 [2021-08-25 20:37:10,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:10,312 INFO L225 Difference]: With dead ends: 6277 [2021-08-25 20:37:10,312 INFO L226 Difference]: Without dead ends: 3195 [2021-08-25 20:37:10,313 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:10,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2021-08-25 20:37:10,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 3128. [2021-08-25 20:37:10,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3128 states, 3127 states have (on average 1.545570834665814) internal successors, (4833), 3127 states have internal predecessors, (4833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:10,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 4833 transitions. [2021-08-25 20:37:10,406 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 4833 transitions. Word has length 225 [2021-08-25 20:37:10,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:10,406 INFO L470 AbstractCegarLoop]: Abstraction has 3128 states and 4833 transitions. [2021-08-25 20:37:10,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:10,406 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 4833 transitions. [2021-08-25 20:37:10,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-08-25 20:37:10,408 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:10,408 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:10,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2021-08-25 20:37:10,408 INFO L402 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:10,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:10,408 INFO L82 PathProgramCache]: Analyzing trace with hash -696355380, now seen corresponding path program 1 times [2021-08-25 20:37:10,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:10,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39132911] [2021-08-25 20:37:10,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:10,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:10,472 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2021-08-25 20:37:10,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:10,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39132911] [2021-08-25 20:37:10,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39132911] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:10,472 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:10,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:37:10,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796346362] [2021-08-25 20:37:10,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:37:10,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:10,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:37:10,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:37:10,473 INFO L87 Difference]: Start difference. First operand 3128 states and 4833 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) [2021-08-25 20:37:10,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:10,825 INFO L93 Difference]: Finished difference Result 5842 states and 8966 transitions. [2021-08-25 20:37:10,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:10,826 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 225 [2021-08-25 20:37:10,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:10,829 INFO L225 Difference]: With dead ends: 5842 [2021-08-25 20:37:10,829 INFO L226 Difference]: Without dead ends: 3343 [2021-08-25 20:37:10,830 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:10,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3343 states. [2021-08-25 20:37:10,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3343 to 3128. [2021-08-25 20:37:10,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3128 states, 3127 states have (on average 1.542053086024944) internal successors, (4822), 3127 states have internal predecessors, (4822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:10,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 4822 transitions. [2021-08-25 20:37:10,940 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 4822 transitions. Word has length 225 [2021-08-25 20:37:10,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:10,940 INFO L470 AbstractCegarLoop]: Abstraction has 3128 states and 4822 transitions. [2021-08-25 20:37:10,940 INFO L471 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) [2021-08-25 20:37:10,940 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 4822 transitions. [2021-08-25 20:37:10,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2021-08-25 20:37:10,942 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:10,942 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:10,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2021-08-25 20:37:10,943 INFO L402 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:10,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:10,943 INFO L82 PathProgramCache]: Analyzing trace with hash 799362375, now seen corresponding path program 1 times [2021-08-25 20:37:10,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:10,943 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489977534] [2021-08-25 20:37:10,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:10,943 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:11,005 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2021-08-25 20:37:11,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:11,006 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489977534] [2021-08-25 20:37:11,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489977534] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:11,006 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:11,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:37:11,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016034722] [2021-08-25 20:37:11,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:37:11,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:11,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:37:11,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:37:11,007 INFO L87 Difference]: Start difference. First operand 3128 states and 4822 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:11,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:11,342 INFO L93 Difference]: Finished difference Result 5802 states and 8899 transitions. [2021-08-25 20:37:11,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:11,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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 226 [2021-08-25 20:37:11,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:11,345 INFO L225 Difference]: With dead ends: 5802 [2021-08-25 20:37:11,345 INFO L226 Difference]: Without dead ends: 3303 [2021-08-25 20:37:11,347 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:11,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3303 states. [2021-08-25 20:37:11,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3303 to 3128. [2021-08-25 20:37:11,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3128 states, 3127 states have (on average 1.5385353373840742) internal successors, (4811), 3127 states have internal predecessors, (4811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:11,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 4811 transitions. [2021-08-25 20:37:11,442 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 4811 transitions. Word has length 226 [2021-08-25 20:37:11,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:11,442 INFO L470 AbstractCegarLoop]: Abstraction has 3128 states and 4811 transitions. [2021-08-25 20:37:11,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:11,442 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 4811 transitions. [2021-08-25 20:37:11,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-08-25 20:37:11,445 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:11,445 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:11,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2021-08-25 20:37:11,445 INFO L402 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:11,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:11,445 INFO L82 PathProgramCache]: Analyzing trace with hash -793821366, now seen corresponding path program 1 times [2021-08-25 20:37:11,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:11,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687151390] [2021-08-25 20:37:11,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:11,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2021-08-25 20:37:11,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:11,480 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687151390] [2021-08-25 20:37:11,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687151390] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:11,480 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:11,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:37:11,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890877250] [2021-08-25 20:37:11,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:37:11,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:11,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:37:11,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:37:11,481 INFO L87 Difference]: Start difference. First operand 3128 states and 4811 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:11,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:11,768 INFO L93 Difference]: Finished difference Result 5707 states and 8739 transitions. [2021-08-25 20:37:11,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:11,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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 232 [2021-08-25 20:37:11,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:11,771 INFO L225 Difference]: With dead ends: 5707 [2021-08-25 20:37:11,771 INFO L226 Difference]: Without dead ends: 3208 [2021-08-25 20:37:11,772 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:11,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2021-08-25 20:37:11,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 3128. [2021-08-25 20:37:11,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3128 states, 3127 states have (on average 1.5375759513911096) internal successors, (4808), 3127 states have internal predecessors, (4808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:11,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 4808 transitions. [2021-08-25 20:37:11,881 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 4808 transitions. Word has length 232 [2021-08-25 20:37:11,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:11,881 INFO L470 AbstractCegarLoop]: Abstraction has 3128 states and 4808 transitions. [2021-08-25 20:37:11,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:11,881 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 4808 transitions. [2021-08-25 20:37:11,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2021-08-25 20:37:11,883 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:11,883 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:11,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2021-08-25 20:37:11,883 INFO L402 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:11,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:11,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1307318225, now seen corresponding path program 1 times [2021-08-25 20:37:11,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:11,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894959170] [2021-08-25 20:37:11,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:11,884 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2021-08-25 20:37:11,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:11,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894959170] [2021-08-25 20:37:11,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894959170] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:11,918 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:11,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:37:11,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167090325] [2021-08-25 20:37:11,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:37:11,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:11,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:37:11,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:37:11,919 INFO L87 Difference]: Start difference. First operand 3128 states and 4808 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:12,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:12,192 INFO L93 Difference]: Finished difference Result 5695 states and 8718 transitions. [2021-08-25 20:37:12,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:12,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 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 233 [2021-08-25 20:37:12,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:12,195 INFO L225 Difference]: With dead ends: 5695 [2021-08-25 20:37:12,195 INFO L226 Difference]: Without dead ends: 3196 [2021-08-25 20:37:12,196 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3196 states. [2021-08-25 20:37:12,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3196 to 3128. [2021-08-25 20:37:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3128 states, 3127 states have (on average 1.5366165653981452) internal successors, (4805), 3127 states have internal predecessors, (4805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:12,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 4805 transitions. [2021-08-25 20:37:12,289 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 4805 transitions. Word has length 233 [2021-08-25 20:37:12,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:12,289 INFO L470 AbstractCegarLoop]: Abstraction has 3128 states and 4805 transitions. [2021-08-25 20:37:12,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 4805 transitions. [2021-08-25 20:37:12,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2021-08-25 20:37:12,291 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:12,291 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:12,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2021-08-25 20:37:12,291 INFO L402 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:12,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:12,291 INFO L82 PathProgramCache]: Analyzing trace with hash 47555143, now seen corresponding path program 2 times [2021-08-25 20:37:12,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:12,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203405533] [2021-08-25 20:37:12,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:12,292 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:12,468 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 57 proven. 384 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:37:12,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:12,469 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203405533] [2021-08-25 20:37:12,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203405533] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:37:12,469 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039035182] [2021-08-25 20:37:12,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 20:37:12,469 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:37:12,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:37:12,470 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:37:12,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-25 20:37:13,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-25 20:37:13,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:37:13,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 36 conjunts are in the unsatisfiable core [2021-08-25 20:37:13,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:37:13,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:13,358 INFO L354 Elim1Store]: treesize reduction 84, result has 47.2 percent of original size [2021-08-25 20:37:13,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 246 treesize of output 220 [2021-08-25 20:37:13,387 INFO L354 Elim1Store]: treesize reduction 43, result has 36.8 percent of original size [2021-08-25 20:37:13,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 220 treesize of output 190 [2021-08-25 20:37:13,416 INFO L354 Elim1Store]: treesize reduction 27, result has 41.3 percent of original size [2021-08-25 20:37:13,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 142 [2021-08-25 20:37:13,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:13,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 108 [2021-08-25 20:37:13,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:13,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 89 [2021-08-25 20:37:14,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:14,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 112 [2021-08-25 20:37:14,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:14,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:14,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:14,615 INFO L354 Elim1Store]: treesize reduction 128, result has 27.3 percent of original size [2021-08-25 20:37:14,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 121 treesize of output 128 [2021-08-25 20:37:14,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:14,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 112 [2021-08-25 20:37:15,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:15,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:15,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:15,045 INFO L354 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2021-08-25 20:37:15,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 142 treesize of output 116 [2021-08-25 20:37:15,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:15,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 80 [2021-08-25 20:37:15,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:15,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 61 [2021-08-25 20:37:15,225 INFO L354 Elim1Store]: treesize reduction 59, result has 13.2 percent of original size [2021-08-25 20:37:15,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 318 treesize of output 248 [2021-08-25 20:37:15,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:15,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 269 treesize of output 199 [2021-08-25 20:37:15,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:15,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 180 [2021-08-25 20:37:15,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:15,252 INFO L354 Elim1Store]: treesize reduction 163, result has 11.4 percent of original size [2021-08-25 20:37:15,253 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 196 [2021-08-25 20:37:15,264 INFO L354 Elim1Store]: treesize reduction 55, result has 14.1 percent of original size [2021-08-25 20:37:15,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 162 [2021-08-25 20:37:15,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:15,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 113 [2021-08-25 20:37:15,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:15,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 94 [2021-08-25 20:37:15,844 INFO L388 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 94 treesize of output 76 [2021-08-25 20:37:15,847 INFO L388 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 76 treesize of output 58 [2021-08-25 20:37:15,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:15,866 INFO L354 Elim1Store]: treesize reduction 55, result has 27.6 percent of original size [2021-08-25 20:37:15,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 59 [2021-08-25 20:37:18,308 INFO L354 Elim1Store]: treesize reduction 18, result has 37.9 percent of original size [2021-08-25 20:37:18,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 46 [2021-08-25 20:37:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 326 proven. 115 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:37:18,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039035182] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:37:18,331 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:37:18,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2021-08-25 20:37:18,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297800365] [2021-08-25 20:37:18,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-25 20:37:18,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:18,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-25 20:37:18,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2021-08-25 20:37:18,332 INFO L87 Difference]: Start difference. First operand 3128 states and 4805 transitions. Second operand has 19 states, 19 states have (on average 17.473684210526315) internal successors, (332), 19 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:25,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:25,617 INFO L93 Difference]: Finished difference Result 16308 states and 24611 transitions. [2021-08-25 20:37:25,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-08-25 20:37:25,618 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 17.473684210526315) internal successors, (332), 19 states have internal predecessors, (332), 0 states have call successors, (0), 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 233 [2021-08-25 20:37:25,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:25,629 INFO L225 Difference]: With dead ends: 16308 [2021-08-25 20:37:25,629 INFO L226 Difference]: Without dead ends: 13228 [2021-08-25 20:37:25,631 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1140.9ms TimeCoverageRelationStatistics Valid=342, Invalid=1464, Unknown=0, NotChecked=0, Total=1806 [2021-08-25 20:37:25,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13228 states. [2021-08-25 20:37:25,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13228 to 6959. [2021-08-25 20:37:25,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6959 states, 6958 states have (on average 1.5895372233400402) internal successors, (11060), 6958 states have internal predecessors, (11060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:25,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6959 states to 6959 states and 11060 transitions. [2021-08-25 20:37:25,874 INFO L78 Accepts]: Start accepts. Automaton has 6959 states and 11060 transitions. Word has length 233 [2021-08-25 20:37:25,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:25,874 INFO L470 AbstractCegarLoop]: Abstraction has 6959 states and 11060 transitions. [2021-08-25 20:37:25,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 17.473684210526315) internal successors, (332), 19 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:25,874 INFO L276 IsEmpty]: Start isEmpty. Operand 6959 states and 11060 transitions. [2021-08-25 20:37:25,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2021-08-25 20:37:25,877 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:25,877 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:25,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-25 20:37:26,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:37:26,077 INFO L402 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:26,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:26,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1082686646, now seen corresponding path program 1 times [2021-08-25 20:37:26,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:26,078 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967266414] [2021-08-25 20:37:26,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:26,078 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:26,123 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2021-08-25 20:37:26,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:26,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967266414] [2021-08-25 20:37:26,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967266414] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:26,124 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:26,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:37:26,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906913073] [2021-08-25 20:37:26,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:37:26,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:26,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:37:26,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:37:26,125 INFO L87 Difference]: Start difference. First operand 6959 states and 11060 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:26,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:26,607 INFO L93 Difference]: Finished difference Result 13984 states and 22197 transitions. [2021-08-25 20:37:26,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:26,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 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 246 [2021-08-25 20:37:26,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:26,614 INFO L225 Difference]: With dead ends: 13984 [2021-08-25 20:37:26,614 INFO L226 Difference]: Without dead ends: 7073 [2021-08-25 20:37:26,617 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:26,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7073 states. [2021-08-25 20:37:26,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7073 to 6959. [2021-08-25 20:37:26,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6959 states, 6958 states have (on average 1.5882437482035068) internal successors, (11051), 6958 states have internal predecessors, (11051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:26,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6959 states to 6959 states and 11051 transitions. [2021-08-25 20:37:26,840 INFO L78 Accepts]: Start accepts. Automaton has 6959 states and 11051 transitions. Word has length 246 [2021-08-25 20:37:26,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:26,840 INFO L470 AbstractCegarLoop]: Abstraction has 6959 states and 11051 transitions. [2021-08-25 20:37:26,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:26,840 INFO L276 IsEmpty]: Start isEmpty. Operand 6959 states and 11051 transitions. [2021-08-25 20:37:26,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2021-08-25 20:37:26,843 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:26,843 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:26,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2021-08-25 20:37:26,843 INFO L402 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:26,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:26,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1029855299, now seen corresponding path program 1 times [2021-08-25 20:37:26,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:26,843 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163666344] [2021-08-25 20:37:26,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:26,843 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:26,880 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 410 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2021-08-25 20:37:26,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:26,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163666344] [2021-08-25 20:37:26,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163666344] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:26,880 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:26,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:37:26,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923170924] [2021-08-25 20:37:26,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:37:26,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:26,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:37:26,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:37:26,881 INFO L87 Difference]: Start difference. First operand 6959 states and 11051 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:27,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:27,331 INFO L93 Difference]: Finished difference Result 13948 states and 22134 transitions. [2021-08-25 20:37:27,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:27,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 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 247 [2021-08-25 20:37:27,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:27,337 INFO L225 Difference]: With dead ends: 13948 [2021-08-25 20:37:27,337 INFO L226 Difference]: Without dead ends: 7037 [2021-08-25 20:37:27,339 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:27,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7037 states. [2021-08-25 20:37:27,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7037 to 6949. [2021-08-25 20:37:27,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6949 states, 6948 states have (on average 1.5877950489349453) internal successors, (11032), 6948 states have internal predecessors, (11032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:27,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6949 states to 6949 states and 11032 transitions. [2021-08-25 20:37:27,568 INFO L78 Accepts]: Start accepts. Automaton has 6949 states and 11032 transitions. Word has length 247 [2021-08-25 20:37:27,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:27,568 INFO L470 AbstractCegarLoop]: Abstraction has 6949 states and 11032 transitions. [2021-08-25 20:37:27,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:27,568 INFO L276 IsEmpty]: Start isEmpty. Operand 6949 states and 11032 transitions. [2021-08-25 20:37:27,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2021-08-25 20:37:27,570 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:27,571 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:27,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2021-08-25 20:37:27,571 INFO L402 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:27,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:27,571 INFO L82 PathProgramCache]: Analyzing trace with hash 100868208, now seen corresponding path program 1 times [2021-08-25 20:37:27,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:27,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677476627] [2021-08-25 20:37:27,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:27,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 319 proven. 124 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2021-08-25 20:37:27,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:27,713 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677476627] [2021-08-25 20:37:27,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677476627] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:37:27,713 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076431794] [2021-08-25 20:37:27,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:27,714 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:37:27,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:37:27,714 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:37:27,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-25 20:37:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:28,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 38 conjunts are in the unsatisfiable core [2021-08-25 20:37:28,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:37:28,580 INFO L354 Elim1Store]: treesize reduction 199, result has 12.3 percent of original size [2021-08-25 20:37:28,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 74 [2021-08-25 20:37:28,591 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:37:28,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 37 [2021-08-25 20:37:28,599 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:37:28,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2021-08-25 20:37:28,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 14 [2021-08-25 20:37:28,614 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:37:28,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:37:28,700 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:37:28,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:37:28,724 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-25 20:37:28,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2021-08-25 20:37:28,785 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:37:28,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:37:28,806 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:37:28,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:37:28,882 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-25 20:37:28,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2021-08-25 20:37:28,949 INFO L354 Elim1Store]: treesize reduction 59, result has 13.2 percent of original size [2021-08-25 20:37:28,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 44 [2021-08-25 20:37:28,982 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-25 20:37:28,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2021-08-25 20:37:29,064 INFO L354 Elim1Store]: treesize reduction 59, result has 13.2 percent of original size [2021-08-25 20:37:29,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 44 [2021-08-25 20:37:29,115 INFO L354 Elim1Store]: treesize reduction 160, result has 16.2 percent of original size [2021-08-25 20:37:29,115 INFO L388 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 2 case distinctions, treesize of input 275 treesize of output 205 [2021-08-25 20:37:29,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 215 [2021-08-25 20:37:29,131 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:37:29,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 311 treesize of output 287 [2021-08-25 20:37:29,173 INFO L354 Elim1Store]: treesize reduction 244, result has 13.2 percent of original size [2021-08-25 20:37:29,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 359 treesize of output 309 [2021-08-25 20:37:29,197 INFO L354 Elim1Store]: treesize reduction 108, result has 15.0 percent of original size [2021-08-25 20:37:29,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 375 treesize of output 320 [2021-08-25 20:37:29,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:29,253 INFO L354 Elim1Store]: treesize reduction 83, result has 34.1 percent of original size [2021-08-25 20:37:29,253 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 83 [2021-08-25 20:37:29,301 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-08-25 20:37:29,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 121 [2021-08-25 20:37:29,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:29,325 INFO L354 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2021-08-25 20:37:29,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 37 [2021-08-25 20:37:29,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:29,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2021-08-25 20:37:29,680 INFO L388 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 81 treesize of output 63 [2021-08-25 20:37:29,681 INFO L388 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 63 treesize of output 51 [2021-08-25 20:37:29,698 INFO L354 Elim1Store]: treesize reduction 104, result has 15.4 percent of original size [2021-08-25 20:37:29,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 41 [2021-08-25 20:37:29,776 INFO L354 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2021-08-25 20:37:29,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 17 [2021-08-25 20:37:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 410 proven. 33 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2021-08-25 20:37:29,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076431794] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:37:29,917 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:37:29,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2021-08-25 20:37:29,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508481673] [2021-08-25 20:37:29,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-25 20:37:29,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:29,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-25 20:37:29,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:37:29,918 INFO L87 Difference]: Start difference. First operand 6949 states and 11032 transitions. Second operand has 8 states, 8 states have (on average 22.75) internal successors, (182), 8 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:31,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:31,105 INFO L93 Difference]: Finished difference Result 13823 states and 21856 transitions. [2021-08-25 20:37:31,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-25 20:37:31,106 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.75) internal successors, (182), 8 states have internal predecessors, (182), 0 states have call successors, (0), 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 247 [2021-08-25 20:37:31,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:31,112 INFO L225 Difference]: With dead ends: 13823 [2021-08-25 20:37:31,112 INFO L226 Difference]: Without dead ends: 7505 [2021-08-25 20:37:31,115 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 69.0ms TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-08-25 20:37:31,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7505 states. [2021-08-25 20:37:31,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7505 to 6949. [2021-08-25 20:37:31,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6949 states, 6948 states have (on average 1.587651122625216) internal successors, (11031), 6948 states have internal predecessors, (11031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:31,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6949 states to 6949 states and 11031 transitions. [2021-08-25 20:37:31,363 INFO L78 Accepts]: Start accepts. Automaton has 6949 states and 11031 transitions. Word has length 247 [2021-08-25 20:37:31,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:31,363 INFO L470 AbstractCegarLoop]: Abstraction has 6949 states and 11031 transitions. [2021-08-25 20:37:31,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.75) internal successors, (182), 8 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:31,364 INFO L276 IsEmpty]: Start isEmpty. Operand 6949 states and 11031 transitions. [2021-08-25 20:37:31,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2021-08-25 20:37:31,366 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:31,366 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:31,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-08-25 20:37:31,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:37:31,566 INFO L402 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:31,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:31,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1843429507, now seen corresponding path program 1 times [2021-08-25 20:37:31,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:31,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434980093] [2021-08-25 20:37:31,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:31,567 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:31,678 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 283 proven. 1 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2021-08-25 20:37:31,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:31,679 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434980093] [2021-08-25 20:37:31,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434980093] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:37:31,679 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553133536] [2021-08-25 20:37:31,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:31,679 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:37:31,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:37:31,680 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:37:31,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-25 20:37:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:32,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:37:32,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:37:32,808 INFO L354 Elim1Store]: treesize reduction 74, result has 46.0 percent of original size [2021-08-25 20:37:32,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 163 [2021-08-25 20:37:32,810 INFO L388 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 140 treesize of output 110 [2021-08-25 20:37:32,813 INFO L388 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 110 treesize of output 80 [2021-08-25 20:37:32,823 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-08-25 20:37:32,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2021-08-25 20:37:33,101 INFO L388 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 29 treesize of output 11 [2021-08-25 20:37:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2021-08-25 20:37:33,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553133536] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:33,197 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 20:37:33,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2021-08-25 20:37:33,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981853722] [2021-08-25 20:37:33,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:37:33,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:33,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:37:33,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-08-25 20:37:33,198 INFO L87 Difference]: Start difference. First operand 6949 states and 11031 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:33,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:33,690 INFO L93 Difference]: Finished difference Result 13629 states and 21602 transitions. [2021-08-25 20:37:33,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:33,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 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 252 [2021-08-25 20:37:33,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:33,697 INFO L225 Difference]: With dead ends: 13629 [2021-08-25 20:37:33,697 INFO L226 Difference]: Without dead ends: 7311 [2021-08-25 20:37:33,701 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 52.9ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-08-25 20:37:33,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7311 states. [2021-08-25 20:37:33,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7311 to 7121. [2021-08-25 20:37:33,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7121 states, 7120 states have (on average 1.589747191011236) internal successors, (11319), 7120 states have internal predecessors, (11319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:33,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7121 states to 7121 states and 11319 transitions. [2021-08-25 20:37:33,926 INFO L78 Accepts]: Start accepts. Automaton has 7121 states and 11319 transitions. Word has length 252 [2021-08-25 20:37:33,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:33,926 INFO L470 AbstractCegarLoop]: Abstraction has 7121 states and 11319 transitions. [2021-08-25 20:37:33,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 7121 states and 11319 transitions. [2021-08-25 20:37:33,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-08-25 20:37:33,929 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:33,929 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:33,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-08-25 20:37:34,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:37:34,131 INFO L402 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:34,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:34,131 INFO L82 PathProgramCache]: Analyzing trace with hash 124702107, now seen corresponding path program 1 times [2021-08-25 20:37:34,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:34,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111962914] [2021-08-25 20:37:34,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:34,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:34,244 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 283 proven. 1 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2021-08-25 20:37:34,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:34,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111962914] [2021-08-25 20:37:34,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111962914] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:37:34,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24598227] [2021-08-25 20:37:34,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:34,245 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:37:34,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:37:34,253 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:37:34,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-25 20:37:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:35,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:37:35,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:37:35,465 INFO L354 Elim1Store]: treesize reduction 74, result has 46.0 percent of original size [2021-08-25 20:37:35,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 163 [2021-08-25 20:37:35,467 INFO L388 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 140 treesize of output 110 [2021-08-25 20:37:35,469 INFO L388 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 110 treesize of output 80 [2021-08-25 20:37:35,489 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-08-25 20:37:35,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:37:35,538 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-08-25 20:37:35,761 INFO L388 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 29 treesize of output 11 [2021-08-25 20:37:35,845 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2021-08-25 20:37:35,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24598227] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:35,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 20:37:35,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2021-08-25 20:37:35,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153535574] [2021-08-25 20:37:35,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:37:35,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:35,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:37:35,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-08-25 20:37:35,852 INFO L87 Difference]: Start difference. First operand 7121 states and 11319 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:36,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:36,346 INFO L93 Difference]: Finished difference Result 13781 states and 21862 transitions. [2021-08-25 20:37:36,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:36,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 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 253 [2021-08-25 20:37:36,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:36,355 INFO L225 Difference]: With dead ends: 13781 [2021-08-25 20:37:36,355 INFO L226 Difference]: Without dead ends: 7283 [2021-08-25 20:37:36,359 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 55.6ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-08-25 20:37:36,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7283 states. [2021-08-25 20:37:36,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7283 to 7093. [2021-08-25 20:37:36,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7093 states, 7092 states have (on average 1.5909475465313028) internal successors, (11283), 7092 states have internal predecessors, (11283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:36,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7093 states to 7093 states and 11283 transitions. [2021-08-25 20:37:36,614 INFO L78 Accepts]: Start accepts. Automaton has 7093 states and 11283 transitions. Word has length 253 [2021-08-25 20:37:36,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:36,615 INFO L470 AbstractCegarLoop]: Abstraction has 7093 states and 11283 transitions. [2021-08-25 20:37:36,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:36,615 INFO L276 IsEmpty]: Start isEmpty. Operand 7093 states and 11283 transitions. [2021-08-25 20:37:36,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2021-08-25 20:37:36,618 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:36,618 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:36,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-25 20:37:36,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:37:36,818 INFO L402 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:36,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:36,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1923758493, now seen corresponding path program 1 times [2021-08-25 20:37:36,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:36,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162394172] [2021-08-25 20:37:36,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:36,819 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:36,856 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 399 proven. 0 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2021-08-25 20:37:36,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:36,857 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162394172] [2021-08-25 20:37:36,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162394172] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:36,857 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:36,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:37:36,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084711109] [2021-08-25 20:37:36,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:37:36,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:36,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:37:36,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:37:36,858 INFO L87 Difference]: Start difference. First operand 7093 states and 11283 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:37,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:37,294 INFO L93 Difference]: Finished difference Result 13623 states and 21661 transitions. [2021-08-25 20:37:37,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:37,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 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 254 [2021-08-25 20:37:37,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:37,300 INFO L225 Difference]: With dead ends: 13623 [2021-08-25 20:37:37,300 INFO L226 Difference]: Without dead ends: 7161 [2021-08-25 20:37:37,303 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:37,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7161 states. [2021-08-25 20:37:37,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7161 to 7093. [2021-08-25 20:37:37,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7093 states, 7092 states have (on average 1.5905245346869712) internal successors, (11280), 7092 states have internal predecessors, (11280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:37,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7093 states to 7093 states and 11280 transitions. [2021-08-25 20:37:37,531 INFO L78 Accepts]: Start accepts. Automaton has 7093 states and 11280 transitions. Word has length 254 [2021-08-25 20:37:37,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:37,532 INFO L470 AbstractCegarLoop]: Abstraction has 7093 states and 11280 transitions. [2021-08-25 20:37:37,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:37,532 INFO L276 IsEmpty]: Start isEmpty. Operand 7093 states and 11280 transitions. [2021-08-25 20:37:37,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2021-08-25 20:37:37,535 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:37,535 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:37,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2021-08-25 20:37:37,535 INFO L402 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:37,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:37,535 INFO L82 PathProgramCache]: Analyzing trace with hash 768031272, now seen corresponding path program 1 times [2021-08-25 20:37:37,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:37,535 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57091873] [2021-08-25 20:37:37,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:37,535 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:37,574 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2021-08-25 20:37:37,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:37,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57091873] [2021-08-25 20:37:37,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57091873] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:37,574 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:37,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:37:37,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611284320] [2021-08-25 20:37:37,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:37:37,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:37,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:37:37,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:37:37,575 INFO L87 Difference]: Start difference. First operand 7093 states and 11280 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:38,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:38,037 INFO L93 Difference]: Finished difference Result 13609 states and 21636 transitions. [2021-08-25 20:37:38,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:38,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 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 255 [2021-08-25 20:37:38,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:38,044 INFO L225 Difference]: With dead ends: 13609 [2021-08-25 20:37:38,044 INFO L226 Difference]: Without dead ends: 7147 [2021-08-25 20:37:38,048 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:38,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7147 states. [2021-08-25 20:37:38,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7147 to 7093. [2021-08-25 20:37:38,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7093 states, 7092 states have (on average 1.5901015228426396) internal successors, (11277), 7092 states have internal predecessors, (11277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7093 states to 7093 states and 11277 transitions. [2021-08-25 20:37:38,328 INFO L78 Accepts]: Start accepts. Automaton has 7093 states and 11277 transitions. Word has length 255 [2021-08-25 20:37:38,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:38,328 INFO L470 AbstractCegarLoop]: Abstraction has 7093 states and 11277 transitions. [2021-08-25 20:37:38,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:38,328 INFO L276 IsEmpty]: Start isEmpty. Operand 7093 states and 11277 transitions. [2021-08-25 20:37:38,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2021-08-25 20:37:38,331 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:38,331 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:38,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2021-08-25 20:37:38,332 INFO L402 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:38,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:38,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1052261001, now seen corresponding path program 1 times [2021-08-25 20:37:38,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:38,332 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582834269] [2021-08-25 20:37:38,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:38,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:38,403 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 425 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2021-08-25 20:37:38,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:38,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582834269] [2021-08-25 20:37:38,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582834269] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:38,403 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:38,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:37:38,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003289797] [2021-08-25 20:37:38,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:37:38,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:38,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:37:38,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:38,404 INFO L87 Difference]: Start difference. First operand 7093 states and 11277 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:39,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:39,076 INFO L93 Difference]: Finished difference Result 14833 states and 23429 transitions. [2021-08-25 20:37:39,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:39,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 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 262 [2021-08-25 20:37:39,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:39,101 INFO L225 Difference]: With dead ends: 14833 [2021-08-25 20:37:39,101 INFO L226 Difference]: Without dead ends: 7788 [2021-08-25 20:37:39,106 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 11.4ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:37:39,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7788 states. [2021-08-25 20:37:39,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7788 to 7093. [2021-08-25 20:37:39,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7093 states, 7092 states have (on average 1.5769881556683587) internal successors, (11184), 7092 states have internal predecessors, (11184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7093 states to 7093 states and 11184 transitions. [2021-08-25 20:37:39,393 INFO L78 Accepts]: Start accepts. Automaton has 7093 states and 11184 transitions. Word has length 262 [2021-08-25 20:37:39,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:39,393 INFO L470 AbstractCegarLoop]: Abstraction has 7093 states and 11184 transitions. [2021-08-25 20:37:39,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:39,393 INFO L276 IsEmpty]: Start isEmpty. Operand 7093 states and 11184 transitions. [2021-08-25 20:37:39,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2021-08-25 20:37:39,396 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:39,396 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:39,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2021-08-25 20:37:39,397 INFO L402 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:39,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:39,397 INFO L82 PathProgramCache]: Analyzing trace with hash -2012211526, now seen corresponding path program 1 times [2021-08-25 20:37:39,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:39,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867895712] [2021-08-25 20:37:39,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:39,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:39,467 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2021-08-25 20:37:39,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:39,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867895712] [2021-08-25 20:37:39,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867895712] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:39,468 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:39,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:37:39,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892622906] [2021-08-25 20:37:39,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:37:39,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:39,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:37:39,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:39,469 INFO L87 Difference]: Start difference. First operand 7093 states and 11184 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:40,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:40,136 INFO L93 Difference]: Finished difference Result 14817 states and 23227 transitions. [2021-08-25 20:37:40,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:40,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 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 263 [2021-08-25 20:37:40,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:40,144 INFO L225 Difference]: With dead ends: 14817 [2021-08-25 20:37:40,144 INFO L226 Difference]: Without dead ends: 7772 [2021-08-25 20:37:40,148 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 11.2ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:37:40,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7772 states. [2021-08-25 20:37:40,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7772 to 7093. [2021-08-25 20:37:40,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7093 states, 7092 states have (on average 1.5638747884940778) internal successors, (11091), 7092 states have internal predecessors, (11091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7093 states to 7093 states and 11091 transitions. [2021-08-25 20:37:40,390 INFO L78 Accepts]: Start accepts. Automaton has 7093 states and 11091 transitions. Word has length 263 [2021-08-25 20:37:40,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:40,390 INFO L470 AbstractCegarLoop]: Abstraction has 7093 states and 11091 transitions. [2021-08-25 20:37:40,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:40,390 INFO L276 IsEmpty]: Start isEmpty. Operand 7093 states and 11091 transitions. [2021-08-25 20:37:40,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2021-08-25 20:37:40,393 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:40,393 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:40,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2021-08-25 20:37:40,393 INFO L402 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:40,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:40,394 INFO L82 PathProgramCache]: Analyzing trace with hash -782763583, now seen corresponding path program 1 times [2021-08-25 20:37:40,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:40,394 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720945243] [2021-08-25 20:37:40,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:40,394 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:40,476 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 435 proven. 20 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2021-08-25 20:37:40,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:40,477 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720945243] [2021-08-25 20:37:40,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720945243] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:37:40,477 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815741301] [2021-08-25 20:37:40,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:40,477 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:37:40,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:37:40,478 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:37:40,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-25 20:37:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:41,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-25 20:37:41,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:37:41,762 INFO L388 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 20 treesize of output 8 [2021-08-25 20:37:41,873 INFO L354 Elim1Store]: treesize reduction 74, result has 46.0 percent of original size [2021-08-25 20:37:41,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 163 [2021-08-25 20:37:41,875 INFO L388 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 140 treesize of output 110 [2021-08-25 20:37:41,876 INFO L388 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 110 treesize of output 80 [2021-08-25 20:37:41,893 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-08-25 20:37:41,946 INFO L354 Elim1Store]: treesize reduction 5, result has 68.8 percent of original size [2021-08-25 20:37:41,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-08-25 20:37:42,067 INFO L388 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 29 treesize of output 11 [2021-08-25 20:37:42,199 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 435 proven. 20 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2021-08-25 20:37:42,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815741301] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:37:42,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:37:42,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-08-25 20:37:42,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712552492] [2021-08-25 20:37:42,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-25 20:37:42,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:42,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-25 20:37:42,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-25 20:37:42,200 INFO L87 Difference]: Start difference. First operand 7093 states and 11091 transitions. Second operand has 9 states, 9 states have (on average 20.11111111111111) internal successors, (181), 9 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:43,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:43,382 INFO L93 Difference]: Finished difference Result 15064 states and 23348 transitions. [2021-08-25 20:37:43,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-25 20:37:43,383 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.11111111111111) internal successors, (181), 9 states have internal predecessors, (181), 0 states have call successors, (0), 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 265 [2021-08-25 20:37:43,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:43,392 INFO L225 Difference]: With dead ends: 15064 [2021-08-25 20:37:43,392 INFO L226 Difference]: Without dead ends: 7992 [2021-08-25 20:37:43,397 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 93.4ms TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2021-08-25 20:37:43,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7992 states. [2021-08-25 20:37:43,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7992 to 7093. [2021-08-25 20:37:43,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7093 states, 7092 states have (on average 1.5272137619853356) internal successors, (10831), 7092 states have internal predecessors, (10831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:43,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7093 states to 7093 states and 10831 transitions. [2021-08-25 20:37:43,680 INFO L78 Accepts]: Start accepts. Automaton has 7093 states and 10831 transitions. Word has length 265 [2021-08-25 20:37:43,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:43,680 INFO L470 AbstractCegarLoop]: Abstraction has 7093 states and 10831 transitions. [2021-08-25 20:37:43,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.11111111111111) internal successors, (181), 9 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:43,681 INFO L276 IsEmpty]: Start isEmpty. Operand 7093 states and 10831 transitions. [2021-08-25 20:37:43,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2021-08-25 20:37:43,683 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:43,684 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1] [2021-08-25 20:37:43,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-25 20:37:43,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable147 [2021-08-25 20:37:43,886 INFO L402 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:43,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:43,886 INFO L82 PathProgramCache]: Analyzing trace with hash -739980738, now seen corresponding path program 1 times [2021-08-25 20:37:43,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:43,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628383215] [2021-08-25 20:37:43,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:43,886 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2021-08-25 20:37:43,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:43,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628383215] [2021-08-25 20:37:43,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628383215] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:43,959 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:43,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:37:43,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364317941] [2021-08-25 20:37:43,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:37:43,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:43,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:37:43,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:43,960 INFO L87 Difference]: Start difference. First operand 7093 states and 10831 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:44,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:44,632 INFO L93 Difference]: Finished difference Result 14817 states and 22522 transitions. [2021-08-25 20:37:44,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:44,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 0 states have call successors, (0), 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 266 [2021-08-25 20:37:44,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:44,641 INFO L225 Difference]: With dead ends: 14817 [2021-08-25 20:37:44,641 INFO L226 Difference]: Without dead ends: 7772 [2021-08-25 20:37:44,645 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 10.8ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:37:44,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7772 states. [2021-08-25 20:37:44,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7772 to 7093. [2021-08-25 20:37:44,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7093 states, 7092 states have (on average 1.5128313592780598) internal successors, (10729), 7092 states have internal predecessors, (10729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:44,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7093 states to 7093 states and 10729 transitions. [2021-08-25 20:37:44,902 INFO L78 Accepts]: Start accepts. Automaton has 7093 states and 10729 transitions. Word has length 266 [2021-08-25 20:37:44,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:44,902 INFO L470 AbstractCegarLoop]: Abstraction has 7093 states and 10729 transitions. [2021-08-25 20:37:44,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:44,902 INFO L276 IsEmpty]: Start isEmpty. Operand 7093 states and 10729 transitions. [2021-08-25 20:37:44,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-08-25 20:37:44,905 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:44,905 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 8, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:44,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2021-08-25 20:37:44,905 INFO L402 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:44,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:44,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1025512753, now seen corresponding path program 1 times [2021-08-25 20:37:44,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:44,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271850906] [2021-08-25 20:37:44,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:44,906 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:44,946 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2021-08-25 20:37:44,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:44,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271850906] [2021-08-25 20:37:44,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271850906] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:44,946 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:44,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:37:44,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464567322] [2021-08-25 20:37:44,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:37:44,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:44,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:37:44,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:37:44,947 INFO L87 Difference]: Start difference. First operand 7093 states and 10729 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:45,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:45,425 INFO L93 Difference]: Finished difference Result 14240 states and 21519 transitions. [2021-08-25 20:37:45,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:45,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 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 268 [2021-08-25 20:37:45,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:45,433 INFO L225 Difference]: With dead ends: 14240 [2021-08-25 20:37:45,433 INFO L226 Difference]: Without dead ends: 7195 [2021-08-25 20:37:45,438 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:45,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7195 states. [2021-08-25 20:37:45,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7195 to 7093. [2021-08-25 20:37:45,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7093 states, 7092 states have (on average 1.5115623237450648) internal successors, (10720), 7092 states have internal predecessors, (10720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:45,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7093 states to 7093 states and 10720 transitions. [2021-08-25 20:37:45,692 INFO L78 Accepts]: Start accepts. Automaton has 7093 states and 10720 transitions. Word has length 268 [2021-08-25 20:37:45,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:45,692 INFO L470 AbstractCegarLoop]: Abstraction has 7093 states and 10720 transitions. [2021-08-25 20:37:45,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:45,692 INFO L276 IsEmpty]: Start isEmpty. Operand 7093 states and 10720 transitions. [2021-08-25 20:37:45,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-08-25 20:37:45,695 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:45,695 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:45,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2021-08-25 20:37:45,695 INFO L402 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:45,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:45,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1934983069, now seen corresponding path program 1 times [2021-08-25 20:37:45,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:45,696 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125813288] [2021-08-25 20:37:45,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:45,696 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:45,744 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2021-08-25 20:37:45,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:45,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125813288] [2021-08-25 20:37:45,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125813288] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:45,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:45,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:37:45,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037292631] [2021-08-25 20:37:45,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:37:45,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:45,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:37:45,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:37:45,746 INFO L87 Difference]: Start difference. First operand 7093 states and 10720 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:46,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:46,199 INFO L93 Difference]: Finished difference Result 14489 states and 21899 transitions. [2021-08-25 20:37:46,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:46,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 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 268 [2021-08-25 20:37:46,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:46,207 INFO L225 Difference]: With dead ends: 14489 [2021-08-25 20:37:46,207 INFO L226 Difference]: Without dead ends: 7444 [2021-08-25 20:37:46,211 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:46,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7444 states. [2021-08-25 20:37:46,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7444 to 7282. [2021-08-25 20:37:46,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7282 states, 7281 states have (on average 1.5118802362312869) internal successors, (11008), 7281 states have internal predecessors, (11008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:46,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7282 states to 7282 states and 11008 transitions. [2021-08-25 20:37:46,493 INFO L78 Accepts]: Start accepts. Automaton has 7282 states and 11008 transitions. Word has length 268 [2021-08-25 20:37:46,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:46,493 INFO L470 AbstractCegarLoop]: Abstraction has 7282 states and 11008 transitions. [2021-08-25 20:37:46,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:46,493 INFO L276 IsEmpty]: Start isEmpty. Operand 7282 states and 11008 transitions. [2021-08-25 20:37:46,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2021-08-25 20:37:46,496 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:46,496 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 8, 7, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:46,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2021-08-25 20:37:46,496 INFO L402 AbstractCegarLoop]: === Iteration 152 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:46,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:46,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1451121860, now seen corresponding path program 1 times [2021-08-25 20:37:46,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:46,497 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640579809] [2021-08-25 20:37:46,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:46,497 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:46,536 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 483 proven. 0 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2021-08-25 20:37:46,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:46,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640579809] [2021-08-25 20:37:46,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640579809] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:46,537 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:46,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:37:46,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056513963] [2021-08-25 20:37:46,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:37:46,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:46,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:37:46,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:37:46,538 INFO L87 Difference]: Start difference. First operand 7282 states and 11008 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:46,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:46,984 INFO L93 Difference]: Finished difference Result 14582 states and 22030 transitions. [2021-08-25 20:37:46,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:46,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 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 269 [2021-08-25 20:37:46,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:46,992 INFO L225 Difference]: With dead ends: 14582 [2021-08-25 20:37:46,992 INFO L226 Difference]: Without dead ends: 7348 [2021-08-25 20:37:46,996 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:46,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7348 states. [2021-08-25 20:37:47,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7348 to 7272. [2021-08-25 20:37:47,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7272 states, 7271 states have (on average 1.5113464447806355) internal successors, (10989), 7271 states have internal predecessors, (10989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:47,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7272 states to 7272 states and 10989 transitions. [2021-08-25 20:37:47,249 INFO L78 Accepts]: Start accepts. Automaton has 7272 states and 10989 transitions. Word has length 269 [2021-08-25 20:37:47,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:47,249 INFO L470 AbstractCegarLoop]: Abstraction has 7272 states and 10989 transitions. [2021-08-25 20:37:47,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 7272 states and 10989 transitions. [2021-08-25 20:37:47,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2021-08-25 20:37:47,252 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:47,252 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:47,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2021-08-25 20:37:47,252 INFO L402 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:47,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:47,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1345156297, now seen corresponding path program 1 times [2021-08-25 20:37:47,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:47,252 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099729032] [2021-08-25 20:37:47,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:47,253 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:47,300 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2021-08-25 20:37:47,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:47,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099729032] [2021-08-25 20:37:47,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099729032] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:47,300 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:47,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:37:47,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930460673] [2021-08-25 20:37:47,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:37:47,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:47,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:37:47,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:37:47,301 INFO L87 Difference]: Start difference. First operand 7272 states and 10989 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:47,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:47,828 INFO L93 Difference]: Finished difference Result 14835 states and 22378 transitions. [2021-08-25 20:37:47,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:47,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 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 269 [2021-08-25 20:37:47,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:47,835 INFO L225 Difference]: With dead ends: 14835 [2021-08-25 20:37:47,836 INFO L226 Difference]: Without dead ends: 7611 [2021-08-25 20:37:47,838 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:47,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7611 states. [2021-08-25 20:37:48,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7611 to 7365. [2021-08-25 20:37:48,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7365 states, 7364 states have (on average 1.512221618685497) internal successors, (11136), 7364 states have internal predecessors, (11136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:48,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7365 states to 7365 states and 11136 transitions. [2021-08-25 20:37:48,086 INFO L78 Accepts]: Start accepts. Automaton has 7365 states and 11136 transitions. Word has length 269 [2021-08-25 20:37:48,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:48,086 INFO L470 AbstractCegarLoop]: Abstraction has 7365 states and 11136 transitions. [2021-08-25 20:37:48,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:48,086 INFO L276 IsEmpty]: Start isEmpty. Operand 7365 states and 11136 transitions. [2021-08-25 20:37:48,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2021-08-25 20:37:48,089 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:48,089 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:48,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2021-08-25 20:37:48,089 INFO L402 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:48,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:48,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1936073070, now seen corresponding path program 1 times [2021-08-25 20:37:48,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:48,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768532977] [2021-08-25 20:37:48,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:48,090 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:48,130 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 448 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2021-08-25 20:37:48,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:48,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768532977] [2021-08-25 20:37:48,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768532977] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:48,130 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:48,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:37:48,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547497470] [2021-08-25 20:37:48,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:37:48,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:48,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:37:48,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:37:48,131 INFO L87 Difference]: Start difference. First operand 7365 states and 11136 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:48,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:48,570 INFO L93 Difference]: Finished difference Result 14131 states and 21360 transitions. [2021-08-25 20:37:48,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:48,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 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 272 [2021-08-25 20:37:48,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:48,578 INFO L225 Difference]: With dead ends: 14131 [2021-08-25 20:37:48,578 INFO L226 Difference]: Without dead ends: 7419 [2021-08-25 20:37:48,581 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:48,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7419 states. [2021-08-25 20:37:48,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7419 to 7365. [2021-08-25 20:37:48,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7365 states, 7364 states have (on average 1.5118142313959804) internal successors, (11133), 7364 states have internal predecessors, (11133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:48,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7365 states to 7365 states and 11133 transitions. [2021-08-25 20:37:48,827 INFO L78 Accepts]: Start accepts. Automaton has 7365 states and 11133 transitions. Word has length 272 [2021-08-25 20:37:48,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:48,827 INFO L470 AbstractCegarLoop]: Abstraction has 7365 states and 11133 transitions. [2021-08-25 20:37:48,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:48,828 INFO L276 IsEmpty]: Start isEmpty. Operand 7365 states and 11133 transitions. [2021-08-25 20:37:48,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2021-08-25 20:37:48,830 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:48,830 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:48,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2021-08-25 20:37:48,831 INFO L402 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:48,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:48,831 INFO L82 PathProgramCache]: Analyzing trace with hash -795196958, now seen corresponding path program 1 times [2021-08-25 20:37:48,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:48,831 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905474382] [2021-08-25 20:37:48,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:48,831 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2021-08-25 20:37:48,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:48,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905474382] [2021-08-25 20:37:48,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905474382] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:48,902 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:48,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:37:48,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753941653] [2021-08-25 20:37:48,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:37:48,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:48,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:37:48,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:48,903 INFO L87 Difference]: Start difference. First operand 7365 states and 11133 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:49,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:49,689 INFO L93 Difference]: Finished difference Result 15361 states and 23126 transitions. [2021-08-25 20:37:49,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:49,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 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 272 [2021-08-25 20:37:49,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:49,697 INFO L225 Difference]: With dead ends: 15361 [2021-08-25 20:37:49,697 INFO L226 Difference]: Without dead ends: 8044 [2021-08-25 20:37:49,702 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 11.9ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:37:49,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8044 states. [2021-08-25 20:37:49,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8044 to 7365. [2021-08-25 20:37:49,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7365 states, 7364 states have (on average 1.5062466051059207) internal successors, (11092), 7364 states have internal predecessors, (11092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:49,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7365 states to 7365 states and 11092 transitions. [2021-08-25 20:37:49,958 INFO L78 Accepts]: Start accepts. Automaton has 7365 states and 11092 transitions. Word has length 272 [2021-08-25 20:37:49,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:49,958 INFO L470 AbstractCegarLoop]: Abstraction has 7365 states and 11092 transitions. [2021-08-25 20:37:49,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:49,958 INFO L276 IsEmpty]: Start isEmpty. Operand 7365 states and 11092 transitions. [2021-08-25 20:37:49,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2021-08-25 20:37:49,961 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:49,961 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:49,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2021-08-25 20:37:49,961 INFO L402 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:49,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:49,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1641680969, now seen corresponding path program 1 times [2021-08-25 20:37:49,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:49,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601365952] [2021-08-25 20:37:49,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:49,962 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2021-08-25 20:37:50,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:50,005 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601365952] [2021-08-25 20:37:50,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601365952] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:50,005 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:50,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:37:50,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499649309] [2021-08-25 20:37:50,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:37:50,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:50,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:37:50,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:37:50,006 INFO L87 Difference]: Start difference. First operand 7365 states and 11092 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:50,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:50,412 INFO L93 Difference]: Finished difference Result 14121 states and 21264 transitions. [2021-08-25 20:37:50,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:50,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 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 273 [2021-08-25 20:37:50,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:50,420 INFO L225 Difference]: With dead ends: 14121 [2021-08-25 20:37:50,420 INFO L226 Difference]: Without dead ends: 7409 [2021-08-25 20:37:50,424 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:50,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7409 states. [2021-08-25 20:37:50,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7409 to 7365. [2021-08-25 20:37:50,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7365 states, 7364 states have (on average 1.5058392178164042) internal successors, (11089), 7364 states have internal predecessors, (11089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:50,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7365 states to 7365 states and 11089 transitions. [2021-08-25 20:37:50,673 INFO L78 Accepts]: Start accepts. Automaton has 7365 states and 11089 transitions. Word has length 273 [2021-08-25 20:37:50,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:50,673 INFO L470 AbstractCegarLoop]: Abstraction has 7365 states and 11089 transitions. [2021-08-25 20:37:50,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:50,673 INFO L276 IsEmpty]: Start isEmpty. Operand 7365 states and 11089 transitions. [2021-08-25 20:37:50,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2021-08-25 20:37:50,676 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:50,676 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:50,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2021-08-25 20:37:50,676 INFO L402 AbstractCegarLoop]: === Iteration 157 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:50,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:50,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1457289088, now seen corresponding path program 1 times [2021-08-25 20:37:50,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:50,677 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771155402] [2021-08-25 20:37:50,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:50,677 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:50,787 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 437 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2021-08-25 20:37:50,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:50,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771155402] [2021-08-25 20:37:50,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771155402] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:50,787 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:50,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:37:50,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402862512] [2021-08-25 20:37:50,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:37:50,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:50,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:37:50,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:50,788 INFO L87 Difference]: Start difference. First operand 7365 states and 11089 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:51,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:51,434 INFO L93 Difference]: Finished difference Result 15361 states and 23038 transitions. [2021-08-25 20:37:51,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:51,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 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 273 [2021-08-25 20:37:51,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:51,441 INFO L225 Difference]: With dead ends: 15361 [2021-08-25 20:37:51,441 INFO L226 Difference]: Without dead ends: 8044 [2021-08-25 20:37:51,446 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 12.2ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:37:51,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8044 states. [2021-08-25 20:37:51,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8044 to 7351. [2021-08-25 20:37:51,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7351 states, 7350 states have (on average 1.5012244897959184) internal successors, (11034), 7350 states have internal predecessors, (11034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:51,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7351 states to 7351 states and 11034 transitions. [2021-08-25 20:37:51,694 INFO L78 Accepts]: Start accepts. Automaton has 7351 states and 11034 transitions. Word has length 273 [2021-08-25 20:37:51,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:51,695 INFO L470 AbstractCegarLoop]: Abstraction has 7351 states and 11034 transitions. [2021-08-25 20:37:51,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:51,695 INFO L276 IsEmpty]: Start isEmpty. Operand 7351 states and 11034 transitions. [2021-08-25 20:37:51,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2021-08-25 20:37:51,698 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:51,698 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:51,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2021-08-25 20:37:51,698 INFO L402 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:51,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:51,698 INFO L82 PathProgramCache]: Analyzing trace with hash -314294274, now seen corresponding path program 1 times [2021-08-25 20:37:51,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:51,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330340244] [2021-08-25 20:37:51,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:51,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:51,739 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 539 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2021-08-25 20:37:51,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:51,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330340244] [2021-08-25 20:37:51,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330340244] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:51,740 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:51,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:37:51,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261152243] [2021-08-25 20:37:51,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:37:51,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:51,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:37:51,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:37:51,741 INFO L87 Difference]: Start difference. First operand 7351 states and 11034 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:52,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:52,191 INFO L93 Difference]: Finished difference Result 14728 states and 22090 transitions. [2021-08-25 20:37:52,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:52,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 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 286 [2021-08-25 20:37:52,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:52,199 INFO L225 Difference]: With dead ends: 14728 [2021-08-25 20:37:52,199 INFO L226 Difference]: Without dead ends: 7425 [2021-08-25 20:37:52,203 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:52,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7425 states. [2021-08-25 20:37:52,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7425 to 7351. [2021-08-25 20:37:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7351 states, 7350 states have (on average 1.5) internal successors, (11025), 7350 states have internal predecessors, (11025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7351 states to 7351 states and 11025 transitions. [2021-08-25 20:37:52,493 INFO L78 Accepts]: Start accepts. Automaton has 7351 states and 11025 transitions. Word has length 286 [2021-08-25 20:37:52,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:52,493 INFO L470 AbstractCegarLoop]: Abstraction has 7351 states and 11025 transitions. [2021-08-25 20:37:52,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:52,493 INFO L276 IsEmpty]: Start isEmpty. Operand 7351 states and 11025 transitions. [2021-08-25 20:37:52,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2021-08-25 20:37:52,496 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:52,496 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:52,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2021-08-25 20:37:52,496 INFO L402 AbstractCegarLoop]: === Iteration 159 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:52,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:52,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1388821451, now seen corresponding path program 1 times [2021-08-25 20:37:52,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:52,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880841679] [2021-08-25 20:37:52,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:52,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:52,538 INFO L134 CoverageAnalysis]: Checked inductivity of 919 backedges. 547 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2021-08-25 20:37:52,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:52,538 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880841679] [2021-08-25 20:37:52,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880841679] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:37:52,538 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:52,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:37:52,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724807740] [2021-08-25 20:37:52,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:37:52,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:52,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:37:52,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:37:52,539 INFO L87 Difference]: Start difference. First operand 7351 states and 11025 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:52,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:52,913 INFO L93 Difference]: Finished difference Result 13290 states and 19909 transitions. [2021-08-25 20:37:52,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:37:52,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 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 287 [2021-08-25 20:37:52,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:52,919 INFO L225 Difference]: With dead ends: 13290 [2021-08-25 20:37:52,919 INFO L226 Difference]: Without dead ends: 5987 [2021-08-25 20:37:52,922 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:37:52,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2021-08-25 20:37:53,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 5858. [2021-08-25 20:37:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5858 states, 5857 states have (on average 1.4987194809629503) internal successors, (8778), 5857 states have internal predecessors, (8778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:53,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5858 states to 5858 states and 8778 transitions. [2021-08-25 20:37:53,116 INFO L78 Accepts]: Start accepts. Automaton has 5858 states and 8778 transitions. Word has length 287 [2021-08-25 20:37:53,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:53,116 INFO L470 AbstractCegarLoop]: Abstraction has 5858 states and 8778 transitions. [2021-08-25 20:37:53,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:53,116 INFO L276 IsEmpty]: Start isEmpty. Operand 5858 states and 8778 transitions. [2021-08-25 20:37:53,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2021-08-25 20:37:53,119 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:53,119 INFO L512 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:53,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2021-08-25 20:37:53,119 INFO L402 AbstractCegarLoop]: === Iteration 160 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:53,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:53,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1082649963, now seen corresponding path program 2 times [2021-08-25 20:37:53,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:53,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961434107] [2021-08-25 20:37:53,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:53,119 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 504 proven. 154 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2021-08-25 20:37:53,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:37:53,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961434107] [2021-08-25 20:37:53,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961434107] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:37:53,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912055001] [2021-08-25 20:37:53,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 20:37:53,301 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:37:53,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:37:53,302 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:37:53,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-25 20:37:54,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-25 20:37:54,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:37:54,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 53 conjunts are in the unsatisfiable core [2021-08-25 20:37:54,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:37:54,499 INFO L354 Elim1Store]: treesize reduction 199, result has 12.3 percent of original size [2021-08-25 20:37:54,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 74 [2021-08-25 20:37:54,518 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-25 20:37:54,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 27 [2021-08-25 20:37:54,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 14 [2021-08-25 20:37:54,536 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:37:54,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:37:54,597 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:37:54,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:37:54,625 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-25 20:37:54,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2021-08-25 20:37:54,718 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:37:54,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:37:54,745 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:37:54,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:37:54,822 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-25 20:37:54,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2021-08-25 20:37:54,881 INFO L354 Elim1Store]: treesize reduction 59, result has 13.2 percent of original size [2021-08-25 20:37:54,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 44 [2021-08-25 20:37:54,910 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-25 20:37:54,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2021-08-25 20:37:54,983 INFO L354 Elim1Store]: treesize reduction 59, result has 13.2 percent of original size [2021-08-25 20:37:54,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 44 [2021-08-25 20:37:54,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 96 [2021-08-25 20:37:55,000 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:37:55,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 122 [2021-08-25 20:37:55,029 INFO L354 Elim1Store]: treesize reduction 244, result has 13.2 percent of original size [2021-08-25 20:37:55,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 146 treesize of output 144 [2021-08-25 20:37:55,044 INFO L388 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 162 treesize of output 138 [2021-08-25 20:37:55,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:55,072 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-08-25 20:37:55,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 31 [2021-08-25 20:37:55,079 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:37:55,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:37:55,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-08-25 20:37:55,172 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:37:55,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:37:55,216 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:37:55,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:37:55,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-08-25 20:37:55,267 INFO L354 Elim1Store]: treesize reduction 59, result has 13.2 percent of original size [2021-08-25 20:37:55,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 259 treesize of output 201 [2021-08-25 20:37:55,280 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:37:55,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 152 [2021-08-25 20:37:55,296 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:37:55,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 133 [2021-08-25 20:37:55,321 INFO L354 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2021-08-25 20:37:55,321 INFO L388 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 2 case distinctions, treesize of input 172 treesize of output 137 [2021-08-25 20:37:55,336 INFO L354 Elim1Store]: treesize reduction 55, result has 14.1 percent of original size [2021-08-25 20:37:55,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 121 [2021-08-25 20:37:55,344 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:37:55,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 72 [2021-08-25 20:37:55,351 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:37:55,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 53 [2021-08-25 20:37:55,673 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:37:55,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 72 [2021-08-25 20:37:55,690 INFO L354 Elim1Store]: treesize reduction 164, result has 15.9 percent of original size [2021-08-25 20:37:55,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 81 treesize of output 59 [2021-08-25 20:37:55,691 INFO L388 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 56 treesize of output 50 [2021-08-25 20:37:55,718 INFO L388 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 32 treesize of output 20 [2021-08-25 20:37:55,788 INFO L354 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2021-08-25 20:37:55,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 17 [2021-08-25 20:37:55,933 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 558 proven. 39 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2021-08-25 20:37:55,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912055001] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:37:55,933 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:37:55,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2021-08-25 20:37:55,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182136507] [2021-08-25 20:37:55,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-25 20:37:55,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:37:55,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-25 20:37:55,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-08-25 20:37:55,934 INFO L87 Difference]: Start difference. First operand 5858 states and 8778 transitions. Second operand has 10 states, 10 states have (on average 19.9) internal successors, (199), 10 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:57,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:37:57,959 INFO L93 Difference]: Finished difference Result 12270 states and 18309 transitions. [2021-08-25 20:37:57,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-25 20:37:57,961 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 19.9) internal successors, (199), 10 states have internal predecessors, (199), 0 states have call successors, (0), 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 289 [2021-08-25 20:37:57,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:37:57,967 INFO L225 Difference]: With dead ends: 12270 [2021-08-25 20:37:57,967 INFO L226 Difference]: Without dead ends: 6460 [2021-08-25 20:37:57,970 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 84.1ms TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-08-25 20:37:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6460 states. [2021-08-25 20:37:58,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6460 to 5858. [2021-08-25 20:37:58,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5858 states, 5857 states have (on average 1.498378009219737) internal successors, (8776), 5857 states have internal predecessors, (8776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5858 states to 5858 states and 8776 transitions. [2021-08-25 20:37:58,164 INFO L78 Accepts]: Start accepts. Automaton has 5858 states and 8776 transitions. Word has length 289 [2021-08-25 20:37:58,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:37:58,165 INFO L470 AbstractCegarLoop]: Abstraction has 5858 states and 8776 transitions. [2021-08-25 20:37:58,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.9) internal successors, (199), 10 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:37:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand 5858 states and 8776 transitions. [2021-08-25 20:37:58,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2021-08-25 20:37:58,167 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:37:58,167 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:37:58,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-25 20:37:58,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:37:58,368 INFO L402 AbstractCegarLoop]: === Iteration 161 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:37:58,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:37:58,368 INFO L82 PathProgramCache]: Analyzing trace with hash -797168484, now seen corresponding path program 1 times [2021-08-25 20:37:58,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:37:58,368 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926871990] [2021-08-25 20:37:58,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:58,369 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:37:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:37:58,532 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 20:37:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:37:58,702 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-25 20:37:58,703 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 20:37:58,703 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:37:58,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2021-08-25 20:37:58,710 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:37:58,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:37:58 BoogieIcfgContainer [2021-08-25 20:37:58,850 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:37:58,851 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:37:58,851 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:37:58,851 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:37:58,852 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:36:20" (3/4) ... [2021-08-25 20:37:58,854 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-25 20:37:58,854 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:37:58,855 INFO L168 Benchmark]: Toolchain (without parser) took 99495.92 ms. Allocated memory was 71.3 MB in the beginning and 2.2 GB in the end (delta: 2.2 GB). Free memory was 51.3 MB in the beginning and 2.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 191.7 MB. Max. memory is 16.1 GB. [2021-08-25 20:37:58,855 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 71.3 MB. Free memory was 52.1 MB in the beginning and 52.1 MB in the end (delta: 45.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:37:58,855 INFO L168 Benchmark]: CACSL2BoogieTranslator took 457.02 ms. Allocated memory is still 71.3 MB. Free memory was 51.2 MB in the beginning and 35.8 MB in the end (delta: 15.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-08-25 20:37:58,857 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.43 ms. Allocated memory is still 71.3 MB. Free memory was 35.8 MB in the beginning and 50.9 MB in the end (delta: -15.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 16.1 GB. [2021-08-25 20:37:58,857 INFO L168 Benchmark]: Boogie Preprocessor took 56.81 ms. Allocated memory is still 71.3 MB. Free memory was 50.6 MB in the beginning and 44.0 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:37:58,857 INFO L168 Benchmark]: RCFGBuilder took 672.01 ms. Allocated memory was 71.3 MB in the beginning and 92.3 MB in the end (delta: 21.0 MB). Free memory was 43.8 MB in the beginning and 45.8 MB in the end (delta: -2.0 MB). Peak memory consumption was 31.8 MB. Max. memory is 16.1 GB. [2021-08-25 20:37:58,857 INFO L168 Benchmark]: TraceAbstraction took 98211.53 ms. Allocated memory was 92.3 MB in the beginning and 2.2 GB in the end (delta: 2.2 GB). Free memory was 45.2 MB in the beginning and 2.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 163.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:37:58,857 INFO L168 Benchmark]: Witness Printer took 3.31 ms. Allocated memory is still 2.2 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:37:58,858 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 71.3 MB. Free memory was 52.1 MB in the beginning and 52.1 MB in the end (delta: 45.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 457.02 ms. Allocated memory is still 71.3 MB. Free memory was 51.2 MB in the beginning and 35.8 MB in the end (delta: 15.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 87.43 ms. Allocated memory is still 71.3 MB. Free memory was 35.8 MB in the beginning and 50.9 MB in the end (delta: -15.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 56.81 ms. Allocated memory is still 71.3 MB. Free memory was 50.6 MB in the beginning and 44.0 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 672.01 ms. Allocated memory was 71.3 MB in the beginning and 92.3 MB in the end (delta: 21.0 MB). Free memory was 43.8 MB in the beginning and 45.8 MB in the end (delta: -2.0 MB). Peak memory consumption was 31.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 98211.53 ms. Allocated memory was 92.3 MB in the beginning and 2.2 GB in the end (delta: 2.2 GB). Free memory was 45.2 MB in the beginning and 2.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 163.5 MB. Max. memory is 16.1 GB. * Witness Printer took 3.31 ms. Allocated memory is still 2.2 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1737]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1436. Possible FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={6:0}] [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1082] BUF_MEM *buf ; [L1083] unsigned long l ; [L1084] unsigned long Time ; [L1085] unsigned long tmp ; [L1086] void (*cb)() ; [L1087] long num1 ; [L1088] int ret ; [L1089] int new_state ; [L1090] int state ; [L1091] int skip ; [L1092] int got_new_session ; [L1093] int tmp___1 = __VERIFIER_nondet_int() ; [L1094] int tmp___2 = __VERIFIER_nondet_int() ; [L1095] int tmp___3 = __VERIFIER_nondet_int() ; [L1096] int tmp___4 = __VERIFIER_nondet_int() ; [L1097] int tmp___5 = __VERIFIER_nondet_int() ; [L1098] int tmp___6 = __VERIFIER_nondet_int() ; [L1099] int tmp___7 ; [L1100] long tmp___8 = __VERIFIER_nondet_long() ; [L1101] int tmp___9 = __VERIFIER_nondet_int() ; [L1102] int tmp___10 = __VERIFIER_nondet_int() ; [L1103] int blastFlag ; [L1107] s->state = 8464 [L1108] blastFlag = 0 [L1109] s->hit=__VERIFIER_nondet_int () [L1110] s->state = 8464 [L1111] tmp = __VERIFIER_nondet_int() [L1112] Time = tmp [L1113] cb = (void (*)())((void *)0) [L1114] ret = -1 [L1115] skip = 0 [L1116] got_new_session = 0 [L1117] EXPR s->info_callback VAL [init=1, SSLv3_server_data={6:0}] [L1117] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1118] EXPR s->info_callback [L1118] cb = s->info_callback [L1122] EXPR s->in_handshake [L1122] s->in_handshake += 1 [L1123] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={6:0}] [L1132] EXPR s->cert VAL [init=1, SSLv3_server_data={6:0}] [L1132] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND TRUE s->state == 8464 [L1325] s->shutdown = 0 [L1326] ret = __VERIFIER_nondet_int() [L1327] COND TRUE blastFlag == 0 [L1328] blastFlag = 1 VAL [init=1, SSLv3_server_data={6:0}] [L1332] COND FALSE !(ret <= 0) [L1337] got_new_session = 1 [L1338] s->state = 8496 [L1339] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND TRUE s->state == 8496 [L1343] ret = __VERIFIER_nondet_int() [L1344] COND TRUE blastFlag == 1 [L1345] blastFlag = 2 VAL [init=1, SSLv3_server_data={6:0}] [L1349] COND FALSE !(ret <= 0) [L1354] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1354] COND FALSE !(s->hit) [L1357] s->state = 8512 VAL [init=1, SSLv3_server_data={6:0}] [L1359] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND TRUE s->state == 8512 [L1363] EXPR s->s3 [L1363] EXPR (s->s3)->tmp.new_cipher [L1363] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_server_data={6:0}] [L1363] COND TRUE ((s->s3)->tmp.new_cipher)->algorithms & 256UL [L1364] skip = 1 VAL [init=1, SSLv3_server_data={6:0}] [L1373] s->state = 8528 [L1374] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND TRUE s->state == 8528 [L1378] EXPR s->s3 [L1378] EXPR (s->s3)->tmp.new_cipher [L1378] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1378] l = ((s->s3)->tmp.new_cipher)->algorithms [L1379] EXPR s->options VAL [init=1, SSLv3_server_data={6:0}] [L1379] COND TRUE s->options & 2097152UL [L1380] EXPR s->s3 [L1380] (s->s3)->tmp.use_rsa_tmp = 1 [L1384] EXPR s->s3 [L1384] (s->s3)->tmp.use_rsa_tmp VAL [init=1, SSLv3_server_data={6:0}] [L1384] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1402] ret = __VERIFIER_nondet_int() [L1403] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_server_data={6:0}] [L1420] s->state = 8544 [L1421] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND TRUE s->state == 8544 [L1425] EXPR s->verify_mode VAL [init=1, SSLv3_server_data={6:0}] [L1425] COND TRUE s->verify_mode & 1 [L1426] EXPR s->session [L1426] EXPR (s->session)->peer VAL [init=1, SSLv3_server_data={6:0}] [L1426] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1436] EXPR s->s3 [L1436] EXPR (s->s3)->tmp.new_cipher [L1436] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_server_data={6:0}] [L1436] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1446] EXPR s->s3 [L1446] (s->s3)->tmp.cert_request = 1 [L1447] ret = __VERIFIER_nondet_int() [L1448] COND FALSE !(ret <= 0) [L1453] s->state = 8448 [L1454] EXPR s->s3 [L1454] (s->s3)->tmp.next_state = 8576 [L1455] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND TRUE s->state == 8448 [L1477] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={6:0}] [L1490] EXPR s->s3 [L1490] EXPR (s->s3)->tmp.next_state [L1490] s->state = (s->s3)->tmp.next_state [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND TRUE s->state == 8576 [L1494] ret = __VERIFIER_nondet_int() [L1495] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_server_data={6:0}] [L1500] COND FALSE !(ret == 2) [L1503] ret = __VERIFIER_nondet_int() [L1504] COND FALSE !(ret <= 0) [L1509] s->init_num = 0 [L1510] s->state = 8592 VAL [init=1, SSLv3_server_data={6:0}] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1213] COND TRUE s->state == 8592 [L1515] ret = __VERIFIER_nondet_int() [L1516] COND FALSE !(ret <= 0) [L1521] s->state = 8608 [L1522] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1219] COND TRUE s->state == 8608 [L1526] ret = __VERIFIER_nondet_int() [L1527] COND FALSE !(ret <= 0) [L1532] s->state = 8640 [L1533] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1225] COND TRUE s->state == 8640 [L1537] ret = __VERIFIER_nondet_int() [L1538] COND FALSE !(blastFlag == 4) VAL [init=1, SSLv3_server_data={6:0}] [L1541] COND FALSE !(blastFlag == 7) VAL [init=1, SSLv3_server_data={6:0}] [L1544] COND FALSE !(blastFlag == 10) VAL [init=1, SSLv3_server_data={6:0}] [L1737] reach_error() VAL [init=1, SSLv3_server_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 151 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 98025.0ms, OverallIterations: 161, TraceHistogramMax: 12, EmptinessCheckTime: 189.6ms, AutomataDifference: 59250.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 35979 SDtfs, 17400 SDslu, 64422 SDs, 0 SdLazy, 46736 SolverSat, 3293 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 35811.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3180 GetRequests, 2514 SyntacticMatches, 46 SemanticMatches, 620 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 3283.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=7365occurred in iteration=153, InterpolantAutomatonStates: 726, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 8790.5ms AutomataMinimizationTime, 160 MinimizatonAttempts, 24385 StatesRemovedByMinimization, 157 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 948.6ms SsaConstructionTime, 3067.6ms SatisfiabilityAnalysisTime, 18151.1ms InterpolantComputationTime, 26901 NumberOfCodeBlocks, 26901 NumberOfCodeBlocksAsserted, 172 NumberOfCheckSat, 26443 ConstructedInterpolants, 76 QuantifiedInterpolants, 88819 SizeOfPredicates, 53 NumberOfNonLiveVariables, 7790 ConjunctsInSsa, 205 ConjunctsInUnsatCore, 169 InterpolantComputations, 153 PerfectInterpolantSequences, 44598/45854 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-25 20:37:58,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:38:00,394 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:38:00,396 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:38:00,419 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:38:00,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:38:00,423 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:38:00,425 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:38:00,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:38:00,430 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:38:00,433 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:38:00,434 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:38:00,437 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:38:00,437 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:38:00,439 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:38:00,440 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:38:00,441 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:38:00,442 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:38:00,442 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:38:00,445 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:38:00,450 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:38:00,451 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:38:00,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:38:00,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:38:00,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:38:00,457 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:38:00,457 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:38:00,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:38:00,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:38:00,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:38:00,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:38:00,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:38:00,466 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:38:00,467 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:38:00,468 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:38:00,469 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:38:00,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:38:00,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:38:00,470 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:38:00,470 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:38:00,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:38:00,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:38:00,474 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-08-25 20:38:00,504 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:38:00,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:38:00,507 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:38:00,507 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:38:00,508 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:38:00,508 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:38:00,508 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:38:00,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:38:00,509 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:38:00,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:38:00,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:38:00,510 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:38:00,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:38:00,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:38:00,510 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-25 20:38:00,510 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-25 20:38:00,510 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:38:00,510 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:38:00,511 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:38:00,511 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:38:00,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:38:00,511 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:38:00,511 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:38:00,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:38:00,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:38:00,512 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:38:00,512 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:38:00,512 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-25 20:38:00,512 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-25 20:38:00,512 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:38:00,512 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:38:00,512 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-25 20:38:00,513 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 -> fcfc850a59e797106b6c7b7ef037d26685a57733 [2021-08-25 20:38:00,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:38:00,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:38:00,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:38:00,783 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:38:00,783 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:38:00,784 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.15.i.cil-1.c [2021-08-25 20:38:00,834 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee6760e56/e97c65c844744df98825477cc1831a12/FLAG9089c404f [2021-08-25 20:38:01,308 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:38:01,308 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.15.i.cil-1.c [2021-08-25 20:38:01,331 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee6760e56/e97c65c844744df98825477cc1831a12/FLAG9089c404f [2021-08-25 20:38:01,343 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee6760e56/e97c65c844744df98825477cc1831a12 [2021-08-25 20:38:01,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:38:01,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:38:01,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:38:01,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:38:01,355 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:38:01,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:38:01" (1/1) ... [2021-08-25 20:38:01,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@166febb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:38:01, skipping insertion in model container [2021-08-25 20:38:01,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:38:01" (1/1) ... [2021-08-25 20:38:01,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:38:01,406 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:38:01,639 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.15.i.cil-1.c[74370,74383] [2021-08-25 20:38:01,657 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:38:01,671 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:38:01,756 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.15.i.cil-1.c[74370,74383] [2021-08-25 20:38:01,758 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:38:01,777 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:38:01,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:38:01 WrapperNode [2021-08-25 20:38:01,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:38:01,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:38:01,779 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:38:01,780 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:38:01,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:38:01" (1/1) ... [2021-08-25 20:38:01,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:38:01" (1/1) ... [2021-08-25 20:38:01,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:38:01,863 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:38:01,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:38:01,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:38:01,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:38:01" (1/1) ... [2021-08-25 20:38:01,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:38:01" (1/1) ... [2021-08-25 20:38:01,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:38:01" (1/1) ... [2021-08-25 20:38:01,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:38:01" (1/1) ... [2021-08-25 20:38:01,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:38:01" (1/1) ... [2021-08-25 20:38:01,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:38:01" (1/1) ... [2021-08-25 20:38:01,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:38:01" (1/1) ... [2021-08-25 20:38:01,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:38:01,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:38:01,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:38:01,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:38:01,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:38:01" (1/1) ... [2021-08-25 20:38:01,941 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:38:01,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:38:01,956 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 20:38:01,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 20:38:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-25 20:38:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-25 20:38:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:38:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-25 20:38:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-25 20:38:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-25 20:38:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:38:01,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:38:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-25 20:38:02,140 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:38:03,214 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2021-08-25 20:38:03,215 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2021-08-25 20:38:03,219 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:38:03,219 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:38:03,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:38:03 BoogieIcfgContainer [2021-08-25 20:38:03,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:38:03,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:38:03,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:38:03,223 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:38:03,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:38:01" (1/3) ... [2021-08-25 20:38:03,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b06c744 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:38:03, skipping insertion in model container [2021-08-25 20:38:03,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:38:01" (2/3) ... [2021-08-25 20:38:03,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b06c744 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:38:03, skipping insertion in model container [2021-08-25 20:38:03,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:38:03" (3/3) ... [2021-08-25 20:38:03,225 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15.i.cil-1.c [2021-08-25 20:38:03,228 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:38:03,228 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:38:03,254 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:38:03,258 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 20:38:03,258 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:38:03,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 149 states have (on average 1.7248322147651007) internal successors, (257), 150 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) [2021-08-25 20:38:03,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-25 20:38:03,273 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:38:03,273 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:38:03,274 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:38:03,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:38:03,277 INFO L82 PathProgramCache]: Analyzing trace with hash 62050873, now seen corresponding path program 1 times [2021-08-25 20:38:03,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:38:03,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741893814] [2021-08-25 20:38:03,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:38:03,285 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:38:03,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:38:03,294 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:38:03,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-25 20:38:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:38:03,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:38:03,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:38:03,518 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:38:03,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-25 20:38:03,588 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:38:03,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:38:03,677 INFO L388 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 [2021-08-25 20:38:03,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:38:03,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:38:03,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:38:03,914 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:38:03,914 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741893814] [2021-08-25 20:38:03,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741893814] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:38:03,915 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:38:03,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-25 20:38:03,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241667698] [2021-08-25 20:38:03,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:38:03,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:38:03,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:38:03,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:38:03,927 INFO L87 Difference]: Start difference. First operand has 151 states, 149 states have (on average 1.7248322147651007) internal successors, (257), 150 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) Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:05,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:38:05,151 INFO L93 Difference]: Finished difference Result 329 states and 559 transitions. [2021-08-25 20:38:05,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:38:05,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2021-08-25 20:38:05,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:38:05,159 INFO L225 Difference]: With dead ends: 329 [2021-08-25 20:38:05,159 INFO L226 Difference]: Without dead ends: 166 [2021-08-25 20:38:05,161 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:38:05,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-08-25 20:38:05,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2021-08-25 20:38:05,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.5675675675675675) internal successors, (232), 148 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:05,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 232 transitions. [2021-08-25 20:38:05,185 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 232 transitions. Word has length 43 [2021-08-25 20:38:05,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:38:05,185 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 232 transitions. [2021-08-25 20:38:05,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:05,185 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 232 transitions. [2021-08-25 20:38:05,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-08-25 20:38:05,187 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:38:05,187 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:38:05,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-08-25 20:38:05,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:38:05,395 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:38:05,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:38:05,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1905377872, now seen corresponding path program 1 times [2021-08-25 20:38:05,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:38:05,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50893406] [2021-08-25 20:38:05,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:38:05,397 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:38:05,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:38:05,397 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:38:05,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-25 20:38:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:38:05,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:38:05,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:38:05,638 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:38:05,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-25 20:38:05,679 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:38:05,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:38:05,739 INFO L388 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 [2021-08-25 20:38:05,836 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:38:05,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:38:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:38:06,018 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:38:06,018 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [50893406] [2021-08-25 20:38:06,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [50893406] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:38:06,018 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:38:06,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:38:06,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193032716] [2021-08-25 20:38:06,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:38:06,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:38:06,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:38:06,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:38:06,021 INFO L87 Difference]: Start difference. First operand 149 states and 232 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:08,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:38:08,814 INFO L93 Difference]: Finished difference Result 415 states and 641 transitions. [2021-08-25 20:38:08,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:38:08,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-08-25 20:38:08,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:38:08,817 INFO L225 Difference]: With dead ends: 415 [2021-08-25 20:38:08,817 INFO L226 Difference]: Without dead ends: 285 [2021-08-25 20:38:08,818 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 38.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:38:08,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-08-25 20:38:08,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 165. [2021-08-25 20:38:08,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5670731707317074) internal successors, (257), 164 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) [2021-08-25 20:38:08,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 257 transitions. [2021-08-25 20:38:08,827 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 257 transitions. Word has length 56 [2021-08-25 20:38:08,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:38:08,828 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 257 transitions. [2021-08-25 20:38:08,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:08,828 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 257 transitions. [2021-08-25 20:38:08,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-25 20:38:08,830 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:38:08,830 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:38:08,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-08-25 20:38:09,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:38:09,033 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:38:09,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:38:09,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1255882526, now seen corresponding path program 1 times [2021-08-25 20:38:09,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:38:09,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638771235] [2021-08-25 20:38:09,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:38:09,034 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:38:09,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:38:09,037 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:38:09,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-25 20:38:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:38:09,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:38:09,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:38:09,237 INFO L388 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 109 treesize of output 73 [2021-08-25 20:38:09,248 INFO L388 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 73 treesize of output 49 [2021-08-25 20:38:10,135 INFO L354 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2021-08-25 20:38:10,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 31 [2021-08-25 20:38:10,192 INFO L388 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 [2021-08-25 20:38:10,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:38:10,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:38:10,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:38:10,408 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:38:10,411 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638771235] [2021-08-25 20:38:10,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1638771235] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:38:10,411 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:38:10,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-25 20:38:10,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025133213] [2021-08-25 20:38:10,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:38:10,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:38:10,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:38:10,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:38:10,421 INFO L87 Difference]: Start difference. First operand 165 states and 257 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:11,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:38:11,932 INFO L93 Difference]: Finished difference Result 340 states and 528 transitions. [2021-08-25 20:38:11,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:38:11,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-08-25 20:38:11,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:38:11,936 INFO L225 Difference]: With dead ends: 340 [2021-08-25 20:38:11,937 INFO L226 Difference]: Without dead ends: 194 [2021-08-25 20:38:11,937 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:38:11,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-08-25 20:38:11,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2021-08-25 20:38:11,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.5722222222222222) internal successors, (283), 180 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:11,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 283 transitions. [2021-08-25 20:38:11,944 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 283 transitions. Word has length 57 [2021-08-25 20:38:11,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:38:11,944 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 283 transitions. [2021-08-25 20:38:11,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:11,944 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 283 transitions. [2021-08-25 20:38:11,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-25 20:38:11,945 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:38:11,946 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:38:11,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-08-25 20:38:12,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:38:12,155 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:38:12,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:38:12,156 INFO L82 PathProgramCache]: Analyzing trace with hash 2070651149, now seen corresponding path program 1 times [2021-08-25 20:38:12,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:38:12,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563128170] [2021-08-25 20:38:12,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:38:12,157 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:38:12,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:38:12,157 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:38:12,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-25 20:38:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:38:12,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:38:12,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:38:12,403 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:38:12,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-25 20:38:12,431 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:38:12,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:38:12,483 INFO L388 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 [2021-08-25 20:38:12,574 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:38:12,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:38:12,749 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:38:12,749 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:38:12,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563128170] [2021-08-25 20:38:12,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [563128170] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:38:12,750 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:38:12,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:38:12,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659841225] [2021-08-25 20:38:12,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:38:12,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:38:12,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:38:12,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:38:12,751 INFO L87 Difference]: Start difference. First operand 181 states and 283 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:15,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:38:15,574 INFO L93 Difference]: Finished difference Result 461 states and 715 transitions. [2021-08-25 20:38:15,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:38:15,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-08-25 20:38:15,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:38:15,575 INFO L225 Difference]: With dead ends: 461 [2021-08-25 20:38:15,575 INFO L226 Difference]: Without dead ends: 299 [2021-08-25 20:38:15,576 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 38.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:38:15,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-08-25 20:38:15,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 182. [2021-08-25 20:38:15,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.5635359116022098) internal successors, (283), 181 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:15,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 283 transitions. [2021-08-25 20:38:15,593 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 283 transitions. Word has length 57 [2021-08-25 20:38:15,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:38:15,593 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 283 transitions. [2021-08-25 20:38:15,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:15,594 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 283 transitions. [2021-08-25 20:38:15,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-25 20:38:15,595 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:38:15,595 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:38:15,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-25 20:38:15,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:38:15,801 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:38:15,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:38:15,801 INFO L82 PathProgramCache]: Analyzing trace with hash -221095859, now seen corresponding path program 1 times [2021-08-25 20:38:15,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:38:15,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117559705] [2021-08-25 20:38:15,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:38:15,802 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:38:15,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:38:15,804 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:38:15,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-25 20:38:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:38:15,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:38:15,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:38:16,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:38:16,151 INFO L388 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 [2021-08-25 20:38:16,169 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:38:16,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:38:16,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:38:16,346 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:38:16,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117559705] [2021-08-25 20:38:16,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117559705] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:38:16,346 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:38:16,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:38:16,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818524677] [2021-08-25 20:38:16,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:38:16,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:38:16,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:38:16,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:38:16,347 INFO L87 Difference]: Start difference. First operand 182 states and 283 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 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) [2021-08-25 20:38:19,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:38:19,604 INFO L93 Difference]: Finished difference Result 571 states and 887 transitions. [2021-08-25 20:38:19,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:38:19,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 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 57 [2021-08-25 20:38:19,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:38:19,610 INFO L225 Difference]: With dead ends: 571 [2021-08-25 20:38:19,611 INFO L226 Difference]: Without dead ends: 408 [2021-08-25 20:38:19,611 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 32.0ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:38:19,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-08-25 20:38:19,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 222. [2021-08-25 20:38:19,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.6018099547511313) internal successors, (354), 221 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:19,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 354 transitions. [2021-08-25 20:38:19,617 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 354 transitions. Word has length 57 [2021-08-25 20:38:19,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:38:19,618 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 354 transitions. [2021-08-25 20:38:19,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 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) [2021-08-25 20:38:19,618 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 354 transitions. [2021-08-25 20:38:19,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-25 20:38:19,618 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:38:19,619 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:38:19,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-08-25 20:38:19,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:38:19,825 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:38:19,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:38:19,826 INFO L82 PathProgramCache]: Analyzing trace with hash -243629373, now seen corresponding path program 1 times [2021-08-25 20:38:19,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:38:19,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456671002] [2021-08-25 20:38:19,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:38:19,826 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:38:19,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:38:19,827 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:38:19,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-25 20:38:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:38:20,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:38:20,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:38:20,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:38:20,242 INFO L388 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 [2021-08-25 20:38:20,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:38:20,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:38:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:38:20,443 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:38:20,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456671002] [2021-08-25 20:38:20,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456671002] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:38:20,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:38:20,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:38:20,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482796131] [2021-08-25 20:38:20,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:38:20,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:38:20,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:38:20,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:38:20,444 INFO L87 Difference]: Start difference. First operand 222 states and 354 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:22,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:38:22,829 INFO L93 Difference]: Finished difference Result 625 states and 989 transitions. [2021-08-25 20:38:22,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:38:22,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-08-25 20:38:22,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:38:22,858 INFO L225 Difference]: With dead ends: 625 [2021-08-25 20:38:22,859 INFO L226 Difference]: Without dead ends: 422 [2021-08-25 20:38:22,859 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 37.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:38:22,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-08-25 20:38:22,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 245. [2021-08-25 20:38:22,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.6352459016393444) internal successors, (399), 244 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:22,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 399 transitions. [2021-08-25 20:38:22,874 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 399 transitions. Word has length 58 [2021-08-25 20:38:22,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:38:22,874 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 399 transitions. [2021-08-25 20:38:22,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:22,875 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 399 transitions. [2021-08-25 20:38:22,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-25 20:38:22,875 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:38:22,875 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-08-25 20:38:22,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-08-25 20:38:23,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:38:23,084 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:38:23,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:38:23,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1777023767, now seen corresponding path program 1 times [2021-08-25 20:38:23,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:38:23,085 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332153136] [2021-08-25 20:38:23,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:38:23,085 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:38:23,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:38:23,100 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:38:23,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-25 20:38:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:38:23,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:38:23,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:38:23,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:38:23,523 INFO L388 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 [2021-08-25 20:38:23,607 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:38:23,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:38:23,822 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:38:23,822 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:38:23,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332153136] [2021-08-25 20:38:23,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332153136] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:38:23,822 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:38:23,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:38:23,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061334506] [2021-08-25 20:38:23,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:38:23,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:38:23,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:38:23,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:38:23,823 INFO L87 Difference]: Start difference. First operand 245 states and 399 transitions. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:27,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:38:27,109 INFO L93 Difference]: Finished difference Result 721 states and 1166 transitions. [2021-08-25 20:38:27,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:38:27,110 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-08-25 20:38:27,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:38:27,111 INFO L225 Difference]: With dead ends: 721 [2021-08-25 20:38:27,111 INFO L226 Difference]: Without dead ends: 495 [2021-08-25 20:38:27,112 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 34.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:38:27,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2021-08-25 20:38:27,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 309. [2021-08-25 20:38:27,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.6590909090909092) internal successors, (511), 308 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:27,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 511 transitions. [2021-08-25 20:38:27,118 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 511 transitions. Word has length 86 [2021-08-25 20:38:27,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:38:27,118 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 511 transitions. [2021-08-25 20:38:27,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:27,119 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 511 transitions. [2021-08-25 20:38:27,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-08-25 20:38:27,119 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:38:27,119 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2021-08-25 20:38:27,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-25 20:38:27,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:38:27,342 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:38:27,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:38:27,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1295532847, now seen corresponding path program 1 times [2021-08-25 20:38:27,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:38:27,343 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094879423] [2021-08-25 20:38:27,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:38:27,343 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:38:27,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:38:27,344 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:38:27,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-25 20:38:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:38:27,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:38:27,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:38:27,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:38:27,822 INFO L388 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 [2021-08-25 20:38:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:38:27,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:38:28,152 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:38:28,153 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:38:28,153 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094879423] [2021-08-25 20:38:28,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094879423] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:38:28,153 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:38:28,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:38:28,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428891782] [2021-08-25 20:38:28,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:38:28,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:38:28,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:38:28,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:38:28,154 INFO L87 Difference]: Start difference. First operand 309 states and 511 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:30,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:38:30,716 INFO L93 Difference]: Finished difference Result 813 states and 1321 transitions. [2021-08-25 20:38:30,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:38:30,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 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 91 [2021-08-25 20:38:30,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:38:30,719 INFO L225 Difference]: With dead ends: 813 [2021-08-25 20:38:30,719 INFO L226 Difference]: Without dead ends: 523 [2021-08-25 20:38:30,719 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 31.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:38:30,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2021-08-25 20:38:30,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 346. [2021-08-25 20:38:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 1.6666666666666667) internal successors, (575), 345 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:30,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 575 transitions. [2021-08-25 20:38:30,725 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 575 transitions. Word has length 91 [2021-08-25 20:38:30,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:38:30,725 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 575 transitions. [2021-08-25 20:38:30,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:30,725 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 575 transitions. [2021-08-25 20:38:30,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-08-25 20:38:30,726 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:38:30,726 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2021-08-25 20:38:30,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-08-25 20:38:30,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:38:30,927 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:38:30,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:38:30,927 INFO L82 PathProgramCache]: Analyzing trace with hash 646431941, now seen corresponding path program 1 times [2021-08-25 20:38:30,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:38:30,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039514234] [2021-08-25 20:38:30,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:38:30,928 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:38:30,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:38:30,930 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:38:30,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-25 20:38:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:38:31,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:38:31,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:38:31,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:38:31,411 INFO L388 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 [2021-08-25 20:38:31,489 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:38:31,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:38:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:38:31,714 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:38:31,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039514234] [2021-08-25 20:38:31,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039514234] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:38:31,714 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:38:31,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:38:31,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131860526] [2021-08-25 20:38:31,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:38:31,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:38:31,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:38:31,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:38:31,716 INFO L87 Difference]: Start difference. First operand 346 states and 575 transitions. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:34,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:38:34,101 INFO L93 Difference]: Finished difference Result 845 states and 1376 transitions. [2021-08-25 20:38:34,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:38:34,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2021-08-25 20:38:34,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:38:34,106 INFO L225 Difference]: With dead ends: 845 [2021-08-25 20:38:34,106 INFO L226 Difference]: Without dead ends: 518 [2021-08-25 20:38:34,107 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 35.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:38:34,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2021-08-25 20:38:34,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 346. [2021-08-25 20:38:34,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 1.6608695652173913) internal successors, (573), 345 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 573 transitions. [2021-08-25 20:38:34,113 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 573 transitions. Word has length 92 [2021-08-25 20:38:34,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:38:34,113 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 573 transitions. [2021-08-25 20:38:34,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:34,113 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 573 transitions. [2021-08-25 20:38:34,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-25 20:38:34,114 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:38:34,114 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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, 1, 1, 1, 1, 1] [2021-08-25 20:38:34,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-25 20:38:34,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:38:34,324 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:38:34,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:38:34,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1174626467, now seen corresponding path program 1 times [2021-08-25 20:38:34,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:38:34,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026392918] [2021-08-25 20:38:34,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:38:34,325 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:38:34,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:38:34,327 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:38:34,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-25 20:38:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:38:34,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:38:34,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:38:34,791 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:38:34,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-25 20:38:34,816 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:38:34,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:38:34,854 INFO L388 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 [2021-08-25 20:38:35,004 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:38:35,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:38:35,233 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:38:35,233 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:38:35,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026392918] [2021-08-25 20:38:35,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026392918] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:38:35,233 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:38:35,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:38:35,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568942701] [2021-08-25 20:38:35,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:38:35,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:38:35,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:38:35,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:38:35,234 INFO L87 Difference]: Start difference. First operand 346 states and 573 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:37,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:38:37,439 INFO L93 Difference]: Finished difference Result 765 states and 1246 transitions. [2021-08-25 20:38:37,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:38:37,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 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 99 [2021-08-25 20:38:37,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:38:37,441 INFO L225 Difference]: With dead ends: 765 [2021-08-25 20:38:37,441 INFO L226 Difference]: Without dead ends: 438 [2021-08-25 20:38:37,441 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 38.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:38:37,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-08-25 20:38:37,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 346. [2021-08-25 20:38:37,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 1.6405797101449275) internal successors, (566), 345 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:37,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 566 transitions. [2021-08-25 20:38:37,447 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 566 transitions. Word has length 99 [2021-08-25 20:38:37,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:38:37,447 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 566 transitions. [2021-08-25 20:38:37,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:37,447 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 566 transitions. [2021-08-25 20:38:37,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-25 20:38:37,448 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:38:37,452 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1] [2021-08-25 20:38:37,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-08-25 20:38:37,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:38:37,657 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:38:37,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:38:37,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1790280433, now seen corresponding path program 1 times [2021-08-25 20:38:37,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:38:37,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677092468] [2021-08-25 20:38:37,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:38:37,658 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:38:37,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:38:37,659 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:38:37,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-08-25 20:38:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:38:38,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:38:38,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:38:38,184 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:38:38,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-25 20:38:38,212 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:38:38,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:38:38,236 INFO L388 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 [2021-08-25 20:38:38,397 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:38:38,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:38:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:38:38,625 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:38:38,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677092468] [2021-08-25 20:38:38,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [677092468] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:38:38,626 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:38:38,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:38:38,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475682718] [2021-08-25 20:38:38,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:38:38,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:38:38,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:38:38,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:38:38,627 INFO L87 Difference]: Start difference. First operand 346 states and 566 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:40,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:38:40,418 INFO L93 Difference]: Finished difference Result 765 states and 1233 transitions. [2021-08-25 20:38:40,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:38:40,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-08-25 20:38:40,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:38:40,420 INFO L225 Difference]: With dead ends: 765 [2021-08-25 20:38:40,420 INFO L226 Difference]: Without dead ends: 438 [2021-08-25 20:38:40,420 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 36.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:38:40,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-08-25 20:38:40,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 346. [2021-08-25 20:38:40,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 1.6202898550724638) internal successors, (559), 345 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 559 transitions. [2021-08-25 20:38:40,426 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 559 transitions. Word has length 99 [2021-08-25 20:38:40,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:38:40,426 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 559 transitions. [2021-08-25 20:38:40,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:40,427 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 559 transitions. [2021-08-25 20:38:40,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-25 20:38:40,427 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:38:40,427 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2021-08-25 20:38:40,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-08-25 20:38:40,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:38:40,637 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:38:40,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:38:40,638 INFO L82 PathProgramCache]: Analyzing trace with hash -151554348, now seen corresponding path program 1 times [2021-08-25 20:38:40,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:38:40,638 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319913835] [2021-08-25 20:38:40,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:38:40,638 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:38:40,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:38:40,639 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:38:40,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-08-25 20:38:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:38:41,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:38:41,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:38:41,190 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:38:41,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-25 20:38:41,215 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:38:41,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:38:41,243 INFO L388 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 [2021-08-25 20:38:41,410 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:38:41,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:38:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:38:41,676 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:38:41,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1319913835] [2021-08-25 20:38:41,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1319913835] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:38:41,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:38:41,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:38:41,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974851118] [2021-08-25 20:38:41,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:38:41,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:38:41,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:38:41,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:38:41,678 INFO L87 Difference]: Start difference. First operand 346 states and 559 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:44,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:38:44,375 INFO L93 Difference]: Finished difference Result 765 states and 1220 transitions. [2021-08-25 20:38:44,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:38:44,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 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 100 [2021-08-25 20:38:44,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:38:44,377 INFO L225 Difference]: With dead ends: 765 [2021-08-25 20:38:44,377 INFO L226 Difference]: Without dead ends: 438 [2021-08-25 20:38:44,377 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 37.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:38:44,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-08-25 20:38:44,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 346. [2021-08-25 20:38:44,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 1.6) internal successors, (552), 345 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:44,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 552 transitions. [2021-08-25 20:38:44,382 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 552 transitions. Word has length 100 [2021-08-25 20:38:44,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:38:44,382 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 552 transitions. [2021-08-25 20:38:44,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:44,383 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 552 transitions. [2021-08-25 20:38:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-25 20:38:44,383 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:38:44,383 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2021-08-25 20:38:44,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-08-25 20:38:44,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:38:44,584 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:38:44,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:38:44,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2080804085, now seen corresponding path program 1 times [2021-08-25 20:38:44,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:38:44,585 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959772918] [2021-08-25 20:38:44,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:38:44,586 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:38:44,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:38:44,587 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:38:44,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-08-25 20:38:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:38:45,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:38:45,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:38:45,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:38:45,281 INFO L388 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 [2021-08-25 20:38:45,362 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:38:45,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:38:45,594 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:38:45,594 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:38:45,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959772918] [2021-08-25 20:38:45,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [959772918] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:38:45,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:38:45,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:38:45,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782550977] [2021-08-25 20:38:45,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:38:45,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:38:45,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:38:45,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:38:45,596 INFO L87 Difference]: Start difference. First operand 346 states and 552 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:47,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:38:47,935 INFO L93 Difference]: Finished difference Result 883 states and 1392 transitions. [2021-08-25 20:38:47,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:38:47,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-25 20:38:47,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:38:47,938 INFO L225 Difference]: With dead ends: 883 [2021-08-25 20:38:47,938 INFO L226 Difference]: Without dead ends: 556 [2021-08-25 20:38:47,938 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 35.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:38:47,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-08-25 20:38:47,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 389. [2021-08-25 20:38:47,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 1.6030927835051547) internal successors, (622), 388 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:47,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 622 transitions. [2021-08-25 20:38:47,945 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 622 transitions. Word has length 100 [2021-08-25 20:38:47,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:38:47,945 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 622 transitions. [2021-08-25 20:38:47,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:47,945 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 622 transitions. [2021-08-25 20:38:47,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-25 20:38:47,946 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:38:47,946 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2021-08-25 20:38:47,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-08-25 20:38:48,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:38:48,157 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:38:48,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:38:48,157 INFO L82 PathProgramCache]: Analyzing trace with hash -2145724330, now seen corresponding path program 1 times [2021-08-25 20:38:48,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:38:48,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506311617] [2021-08-25 20:38:48,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:38:48,158 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:38:48,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:38:48,158 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:38:48,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-08-25 20:38:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:38:48,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:38:48,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:38:48,777 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:38:48,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-25 20:38:48,800 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:38:48,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:38:48,835 INFO L388 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 [2021-08-25 20:38:48,982 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:38:48,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:38:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:38:49,203 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:38:49,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506311617] [2021-08-25 20:38:49,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506311617] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:38:49,204 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:38:49,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:38:49,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559003455] [2021-08-25 20:38:49,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:38:49,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:38:49,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:38:49,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:38:49,205 INFO L87 Difference]: Start difference. First operand 389 states and 622 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:51,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:38:51,215 INFO L93 Difference]: Finished difference Result 851 states and 1347 transitions. [2021-08-25 20:38:51,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:38:51,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 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 101 [2021-08-25 20:38:51,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:38:51,217 INFO L225 Difference]: With dead ends: 851 [2021-08-25 20:38:51,217 INFO L226 Difference]: Without dead ends: 481 [2021-08-25 20:38:51,217 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 35.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:38:51,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-08-25 20:38:51,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 389. [2021-08-25 20:38:51,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 1.5824742268041236) internal successors, (614), 388 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:51,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 614 transitions. [2021-08-25 20:38:51,224 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 614 transitions. Word has length 101 [2021-08-25 20:38:51,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:38:51,224 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 614 transitions. [2021-08-25 20:38:51,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 614 transitions. [2021-08-25 20:38:51,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-25 20:38:51,225 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:38:51,226 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2021-08-25 20:38:51,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-08-25 20:38:51,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:38:51,435 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:38:51,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:38:51,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1754124801, now seen corresponding path program 1 times [2021-08-25 20:38:51,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:38:51,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956212057] [2021-08-25 20:38:51,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:38:51,436 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:38:51,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:38:51,437 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:38:51,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-08-25 20:38:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:38:52,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:38:52,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:38:52,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:38:52,185 INFO L388 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 [2021-08-25 20:38:52,298 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:38:52,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:38:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:38:52,563 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:38:52,563 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956212057] [2021-08-25 20:38:52,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956212057] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:38:52,563 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:38:52,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:38:52,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434310970] [2021-08-25 20:38:52,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:38:52,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:38:52,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:38:52,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:38:52,564 INFO L87 Difference]: Start difference. First operand 389 states and 614 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:54,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:38:54,802 INFO L93 Difference]: Finished difference Result 923 states and 1440 transitions. [2021-08-25 20:38:54,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:38:54,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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 101 [2021-08-25 20:38:54,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:38:54,804 INFO L225 Difference]: With dead ends: 923 [2021-08-25 20:38:54,804 INFO L226 Difference]: Without dead ends: 549 [2021-08-25 20:38:54,805 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 31.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:38:54,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2021-08-25 20:38:54,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 391. [2021-08-25 20:38:54,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 390 states have (on average 1.582051282051282) internal successors, (617), 390 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:54,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 617 transitions. [2021-08-25 20:38:54,811 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 617 transitions. Word has length 101 [2021-08-25 20:38:54,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:38:54,811 INFO L470 AbstractCegarLoop]: Abstraction has 391 states and 617 transitions. [2021-08-25 20:38:54,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:54,811 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 617 transitions. [2021-08-25 20:38:54,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-08-25 20:38:54,812 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:38:54,812 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2021-08-25 20:38:54,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-08-25 20:38:55,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:38:55,021 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:38:55,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:38:55,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1467318247, now seen corresponding path program 1 times [2021-08-25 20:38:55,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:38:55,022 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749396163] [2021-08-25 20:38:55,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:38:55,022 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:38:55,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:38:55,022 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:38:55,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-08-25 20:38:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:38:55,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:38:55,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:38:55,733 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:38:55,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-25 20:38:55,758 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:38:55,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:38:55,793 INFO L388 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 [2021-08-25 20:38:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:38:55,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:38:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:38:56,233 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:38:56,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749396163] [2021-08-25 20:38:56,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749396163] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:38:56,233 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:38:56,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:38:56,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876824980] [2021-08-25 20:38:56,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:38:56,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:38:56,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:38:56,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:38:56,234 INFO L87 Difference]: Start difference. First operand 391 states and 617 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:58,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:38:58,896 INFO L93 Difference]: Finished difference Result 831 states and 1305 transitions. [2021-08-25 20:38:58,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:38:58,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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 102 [2021-08-25 20:38:58,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:38:58,898 INFO L225 Difference]: With dead ends: 831 [2021-08-25 20:38:58,898 INFO L226 Difference]: Without dead ends: 459 [2021-08-25 20:38:58,899 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 35.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:38:58,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-08-25 20:38:58,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 391. [2021-08-25 20:38:58,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 390 states have (on average 1.5615384615384615) internal successors, (609), 390 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:58,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 609 transitions. [2021-08-25 20:38:58,905 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 609 transitions. Word has length 102 [2021-08-25 20:38:58,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:38:58,905 INFO L470 AbstractCegarLoop]: Abstraction has 391 states and 609 transitions. [2021-08-25 20:38:58,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:38:58,905 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 609 transitions. [2021-08-25 20:38:58,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-08-25 20:38:58,906 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:38:58,906 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-08-25 20:38:58,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-08-25 20:38:59,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:38:59,112 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:38:59,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:38:59,112 INFO L82 PathProgramCache]: Analyzing trace with hash 643970411, now seen corresponding path program 1 times [2021-08-25 20:38:59,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:38:59,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417974526] [2021-08-25 20:38:59,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:38:59,112 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:38:59,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:38:59,113 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:38:59,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-08-25 20:38:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:38:59,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:38:59,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:38:59,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:38:59,912 INFO L388 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 [2021-08-25 20:39:00,031 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:39:00,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:39:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:39:00,277 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:39:00,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417974526] [2021-08-25 20:39:00,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417974526] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:39:00,277 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:39:00,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:39:00,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009002587] [2021-08-25 20:39:00,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:39:00,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:39:00,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:39:00,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:39:00,278 INFO L87 Difference]: Start difference. First operand 391 states and 609 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:02,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:39:02,420 INFO L93 Difference]: Finished difference Result 943 states and 1460 transitions. [2021-08-25 20:39:02,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:39:02,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 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 [2021-08-25 20:39:02,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:39:02,423 INFO L225 Difference]: With dead ends: 943 [2021-08-25 20:39:02,423 INFO L226 Difference]: Without dead ends: 571 [2021-08-25 20:39:02,423 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 32.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:39:02,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-08-25 20:39:02,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 421. [2021-08-25 20:39:02,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.55) internal successors, (651), 420 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:02,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 651 transitions. [2021-08-25 20:39:02,430 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 651 transitions. Word has length 113 [2021-08-25 20:39:02,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:39:02,430 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 651 transitions. [2021-08-25 20:39:02,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:02,430 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 651 transitions. [2021-08-25 20:39:02,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-08-25 20:39:02,431 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:39:02,431 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2021-08-25 20:39:02,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-08-25 20:39:02,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:39:02,641 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:39:02,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:39:02,641 INFO L82 PathProgramCache]: Analyzing trace with hash -968645306, now seen corresponding path program 1 times [2021-08-25 20:39:02,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:39:02,642 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680428236] [2021-08-25 20:39:02,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:39:02,642 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:39:02,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:39:02,643 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:39:02,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-08-25 20:39:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:39:03,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:39:03,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:39:03,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:39:03,516 INFO L388 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 [2021-08-25 20:39:03,637 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:39:03,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:39:03,893 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:39:03,893 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:39:03,894 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680428236] [2021-08-25 20:39:03,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680428236] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:39:03,894 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:39:03,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:39:03,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018153684] [2021-08-25 20:39:03,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:39:03,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:39:03,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:39:03,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:39:03,895 INFO L87 Difference]: Start difference. First operand 421 states and 651 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:06,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:39:06,868 INFO L93 Difference]: Finished difference Result 959 states and 1475 transitions. [2021-08-25 20:39:06,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:39:06,869 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 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 114 [2021-08-25 20:39:06,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:39:06,870 INFO L225 Difference]: With dead ends: 959 [2021-08-25 20:39:06,870 INFO L226 Difference]: Without dead ends: 557 [2021-08-25 20:39:06,871 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 35.0ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:39:06,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2021-08-25 20:39:06,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 421. [2021-08-25 20:39:06,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.5357142857142858) internal successors, (645), 420 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 645 transitions. [2021-08-25 20:39:06,877 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 645 transitions. Word has length 114 [2021-08-25 20:39:06,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:39:06,877 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 645 transitions. [2021-08-25 20:39:06,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:06,877 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 645 transitions. [2021-08-25 20:39:06,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-08-25 20:39:06,878 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:39:06,878 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2021-08-25 20:39:06,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-08-25 20:39:07,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:39:07,088 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:39:07,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:39:07,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1356993869, now seen corresponding path program 1 times [2021-08-25 20:39:07,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:39:07,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379660909] [2021-08-25 20:39:07,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:39:07,089 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:39:07,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:39:07,090 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:39:07,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-08-25 20:39:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:39:07,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:39:07,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:39:07,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:39:07,996 INFO L388 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 [2021-08-25 20:39:08,132 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:39:08,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:39:08,371 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:39:08,371 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:39:08,371 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379660909] [2021-08-25 20:39:08,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1379660909] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:39:08,371 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:39:08,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:39:08,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703504488] [2021-08-25 20:39:08,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:39:08,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:39:08,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:39:08,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:39:08,372 INFO L87 Difference]: Start difference. First operand 421 states and 645 transitions. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:10,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:39:10,695 INFO L93 Difference]: Finished difference Result 1001 states and 1526 transitions. [2021-08-25 20:39:10,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:39:10,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2021-08-25 20:39:10,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:39:10,697 INFO L225 Difference]: With dead ends: 1001 [2021-08-25 20:39:10,697 INFO L226 Difference]: Without dead ends: 599 [2021-08-25 20:39:10,698 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 32.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:39:10,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-08-25 20:39:10,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 449. [2021-08-25 20:39:10,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.5223214285714286) internal successors, (682), 448 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) [2021-08-25 20:39:10,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 682 transitions. [2021-08-25 20:39:10,705 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 682 transitions. Word has length 116 [2021-08-25 20:39:10,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:39:10,705 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 682 transitions. [2021-08-25 20:39:10,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:10,705 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 682 transitions. [2021-08-25 20:39:10,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-08-25 20:39:10,706 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:39:10,706 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2021-08-25 20:39:10,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2021-08-25 20:39:10,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:39:10,916 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:39:10,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:39:10,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1167990834, now seen corresponding path program 1 times [2021-08-25 20:39:10,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:39:10,917 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377394712] [2021-08-25 20:39:10,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:39:10,917 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:39:10,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:39:10,918 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:39:10,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-08-25 20:39:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:39:11,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:39:11,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:39:11,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:39:11,855 INFO L388 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 [2021-08-25 20:39:11,979 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:39:11,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:39:12,226 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:39:12,226 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:39:12,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377394712] [2021-08-25 20:39:12,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377394712] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:39:12,227 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:39:12,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:39:12,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66050494] [2021-08-25 20:39:12,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:39:12,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:39:12,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:39:12,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:39:12,228 INFO L87 Difference]: Start difference. First operand 449 states and 682 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:14,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:39:14,847 INFO L93 Difference]: Finished difference Result 1007 states and 1522 transitions. [2021-08-25 20:39:14,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:39:14,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2021-08-25 20:39:14,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:39:14,849 INFO L225 Difference]: With dead ends: 1007 [2021-08-25 20:39:14,849 INFO L226 Difference]: Without dead ends: 577 [2021-08-25 20:39:14,850 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 30.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:39:14,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2021-08-25 20:39:14,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 449. [2021-08-25 20:39:14,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.5066964285714286) internal successors, (675), 448 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:14,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 675 transitions. [2021-08-25 20:39:14,857 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 675 transitions. Word has length 117 [2021-08-25 20:39:14,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:39:14,857 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 675 transitions. [2021-08-25 20:39:14,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:14,857 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 675 transitions. [2021-08-25 20:39:14,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-08-25 20:39:14,858 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:39:14,858 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2021-08-25 20:39:14,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2021-08-25 20:39:15,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:39:15,062 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:39:15,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:39:15,063 INFO L82 PathProgramCache]: Analyzing trace with hash 816861398, now seen corresponding path program 1 times [2021-08-25 20:39:15,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:39:15,063 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840017492] [2021-08-25 20:39:15,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:39:15,063 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:39:15,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:39:15,064 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:39:15,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-08-25 20:39:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:39:15,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:39:15,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:39:15,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:39:16,079 INFO L388 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 [2021-08-25 20:39:16,215 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-08-25 20:39:16,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:39:16,499 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-08-25 20:39:16,499 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:39:16,499 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840017492] [2021-08-25 20:39:16,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840017492] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:39:16,499 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:39:16,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:39:16,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146744573] [2021-08-25 20:39:16,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:39:16,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:39:16,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:39:16,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:39:16,500 INFO L87 Difference]: Start difference. First operand 449 states and 675 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:18,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:39:18,680 INFO L93 Difference]: Finished difference Result 1049 states and 1569 transitions. [2021-08-25 20:39:18,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:39:18,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2021-08-25 20:39:18,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:39:18,682 INFO L225 Difference]: With dead ends: 1049 [2021-08-25 20:39:18,682 INFO L226 Difference]: Without dead ends: 619 [2021-08-25 20:39:18,683 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 31.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:39:18,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2021-08-25 20:39:18,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 484. [2021-08-25 20:39:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 1.4989648033126295) internal successors, (724), 483 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) [2021-08-25 20:39:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 724 transitions. [2021-08-25 20:39:18,692 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 724 transitions. Word has length 123 [2021-08-25 20:39:18,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:39:18,692 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 724 transitions. [2021-08-25 20:39:18,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:18,693 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 724 transitions. [2021-08-25 20:39:18,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-08-25 20:39:18,694 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:39:18,694 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2021-08-25 20:39:18,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2021-08-25 20:39:18,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:39:18,901 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:39:18,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:39:18,901 INFO L82 PathProgramCache]: Analyzing trace with hash -108509428, now seen corresponding path program 1 times [2021-08-25 20:39:18,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:39:18,902 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449889154] [2021-08-25 20:39:18,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:39:18,902 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:39:18,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:39:18,902 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:39:18,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-08-25 20:39:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:39:19,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:39:19,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:39:19,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:39:19,968 INFO L388 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 [2021-08-25 20:39:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-08-25 20:39:20,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:39:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-08-25 20:39:20,408 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:39:20,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449889154] [2021-08-25 20:39:20,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449889154] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:39:20,408 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:39:20,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:39:20,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517464171] [2021-08-25 20:39:20,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:39:20,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:39:20,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:39:20,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:39:20,409 INFO L87 Difference]: Start difference. First operand 484 states and 724 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:22,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:39:22,895 INFO L93 Difference]: Finished difference Result 1075 states and 1602 transitions. [2021-08-25 20:39:22,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:39:22,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 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 124 [2021-08-25 20:39:22,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:39:22,898 INFO L225 Difference]: With dead ends: 1075 [2021-08-25 20:39:22,898 INFO L226 Difference]: Without dead ends: 610 [2021-08-25 20:39:22,899 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 37.0ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:39:22,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2021-08-25 20:39:22,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 484. [2021-08-25 20:39:22,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 1.4906832298136645) internal successors, (720), 483 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:22,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 720 transitions. [2021-08-25 20:39:22,906 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 720 transitions. Word has length 124 [2021-08-25 20:39:22,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:39:22,907 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 720 transitions. [2021-08-25 20:39:22,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:22,907 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 720 transitions. [2021-08-25 20:39:22,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-08-25 20:39:22,908 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:39:22,908 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2021-08-25 20:39:22,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-08-25 20:39:23,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:39:23,115 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:39:23,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:39:23,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1177565895, now seen corresponding path program 1 times [2021-08-25 20:39:23,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:39:23,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719724134] [2021-08-25 20:39:23,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:39:23,116 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:39:23,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:39:23,116 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:39:23,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-08-25 20:39:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:39:24,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:39:24,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:39:24,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:39:24,265 INFO L388 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 [2021-08-25 20:39:24,408 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-25 20:39:24,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:39:24,750 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-25 20:39:24,750 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:39:24,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719724134] [2021-08-25 20:39:24,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719724134] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:39:24,750 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:39:24,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:39:24,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777238253] [2021-08-25 20:39:24,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:39:24,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:39:24,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:39:24,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:39:24,751 INFO L87 Difference]: Start difference. First operand 484 states and 720 transitions. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:27,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:39:27,102 INFO L93 Difference]: Finished difference Result 1118 states and 1654 transitions. [2021-08-25 20:39:27,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:39:27,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 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 [2021-08-25 20:39:27,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:39:27,104 INFO L225 Difference]: With dead ends: 1118 [2021-08-25 20:39:27,104 INFO L226 Difference]: Without dead ends: 653 [2021-08-25 20:39:27,105 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 31.6ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:39:27,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2021-08-25 20:39:27,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 527. [2021-08-25 20:39:27,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.4809885931558935) internal successors, (779), 526 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:27,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 779 transitions. [2021-08-25 20:39:27,113 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 779 transitions. Word has length 141 [2021-08-25 20:39:27,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:39:27,113 INFO L470 AbstractCegarLoop]: Abstraction has 527 states and 779 transitions. [2021-08-25 20:39:27,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:27,113 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 779 transitions. [2021-08-25 20:39:27,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-08-25 20:39:27,114 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:39:27,114 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-08-25 20:39:27,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-08-25 20:39:27,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:39:27,321 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:39:27,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:39:27,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1638419441, now seen corresponding path program 1 times [2021-08-25 20:39:27,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:39:27,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122983158] [2021-08-25 20:39:27,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:39:27,322 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:39:27,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:39:27,322 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:39:27,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-08-25 20:39:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:39:28,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:39:28,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:39:28,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:39:28,566 INFO L388 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 [2021-08-25 20:39:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-25 20:39:28,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:39:29,047 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-25 20:39:29,047 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:39:29,047 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122983158] [2021-08-25 20:39:29,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1122983158] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:39:29,047 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:39:29,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:39:29,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37523463] [2021-08-25 20:39:29,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:39:29,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:39:29,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:39:29,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:39:29,048 INFO L87 Difference]: Start difference. First operand 527 states and 779 transitions. Second operand has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:32,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:39:32,124 INFO L93 Difference]: Finished difference Result 1159 states and 1708 transitions. [2021-08-25 20:39:32,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:39:32,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 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 [2021-08-25 20:39:32,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:39:32,126 INFO L225 Difference]: With dead ends: 1159 [2021-08-25 20:39:32,126 INFO L226 Difference]: Without dead ends: 635 [2021-08-25 20:39:32,127 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 33.1ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:39:32,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2021-08-25 20:39:32,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 519. [2021-08-25 20:39:32,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 1.4768339768339769) internal successors, (765), 518 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:32,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 765 transitions. [2021-08-25 20:39:32,135 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 765 transitions. Word has length 142 [2021-08-25 20:39:32,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:39:32,135 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 765 transitions. [2021-08-25 20:39:32,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:32,136 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 765 transitions. [2021-08-25 20:39:32,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-08-25 20:39:32,136 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:39:32,137 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-08-25 20:39:32,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-08-25 20:39:32,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:39:32,347 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:39:32,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:39:32,348 INFO L82 PathProgramCache]: Analyzing trace with hash 127108449, now seen corresponding path program 1 times [2021-08-25 20:39:32,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:39:32,348 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002951303] [2021-08-25 20:39:32,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:39:32,349 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:39:32,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:39:32,349 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:39:32,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-08-25 20:39:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:39:33,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:39:33,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:39:33,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:39:33,550 INFO L388 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 [2021-08-25 20:39:33,732 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-08-25 20:39:33,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:39:34,076 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-08-25 20:39:34,076 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:39:34,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002951303] [2021-08-25 20:39:34,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002951303] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:39:34,076 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:39:34,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:39:34,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783130666] [2021-08-25 20:39:34,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:39:34,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:39:34,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:39:34,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:39:34,078 INFO L87 Difference]: Start difference. First operand 519 states and 765 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 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) [2021-08-25 20:39:37,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:39:37,596 INFO L93 Difference]: Finished difference Result 1169 states and 1721 transitions. [2021-08-25 20:39:37,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:39:37,597 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 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 144 [2021-08-25 20:39:37,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:39:37,599 INFO L225 Difference]: With dead ends: 1169 [2021-08-25 20:39:37,599 INFO L226 Difference]: Without dead ends: 669 [2021-08-25 20:39:37,599 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 32.1ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:39:37,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2021-08-25 20:39:37,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 545. [2021-08-25 20:39:37,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 1.4613970588235294) internal successors, (795), 544 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:37,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 795 transitions. [2021-08-25 20:39:37,608 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 795 transitions. Word has length 144 [2021-08-25 20:39:37,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:39:37,608 INFO L470 AbstractCegarLoop]: Abstraction has 545 states and 795 transitions. [2021-08-25 20:39:37,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 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) [2021-08-25 20:39:37,609 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 795 transitions. [2021-08-25 20:39:37,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-08-25 20:39:37,610 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:39:37,610 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:39:37,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-08-25 20:39:37,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:39:37,821 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:39:37,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:39:37,821 INFO L82 PathProgramCache]: Analyzing trace with hash -49779866, now seen corresponding path program 1 times [2021-08-25 20:39:37,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:39:37,822 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534614012] [2021-08-25 20:39:37,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:39:37,822 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:39:37,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:39:37,822 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:39:37,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-08-25 20:39:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:39:39,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:39:39,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:39:39,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:39:39,116 INFO L388 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 [2021-08-25 20:39:39,302 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-08-25 20:39:39,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:39:39,663 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-08-25 20:39:39,663 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:39:39,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534614012] [2021-08-25 20:39:39,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534614012] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:39:39,666 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:39:39,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:39:39,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962845727] [2021-08-25 20:39:39,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:39:39,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:39:39,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:39:39,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:39:39,668 INFO L87 Difference]: Start difference. First operand 545 states and 795 transitions. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:43,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:39:43,096 INFO L93 Difference]: Finished difference Result 1185 states and 1727 transitions. [2021-08-25 20:39:43,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:39:43,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 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 [2021-08-25 20:39:43,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:39:43,098 INFO L225 Difference]: With dead ends: 1185 [2021-08-25 20:39:43,098 INFO L226 Difference]: Without dead ends: 659 [2021-08-25 20:39:43,099 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 32.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:39:43,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2021-08-25 20:39:43,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 545. [2021-08-25 20:39:43,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 1.443014705882353) internal successors, (785), 544 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:43,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 785 transitions. [2021-08-25 20:39:43,107 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 785 transitions. Word has length 145 [2021-08-25 20:39:43,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:39:43,107 INFO L470 AbstractCegarLoop]: Abstraction has 545 states and 785 transitions. [2021-08-25 20:39:43,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:43,108 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 785 transitions. [2021-08-25 20:39:43,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-08-25 20:39:43,108 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:39:43,109 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:39:43,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-08-25 20:39:43,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:39:43,317 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:39:43,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:39:43,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1100606371, now seen corresponding path program 1 times [2021-08-25 20:39:43,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:39:43,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993532852] [2021-08-25 20:39:43,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:39:43,318 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:39:43,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:39:43,318 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:39:43,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-08-25 20:39:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:39:44,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:39:44,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:39:44,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:39:44,734 INFO L388 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 [2021-08-25 20:39:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-08-25 20:39:44,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:39:45,298 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-08-25 20:39:45,299 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:39:45,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993532852] [2021-08-25 20:39:45,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993532852] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:39:45,299 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:39:45,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:39:45,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112404133] [2021-08-25 20:39:45,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:39:45,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:39:45,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:39:45,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:39:45,300 INFO L87 Difference]: Start difference. First operand 545 states and 785 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:48,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:39:48,565 INFO L93 Difference]: Finished difference Result 1219 states and 1755 transitions. [2021-08-25 20:39:48,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:39:48,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 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 155 [2021-08-25 20:39:48,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:39:48,567 INFO L225 Difference]: With dead ends: 1219 [2021-08-25 20:39:48,567 INFO L226 Difference]: Without dead ends: 693 [2021-08-25 20:39:48,568 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 32.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:39:48,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2021-08-25 20:39:48,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 578. [2021-08-25 20:39:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 577 states have (on average 1.4332755632582321) internal successors, (827), 577 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 827 transitions. [2021-08-25 20:39:48,577 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 827 transitions. Word has length 155 [2021-08-25 20:39:48,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:39:48,577 INFO L470 AbstractCegarLoop]: Abstraction has 578 states and 827 transitions. [2021-08-25 20:39:48,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:48,578 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 827 transitions. [2021-08-25 20:39:48,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-08-25 20:39:48,579 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:39:48,579 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-08-25 20:39:48,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-08-25 20:39:48,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:39:48,783 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:39:48,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:39:48,784 INFO L82 PathProgramCache]: Analyzing trace with hash 103864115, now seen corresponding path program 1 times [2021-08-25 20:39:48,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:39:48,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478735341] [2021-08-25 20:39:48,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:39:48,785 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:39:48,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:39:48,785 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:39:48,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-08-25 20:39:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:39:50,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:39:50,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:39:50,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:39:50,237 INFO L388 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 [2021-08-25 20:39:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-08-25 20:39:50,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:39:50,762 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-08-25 20:39:50,763 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:39:50,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478735341] [2021-08-25 20:39:50,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478735341] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:39:50,763 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:39:50,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:39:50,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844802300] [2021-08-25 20:39:50,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:39:50,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:39:50,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:39:50,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:39:50,764 INFO L87 Difference]: Start difference. First operand 578 states and 827 transitions. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:52,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:39:52,861 INFO L93 Difference]: Finished difference Result 1247 states and 1784 transitions. [2021-08-25 20:39:52,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:39:52,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 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 [2021-08-25 20:39:52,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:39:52,864 INFO L225 Difference]: With dead ends: 1247 [2021-08-25 20:39:52,864 INFO L226 Difference]: Without dead ends: 670 [2021-08-25 20:39:52,864 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 32.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:39:52,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2021-08-25 20:39:52,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 569. [2021-08-25 20:39:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.420774647887324) internal successors, (807), 568 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 807 transitions. [2021-08-25 20:39:52,881 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 807 transitions. Word has length 156 [2021-08-25 20:39:52,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:39:52,881 INFO L470 AbstractCegarLoop]: Abstraction has 569 states and 807 transitions. [2021-08-25 20:39:52,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:52,882 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 807 transitions. [2021-08-25 20:39:52,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-08-25 20:39:52,882 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:39:52,882 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2021-08-25 20:39:52,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2021-08-25 20:39:53,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:39:53,093 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:39:53,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:39:53,093 INFO L82 PathProgramCache]: Analyzing trace with hash -846499204, now seen corresponding path program 1 times [2021-08-25 20:39:53,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:39:53,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292156806] [2021-08-25 20:39:53,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:39:53,094 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:39:53,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:39:53,094 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:39:53,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-08-25 20:39:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:39:54,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:39:54,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:39:54,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:39:54,571 INFO L388 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 [2021-08-25 20:39:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-08-25 20:39:54,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:39:55,163 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-08-25 20:39:55,164 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:39:55,164 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292156806] [2021-08-25 20:39:55,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292156806] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:39:55,164 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:39:55,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:39:55,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129680073] [2021-08-25 20:39:55,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:39:55,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:39:55,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:39:55,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:39:55,165 INFO L87 Difference]: Start difference. First operand 569 states and 807 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:58,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:39:58,282 INFO L93 Difference]: Finished difference Result 1245 states and 1771 transitions. [2021-08-25 20:39:58,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:39:58,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 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 [2021-08-25 20:39:58,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:39:58,286 INFO L225 Difference]: With dead ends: 1245 [2021-08-25 20:39:58,286 INFO L226 Difference]: Without dead ends: 695 [2021-08-25 20:39:58,287 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 42.0ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:39:58,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2021-08-25 20:39:58,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 591. [2021-08-25 20:39:58,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 1.4016949152542373) internal successors, (827), 590 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:58,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 827 transitions. [2021-08-25 20:39:58,302 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 827 transitions. Word has length 163 [2021-08-25 20:39:58,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:39:58,302 INFO L470 AbstractCegarLoop]: Abstraction has 591 states and 827 transitions. [2021-08-25 20:39:58,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:39:58,302 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 827 transitions. [2021-08-25 20:39:58,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-08-25 20:39:58,303 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:39:58,303 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-08-25 20:39:58,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2021-08-25 20:39:58,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:39:58,516 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:39:58,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:39:58,516 INFO L82 PathProgramCache]: Analyzing trace with hash 160236311, now seen corresponding path program 1 times [2021-08-25 20:39:58,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:39:58,517 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451153487] [2021-08-25 20:39:58,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:39:58,517 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:39:58,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:39:58,517 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:39:58,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-08-25 20:39:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:39:59,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:39:59,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:39:59,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:40:00,061 INFO L388 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 [2021-08-25 20:40:00,294 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-08-25 20:40:00,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:40:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-08-25 20:40:00,667 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:40:00,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451153487] [2021-08-25 20:40:00,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1451153487] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:40:00,667 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:40:00,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:40:00,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062905857] [2021-08-25 20:40:00,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:40:00,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:40:00,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:40:00,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:40:00,668 INFO L87 Difference]: Start difference. First operand 591 states and 827 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:40:03,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:40:03,710 INFO L93 Difference]: Finished difference Result 1260 states and 1767 transitions. [2021-08-25 20:40:03,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:40:03,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 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 164 [2021-08-25 20:40:03,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:40:03,713 INFO L225 Difference]: With dead ends: 1260 [2021-08-25 20:40:03,713 INFO L226 Difference]: Without dead ends: 688 [2021-08-25 20:40:03,714 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 34.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:40:03,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2021-08-25 20:40:03,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 591. [2021-08-25 20:40:03,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 1.38135593220339) internal successors, (815), 590 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:40:03,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 815 transitions. [2021-08-25 20:40:03,724 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 815 transitions. Word has length 164 [2021-08-25 20:40:03,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:40:03,724 INFO L470 AbstractCegarLoop]: Abstraction has 591 states and 815 transitions. [2021-08-25 20:40:03,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:40:03,725 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 815 transitions. [2021-08-25 20:40:03,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-08-25 20:40:03,726 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:40:03,726 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1] [2021-08-25 20:40:03,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2021-08-25 20:40:03,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:40:03,932 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:40:03,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:40:03,933 INFO L82 PathProgramCache]: Analyzing trace with hash -554395830, now seen corresponding path program 1 times [2021-08-25 20:40:03,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:40:03,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167893022] [2021-08-25 20:40:03,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:40:03,933 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:40:03,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:40:03,934 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:40:03,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-08-25 20:40:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:40:05,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:40:05,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:40:05,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:40:05,661 INFO L388 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 [2021-08-25 20:40:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-08-25 20:40:05,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:40:06,336 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-08-25 20:40:06,336 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:40:06,336 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [167893022] [2021-08-25 20:40:06,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [167893022] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:40:06,336 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:40:06,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:40:06,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786565496] [2021-08-25 20:40:06,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:40:06,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:40:06,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:40:06,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:40:06,337 INFO L87 Difference]: Start difference. First operand 591 states and 815 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 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) [2021-08-25 20:40:09,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:40:09,309 INFO L93 Difference]: Finished difference Result 1285 states and 1777 transitions. [2021-08-25 20:40:09,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:40:09,311 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 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 166 [2021-08-25 20:40:09,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:40:09,313 INFO L225 Difference]: With dead ends: 1285 [2021-08-25 20:40:09,313 INFO L226 Difference]: Without dead ends: 713 [2021-08-25 20:40:09,313 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 32.6ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:40:09,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2021-08-25 20:40:09,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 615. [2021-08-25 20:40:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 614 states have (on average 1.3631921824104234) internal successors, (837), 614 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:40:09,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 837 transitions. [2021-08-25 20:40:09,324 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 837 transitions. Word has length 166 [2021-08-25 20:40:09,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:40:09,324 INFO L470 AbstractCegarLoop]: Abstraction has 615 states and 837 transitions. [2021-08-25 20:40:09,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 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) [2021-08-25 20:40:09,324 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 837 transitions. [2021-08-25 20:40:09,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-08-25 20:40:09,325 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:40:09,325 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:40:09,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2021-08-25 20:40:09,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:40:09,545 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:40:09,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:40:09,545 INFO L82 PathProgramCache]: Analyzing trace with hash -443861771, now seen corresponding path program 1 times [2021-08-25 20:40:09,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:40:09,546 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323180641] [2021-08-25 20:40:09,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:40:09,546 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:40:09,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:40:09,546 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:40:09,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-08-25 20:40:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:40:11,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:40:11,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:40:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-08-25 20:40:11,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:40:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-08-25 20:40:11,838 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:40:11,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323180641] [2021-08-25 20:40:11,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323180641] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:40:11,839 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:40:11,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 20:40:11,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416160169] [2021-08-25 20:40:11,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:40:11,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:40:11,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:40:11,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:40:11,840 INFO L87 Difference]: Start difference. First operand 615 states and 837 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:40:12,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:40:12,185 INFO L93 Difference]: Finished difference Result 1799 states and 2455 transitions. [2021-08-25 20:40:12,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:40:12,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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 166 [2021-08-25 20:40:12,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:40:12,188 INFO L225 Difference]: With dead ends: 1799 [2021-08-25 20:40:12,188 INFO L226 Difference]: Without dead ends: 1203 [2021-08-25 20:40:12,189 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:40:12,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2021-08-25 20:40:12,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1203. [2021-08-25 20:40:12,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 1202 states have (on average 1.3560732113144758) internal successors, (1630), 1202 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:40:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1630 transitions. [2021-08-25 20:40:12,209 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1630 transitions. Word has length 166 [2021-08-25 20:40:12,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:40:12,209 INFO L470 AbstractCegarLoop]: Abstraction has 1203 states and 1630 transitions. [2021-08-25 20:40:12,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:40:12,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1630 transitions. [2021-08-25 20:40:12,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-08-25 20:40:12,210 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:40:12,210 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1] [2021-08-25 20:40:12,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2021-08-25 20:40:12,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:40:12,411 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:40:12,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:40:12,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1819906095, now seen corresponding path program 1 times [2021-08-25 20:40:12,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:40:12,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863039112] [2021-08-25 20:40:12,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:40:12,412 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:40:12,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:40:12,413 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:40:12,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2021-08-25 20:40:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:40:14,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:40:14,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:40:14,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:40:14,333 INFO L388 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 [2021-08-25 20:40:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-08-25 20:40:14,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:40:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-08-25 20:40:14,966 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:40:14,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863039112] [2021-08-25 20:40:14,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863039112] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:40:14,966 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:40:14,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:40:14,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965916784] [2021-08-25 20:40:14,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:40:14,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:40:14,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:40:14,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:40:14,967 INFO L87 Difference]: Start difference. First operand 1203 states and 1630 transitions. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:40:17,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:40:17,611 INFO L93 Difference]: Finished difference Result 2567 states and 3479 transitions. [2021-08-25 20:40:17,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:40:17,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 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 167 [2021-08-25 20:40:17,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:40:17,615 INFO L225 Difference]: With dead ends: 2567 [2021-08-25 20:40:17,615 INFO L226 Difference]: Without dead ends: 1367 [2021-08-25 20:40:17,616 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 32.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:40:17,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2021-08-25 20:40:17,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1195. [2021-08-25 20:40:17,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 1194 states have (on average 1.3350083752093802) internal successors, (1594), 1194 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:40:17,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1594 transitions. [2021-08-25 20:40:17,637 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1594 transitions. Word has length 167 [2021-08-25 20:40:17,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:40:17,637 INFO L470 AbstractCegarLoop]: Abstraction has 1195 states and 1594 transitions. [2021-08-25 20:40:17,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:40:17,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1594 transitions. [2021-08-25 20:40:17,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-08-25 20:40:17,638 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:40:17,638 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:40:17,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2021-08-25 20:40:17,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:40:17,851 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:40:17,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:40:17,851 INFO L82 PathProgramCache]: Analyzing trace with hash -317547734, now seen corresponding path program 1 times [2021-08-25 20:40:17,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:40:17,852 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596334619] [2021-08-25 20:40:17,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:40:17,852 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:40:17,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:40:17,853 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:40:17,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2021-08-25 20:40:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:40:19,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:40:19,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:40:19,882 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:40:19,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:40:20,179 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:40:20,179 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:40:20,180 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596334619] [2021-08-25 20:40:20,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596334619] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:40:20,180 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:40:20,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 20:40:20,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418603001] [2021-08-25 20:40:20,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:40:20,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:40:20,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:40:20,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:40:20,181 INFO L87 Difference]: Start difference. First operand 1195 states and 1594 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:40:20,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:40:20,344 INFO L93 Difference]: Finished difference Result 2920 states and 3903 transitions. [2021-08-25 20:40:20,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:40:20,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 167 [2021-08-25 20:40:20,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:40:20,349 INFO L225 Difference]: With dead ends: 2920 [2021-08-25 20:40:20,349 INFO L226 Difference]: Without dead ends: 1744 [2021-08-25 20:40:20,350 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:40:20,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2021-08-25 20:40:20,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1742. [2021-08-25 20:40:20,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1742 states, 1741 states have (on average 1.3331418724870765) internal successors, (2321), 1741 states have internal predecessors, (2321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:40:20,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 2321 transitions. [2021-08-25 20:40:20,400 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 2321 transitions. Word has length 167 [2021-08-25 20:40:20,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:40:20,400 INFO L470 AbstractCegarLoop]: Abstraction has 1742 states and 2321 transitions. [2021-08-25 20:40:20,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:40:20,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 2321 transitions. [2021-08-25 20:40:20,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-08-25 20:40:20,402 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:40:20,402 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:40:20,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2021-08-25 20:40:20,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:40:20,618 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:40:20,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:40:20,619 INFO L82 PathProgramCache]: Analyzing trace with hash 2001105334, now seen corresponding path program 1 times [2021-08-25 20:40:20,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:40:20,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857977243] [2021-08-25 20:40:20,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:40:20,619 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:40:20,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:40:20,625 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:40:20,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2021-08-25 20:40:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:40:22,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:40:22,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:40:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-08-25 20:40:22,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:40:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-08-25 20:40:23,134 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:40:23,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857977243] [2021-08-25 20:40:23,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857977243] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:40:23,135 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:40:23,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 20:40:23,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481237259] [2021-08-25 20:40:23,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:40:23,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:40:23,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:40:23,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:40:23,135 INFO L87 Difference]: Start difference. First operand 1742 states and 2321 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:40:23,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:40:23,537 INFO L93 Difference]: Finished difference Result 4005 states and 5350 transitions. [2021-08-25 20:40:23,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:40:23,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 168 [2021-08-25 20:40:23,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:40:23,542 INFO L225 Difference]: With dead ends: 4005 [2021-08-25 20:40:23,542 INFO L226 Difference]: Without dead ends: 2282 [2021-08-25 20:40:23,544 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:40:23,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2021-08-25 20:40:23,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2258. [2021-08-25 20:40:23,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2258 states, 2257 states have (on average 1.3376163048294196) internal successors, (3019), 2257 states have internal predecessors, (3019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:40:23,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 3019 transitions. [2021-08-25 20:40:23,583 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 3019 transitions. Word has length 168 [2021-08-25 20:40:23,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:40:23,583 INFO L470 AbstractCegarLoop]: Abstraction has 2258 states and 3019 transitions. [2021-08-25 20:40:23,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:40:23,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 3019 transitions. [2021-08-25 20:40:23,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-08-25 20:40:23,584 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:40:23,585 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:40:23,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2021-08-25 20:40:23,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:40:23,789 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:40:23,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:40:23,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1053053368, now seen corresponding path program 1 times [2021-08-25 20:40:23,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:40:23,789 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393448871] [2021-08-25 20:40:23,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:40:23,790 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:40:23,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:40:23,791 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:40:23,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2021-08-25 20:40:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:40:25,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:40:25,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:40:25,967 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-08-25 20:40:25,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:40:26,298 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-08-25 20:40:26,298 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:40:26,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393448871] [2021-08-25 20:40:26,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393448871] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:40:26,298 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:40:26,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 20:40:26,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920816138] [2021-08-25 20:40:26,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:40:26,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:40:26,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:40:26,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:40:26,300 INFO L87 Difference]: Start difference. First operand 2258 states and 3019 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 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) [2021-08-25 20:40:26,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:40:26,534 INFO L93 Difference]: Finished difference Result 4546 states and 6083 transitions. [2021-08-25 20:40:26,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:40:26,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 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 168 [2021-08-25 20:40:26,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:40:26,539 INFO L225 Difference]: With dead ends: 4546 [2021-08-25 20:40:26,539 INFO L226 Difference]: Without dead ends: 2307 [2021-08-25 20:40:26,540 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:40:26,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2021-08-25 20:40:26,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2021-08-25 20:40:26,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.3378143972246315) internal successors, (3085), 2306 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:40:26,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3085 transitions. [2021-08-25 20:40:26,579 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3085 transitions. Word has length 168 [2021-08-25 20:40:26,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:40:26,579 INFO L470 AbstractCegarLoop]: Abstraction has 2307 states and 3085 transitions. [2021-08-25 20:40:26,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 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) [2021-08-25 20:40:26,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3085 transitions. [2021-08-25 20:40:26,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-08-25 20:40:26,581 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:40:26,581 INFO L512 BasicCegarLoop]: 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] [2021-08-25 20:40:26,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2021-08-25 20:40:26,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:40:26,784 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:40:26,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:40:26,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1438915770, now seen corresponding path program 1 times [2021-08-25 20:40:26,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:40:26,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1381084835] [2021-08-25 20:40:26,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:40:26,785 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:40:26,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:40:26,786 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:40:26,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2021-08-25 20:40:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:40:28,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:40:28,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:40:29,091 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2021-08-25 20:40:29,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:40:29,431 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2021-08-25 20:40:29,431 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:40:29,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1381084835] [2021-08-25 20:40:29,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1381084835] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:40:29,431 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:40:29,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 20:40:29,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326838484] [2021-08-25 20:40:29,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:40:29,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:40:29,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:40:29,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:40:29,432 INFO L87 Difference]: Start difference. First operand 2307 states and 3085 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:40:29,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:40:29,504 INFO L93 Difference]: Finished difference Result 4619 states and 6180 transitions. [2021-08-25 20:40:29,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:40:29,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2021-08-25 20:40:29,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:40:29,509 INFO L225 Difference]: With dead ends: 4619 [2021-08-25 20:40:29,509 INFO L226 Difference]: Without dead ends: 2331 [2021-08-25 20:40:29,511 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:40:29,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2021-08-25 20:40:29,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 2331. [2021-08-25 20:40:29,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2331 states, 2330 states have (on average 1.3377682403433477) internal successors, (3117), 2330 states have internal predecessors, (3117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:40:29,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2331 states to 2331 states and 3117 transitions. [2021-08-25 20:40:29,556 INFO L78 Accepts]: Start accepts. Automaton has 2331 states and 3117 transitions. Word has length 168 [2021-08-25 20:40:29,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:40:29,556 INFO L470 AbstractCegarLoop]: Abstraction has 2331 states and 3117 transitions. [2021-08-25 20:40:29,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:40:29,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2331 states and 3117 transitions. [2021-08-25 20:40:29,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-08-25 20:40:29,557 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:40:29,558 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:40:29,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2021-08-25 20:40:29,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:40:29,774 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:40:29,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:40:29,774 INFO L82 PathProgramCache]: Analyzing trace with hash 725002316, now seen corresponding path program 1 times [2021-08-25 20:40:29,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:40:29,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [613115880] [2021-08-25 20:40:29,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:40:29,775 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:40:29,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:40:29,775 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:40:29,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2021-08-25 20:40:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:40:32,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 37 conjunts are in the unsatisfiable core [2021-08-25 20:40:32,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:40:32,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:32,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:32,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:32,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2021-08-25 20:40:32,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:32,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:32,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:32,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2021-08-25 20:40:32,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 12 [2021-08-25 20:40:32,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:32,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:40:32,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:32,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:40:32,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:32,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:32,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:32,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-08-25 20:40:32,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:32,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:40:32,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:32,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:40:32,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:32,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:32,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:32,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-08-25 20:40:33,009 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 20:40:33,032 INFO L354 Elim1Store]: treesize reduction 119, result has 8.5 percent of original size [2021-08-25 20:40:33,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 45 [2021-08-25 20:40:33,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:33,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:33,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:33,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-08-25 20:40:33,287 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 20:40:33,307 INFO L354 Elim1Store]: treesize reduction 117, result has 10.0 percent of original size [2021-08-25 20:40:33,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 47 [2021-08-25 20:40:33,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:33,920 INFO L354 Elim1Store]: treesize reduction 128, result has 19.5 percent of original size [2021-08-25 20:40:33,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 292 treesize of output 222 [2021-08-25 20:40:33,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 232 [2021-08-25 20:40:33,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:33,931 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 20:40:33,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:33,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 175 [2021-08-25 20:40:34,060 INFO L354 Elim1Store]: treesize reduction 59, result has 13.2 percent of original size [2021-08-25 20:40:34,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 165 [2021-08-25 20:40:34,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:34,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 116 [2021-08-25 20:40:34,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 144 [2021-08-25 20:40:34,097 INFO L354 Elim1Store]: treesize reduction 55, result has 8.3 percent of original size [2021-08-25 20:40:34,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 110 [2021-08-25 20:40:34,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:34,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:34,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 97 [2021-08-25 20:40:34,117 INFO L354 Elim1Store]: treesize reduction 58, result has 15.9 percent of original size [2021-08-25 20:40:34,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 87 [2021-08-25 20:40:34,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:34,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 69 [2021-08-25 20:40:34,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 72 treesize of output 71 [2021-08-25 20:40:34,787 INFO L388 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 81 treesize of output 63 [2021-08-25 20:40:34,795 INFO L388 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 63 treesize of output 51 [2021-08-25 20:40:34,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:40:34,820 INFO L354 Elim1Store]: treesize reduction 67, result has 11.8 percent of original size [2021-08-25 20:40:34,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 41 [2021-08-25 20:40:35,629 INFO L354 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2021-08-25 20:40:35,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 17 [2021-08-25 20:40:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:40:35,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:40:36,018 INFO L388 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 2194 treesize of output 2050 [2021-08-25 20:40:36,154 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-25 20:40:36,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 4297 treesize of output 3346 [2021-08-25 20:40:36,273 INFO L354 Elim1Store]: treesize reduction 68, result has 37.0 percent of original size [2021-08-25 20:40:36,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 3346 treesize of output 1661 [2021-08-25 20:40:36,287 INFO L388 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 1653 treesize of output 1567 [2021-08-25 20:40:36,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16743 treesize of output 15319 [2021-08-25 20:40:37,355 INFO L388 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 43 treesize of output 37 [2021-08-25 20:40:37,592 INFO L388 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 43 treesize of output 37 [2021-08-25 20:40:38,111 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:40:38,111 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:40:38,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [613115880] [2021-08-25 20:40:38,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [613115880] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 20:40:38,111 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:40:38,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-08-25 20:40:38,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951941164] [2021-08-25 20:40:38,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-25 20:40:38,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:40:38,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-25 20:40:38,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-08-25 20:40:38,113 INFO L87 Difference]: Start difference. First operand 2331 states and 3117 transitions. Second operand has 9 states, 9 states have (on average 26.77777777777778) internal successors, (241), 9 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:41:35,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:41:35,482 INFO L93 Difference]: Finished difference Result 5674 states and 7589 transitions. [2021-08-25 20:41:35,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-25 20:41:35,484 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.77777777777778) internal successors, (241), 9 states have internal predecessors, (241), 0 states have call successors, (0), 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 191 [2021-08-25 20:41:35,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:41:35,507 INFO L225 Difference]: With dead ends: 5674 [2021-08-25 20:41:35,508 INFO L226 Difference]: Without dead ends: 3386 [2021-08-25 20:41:35,510 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 364 SyntacticMatches, 9 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 317.9ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-08-25 20:41:35,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2021-08-25 20:41:35,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 2912. [2021-08-25 20:41:35,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2912 states, 2911 states have (on average 1.34833390587427) internal successors, (3925), 2911 states have internal predecessors, (3925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:41:35,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2912 states to 2912 states and 3925 transitions. [2021-08-25 20:41:35,579 INFO L78 Accepts]: Start accepts. Automaton has 2912 states and 3925 transitions. Word has length 191 [2021-08-25 20:41:35,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:41:35,579 INFO L470 AbstractCegarLoop]: Abstraction has 2912 states and 3925 transitions. [2021-08-25 20:41:35,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.77777777777778) internal successors, (241), 9 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:41:35,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2912 states and 3925 transitions. [2021-08-25 20:41:35,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2021-08-25 20:41:35,582 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:41:35,583 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:41:35,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Ended with exit code 0 [2021-08-25 20:41:35,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:41:35,797 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:41:35,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:41:35,798 INFO L82 PathProgramCache]: Analyzing trace with hash 47555143, now seen corresponding path program 1 times [2021-08-25 20:41:35,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:41:35,798 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253653946] [2021-08-25 20:41:35,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:41:35,798 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:41:35,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:41:35,799 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:41:35,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2021-08-25 20:41:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:41:38,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 36 conjunts are in the unsatisfiable core [2021-08-25 20:41:38,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:41:38,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:38,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:38,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:38,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 69 [2021-08-25 20:41:38,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:38,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:38,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:38,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2021-08-25 20:41:38,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 [2021-08-25 20:41:38,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:38,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:41:38,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:38,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:41:38,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:38,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:38,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:38,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-08-25 20:41:39,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:39,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:41:39,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:39,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:41:39,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:39,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:39,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:39,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-08-25 20:41:39,360 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 20:41:39,380 INFO L354 Elim1Store]: treesize reduction 117, result has 10.0 percent of original size [2021-08-25 20:41:39,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 47 [2021-08-25 20:41:39,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:39,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:39,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:39,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-08-25 20:41:39,598 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 20:41:39,617 INFO L354 Elim1Store]: treesize reduction 119, result has 8.5 percent of original size [2021-08-25 20:41:39,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 45 [2021-08-25 20:41:39,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:40,016 INFO L354 Elim1Store]: treesize reduction 128, result has 19.5 percent of original size [2021-08-25 20:41:40,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 292 treesize of output 222 [2021-08-25 20:41:40,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 232 [2021-08-25 20:41:40,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:40,042 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 20:41:40,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:40,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 175 [2021-08-25 20:41:40,126 INFO L354 Elim1Store]: treesize reduction 59, result has 13.2 percent of original size [2021-08-25 20:41:40,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 165 [2021-08-25 20:41:40,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:40,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 116 [2021-08-25 20:41:40,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 144 [2021-08-25 20:41:40,159 INFO L354 Elim1Store]: treesize reduction 55, result has 8.3 percent of original size [2021-08-25 20:41:40,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 110 [2021-08-25 20:41:40,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:40,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:40,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 97 [2021-08-25 20:41:40,187 INFO L354 Elim1Store]: treesize reduction 58, result has 15.9 percent of original size [2021-08-25 20:41:40,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 87 [2021-08-25 20:41:40,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:40,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 69 [2021-08-25 20:41:40,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 72 treesize of output 71 [2021-08-25 20:41:40,776 INFO L388 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 81 treesize of output 63 [2021-08-25 20:41:40,778 INFO L388 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 63 treesize of output 51 [2021-08-25 20:41:40,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:41:40,793 INFO L354 Elim1Store]: treesize reduction 67, result has 11.8 percent of original size [2021-08-25 20:41:40,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 41 [2021-08-25 20:41:41,059 INFO L354 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2021-08-25 20:41:41,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 17 [2021-08-25 20:41:41,191 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 351 proven. 63 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2021-08-25 20:41:41,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:41:41,529 INFO L388 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 1101 treesize of output 957 [2021-08-25 20:41:41,566 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-25 20:41:41,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 855 treesize of output 826 [2021-08-25 20:41:41,731 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-08-25 20:41:41,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 1051 treesize of output 1020 [2021-08-25 20:41:51,079 WARN L207 SmtUtils]: Spent 9.34 s on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2021-08-25 20:41:51,080 INFO L354 Elim1Store]: treesize reduction 238, result has 26.8 percent of original size [2021-08-25 20:41:51,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 1120 treesize of output 1030 [2021-08-25 20:41:51,115 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:41:51,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253653946] [2021-08-25 20:41:51,116 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-08-25 20:41:51,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [220569411] [2021-08-25 20:41:51,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:41:51,117 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-08-25 20:41:51,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-08-25 20:41:51,121 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-08-25 20:41:51,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2021-08-25 20:41:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:41:58,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 68 conjunts are in the unsatisfiable core [2021-08-25 20:41:58,925 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@8f0fdfc [2021-08-25 20:41:58,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702159938] [2021-08-25 20:41:58,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:41:58,925 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:41:58,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:41:58,926 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:41:58,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2021-08-25 20:42:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:42:01,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 39 conjunts are in the unsatisfiable core [2021-08-25 20:42:01,865 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@8f0fdfc [2021-08-25 20:42:01,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:42:01,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-08-25 20:42:01,865 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-08-25 20:42:01,865 INFO L626 BasicCegarLoop]: Counterexample might be feasible [2021-08-25 20:42:01,869 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:42:01,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2021-08-25 20:42:02,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2021-08-25 20:42:02,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2021-08-25 20:42:02,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:42:02,474 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:42:02,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:42:02 BoogieIcfgContainer [2021-08-25 20:42:02,508 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:42:02,508 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:42:02,509 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:42:02,509 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:42:02,509 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:38:03" (3/4) ... [2021-08-25 20:42:02,511 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-25 20:42:02,511 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:42:02,512 INFO L168 Benchmark]: Toolchain (without parser) took 241161.37 ms. Allocated memory was 67.1 MB in the beginning and 786.4 MB in the end (delta: 719.3 MB). Free memory was 45.2 MB in the beginning and 518.4 MB in the end (delta: -473.1 MB). Peak memory consumption was 246.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:42:02,512 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 67.1 MB. Free memory was 47.9 MB in the beginning and 47.8 MB in the end (delta: 40.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:42:02,512 INFO L168 Benchmark]: CACSL2BoogieTranslator took 425.93 ms. Allocated memory is still 67.1 MB. Free memory was 45.0 MB in the beginning and 29.1 MB in the end (delta: 16.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-25 20:42:02,512 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.71 ms. Allocated memory is still 67.1 MB. Free memory was 29.1 MB in the beginning and 45.2 MB in the end (delta: -16.2 MB). Peak memory consumption was 6.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:42:02,512 INFO L168 Benchmark]: Boogie Preprocessor took 62.99 ms. Allocated memory is still 67.1 MB. Free memory was 45.2 MB in the beginning and 38.1 MB in the end (delta: 7.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:42:02,513 INFO L168 Benchmark]: RCFGBuilder took 1293.90 ms. Allocated memory was 67.1 MB in the beginning and 81.8 MB in the end (delta: 14.7 MB). Free memory was 38.1 MB in the beginning and 47.9 MB in the end (delta: -9.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:42:02,513 INFO L168 Benchmark]: TraceAbstraction took 239286.40 ms. Allocated memory was 81.8 MB in the beginning and 786.4 MB in the end (delta: 704.6 MB). Free memory was 47.5 MB in the beginning and 518.4 MB in the end (delta: -470.9 MB). Peak memory consumption was 234.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:42:02,513 INFO L168 Benchmark]: Witness Printer took 2.66 ms. Allocated memory is still 786.4 MB. Free memory is still 518.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:42:02,514 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.15 ms. Allocated memory is still 67.1 MB. Free memory was 47.9 MB in the beginning and 47.8 MB in the end (delta: 40.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 425.93 ms. Allocated memory is still 67.1 MB. Free memory was 45.0 MB in the beginning and 29.1 MB in the end (delta: 16.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 83.71 ms. Allocated memory is still 67.1 MB. Free memory was 29.1 MB in the beginning and 45.2 MB in the end (delta: -16.2 MB). Peak memory consumption was 6.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 62.99 ms. Allocated memory is still 67.1 MB. Free memory was 45.2 MB in the beginning and 38.1 MB in the end (delta: 7.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1293.90 ms. Allocated memory was 67.1 MB in the beginning and 81.8 MB in the end (delta: 14.7 MB). Free memory was 38.1 MB in the beginning and 47.9 MB in the end (delta: -9.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 239286.40 ms. Allocated memory was 81.8 MB in the beginning and 786.4 MB in the end (delta: 704.6 MB). Free memory was 47.5 MB in the beginning and 518.4 MB in the end (delta: -470.9 MB). Peak memory consumption was 234.1 MB. Max. memory is 16.1 GB. * Witness Printer took 2.66 ms. Allocated memory is still 786.4 MB. Free memory is still 518.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1737]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_server_data ; [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1082] BUF_MEM *buf ; [L1083] unsigned long l ; [L1084] unsigned long Time ; [L1085] unsigned long tmp ; [L1086] void (*cb)() ; [L1087] long num1 ; [L1088] int ret ; [L1089] int new_state ; [L1090] int state ; [L1091] int skip ; [L1092] int got_new_session ; [L1093] int tmp___1 = __VERIFIER_nondet_int() ; [L1094] int tmp___2 = __VERIFIER_nondet_int() ; [L1095] int tmp___3 = __VERIFIER_nondet_int() ; [L1096] int tmp___4 = __VERIFIER_nondet_int() ; [L1097] int tmp___5 = __VERIFIER_nondet_int() ; [L1098] int tmp___6 = __VERIFIER_nondet_int() ; [L1099] int tmp___7 ; [L1100] long tmp___8 = __VERIFIER_nondet_long() ; [L1101] int tmp___9 = __VERIFIER_nondet_int() ; [L1102] int tmp___10 = __VERIFIER_nondet_int() ; [L1103] int blastFlag ; [L1107] s->state = 8464 [L1108] blastFlag = 0 [L1109] s->hit=__VERIFIER_nondet_int () [L1110] s->state = 8464 [L1111] tmp = __VERIFIER_nondet_int() [L1112] Time = tmp [L1113] cb = (void (*)())((void *)0) [L1114] ret = -1 [L1115] skip = 0 [L1116] got_new_session = 0 [L1117] EXPR s->info_callback [L1117] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1118] EXPR s->info_callback [L1118] cb = s->info_callback [L1122] EXPR s->in_handshake [L1122] s->in_handshake += 1 [L1123] COND FALSE !(tmp___1 & 12288) [L1132] EXPR s->cert [L1132] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1138] COND TRUE 1 [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state [L1165] COND TRUE s->state == 8464 [L1325] s->shutdown = 0 [L1326] ret = __VERIFIER_nondet_int() [L1327] COND TRUE blastFlag == 0 [L1328] blastFlag = 1 [L1332] COND FALSE !(ret <= 0) [L1337] got_new_session = 1 [L1338] s->state = 8496 [L1339] s->init_num = 0 [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 [L1138] COND TRUE 1 [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state [L1174] COND TRUE s->state == 8496 [L1343] ret = __VERIFIER_nondet_int() [L1344] COND TRUE blastFlag == 1 [L1345] blastFlag = 2 [L1349] COND FALSE !(ret <= 0) [L1354] s->hit [L1354] COND FALSE !(s->hit) [L1357] s->state = 8512 [L1359] s->init_num = 0 [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 [L1138] COND TRUE 1 [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state [L1180] COND TRUE s->state == 8512 [L1363] EXPR s->s3 [L1363] EXPR (s->s3)->tmp.new_cipher [L1363] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1363] COND TRUE ((s->s3)->tmp.new_cipher)->algorithms & 256UL [L1364] skip = 1 [L1373] s->state = 8528 [L1374] s->init_num = 0 [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 [L1138] COND TRUE 1 [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state [L1186] COND TRUE s->state == 8528 [L1378] EXPR s->s3 [L1378] EXPR (s->s3)->tmp.new_cipher [L1378] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1378] l = ((s->s3)->tmp.new_cipher)->algorithms [L1379] EXPR s->options [L1379] COND TRUE s->options & 2097152UL [L1380] EXPR s->s3 [L1380] (s->s3)->tmp.use_rsa_tmp = 1 [L1384] EXPR s->s3 [L1384] (s->s3)->tmp.use_rsa_tmp [L1384] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1402] ret = __VERIFIER_nondet_int() [L1403] COND FALSE !(ret <= 0) [L1420] s->state = 8544 [L1421] s->init_num = 0 [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 [L1138] COND TRUE 1 [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state [L1192] COND TRUE s->state == 8544 [L1425] EXPR s->verify_mode [L1425] COND TRUE s->verify_mode & 1 [L1426] EXPR s->session [L1426] EXPR (s->session)->peer [L1426] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1436] EXPR s->s3 [L1436] EXPR (s->s3)->tmp.new_cipher [L1436] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1436] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1446] EXPR s->s3 [L1446] (s->s3)->tmp.cert_request = 1 [L1447] ret = __VERIFIER_nondet_int() [L1448] COND FALSE !(ret <= 0) [L1453] s->state = 8448 [L1454] EXPR s->s3 [L1454] (s->s3)->tmp.next_state = 8576 [L1455] s->init_num = 0 [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 [L1138] COND TRUE 1 [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state [L1204] COND TRUE s->state == 8448 [L1477] COND FALSE !(num1 > 0L) [L1490] EXPR s->s3 [L1490] EXPR (s->s3)->tmp.next_state [L1490] s->state = (s->s3)->tmp.next_state [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 [L1138] COND TRUE 1 [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state [L1156] COND TRUE s->state == 8480 [L1308] s->shutdown = 0 [L1309] ret = __VERIFIER_nondet_int() [L1310] COND FALSE !(ret <= 0) [L1315] EXPR s->s3 [L1315] (s->s3)->tmp.next_state = 8482 [L1316] s->state = 8448 [L1317] s->init_num = 0 [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 [L1138] COND TRUE 1 [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state [L1204] COND TRUE s->state == 8448 [L1477] COND FALSE !(num1 > 0L) [L1490] EXPR s->s3 [L1490] EXPR (s->s3)->tmp.next_state [L1490] s->state = (s->s3)->tmp.next_state [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 [L1138] COND TRUE 1 [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state [L1225] COND TRUE s->state == 8640 [L1537] ret = __VERIFIER_nondet_int() [L1538] COND FALSE !(blastFlag == 4) [L1541] COND FALSE !(blastFlag == 7) [L1544] COND FALSE !(blastFlag == 10) [L1737] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 151 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 239220.5ms, OverallIterations: 39, TraceHistogramMax: 9, EmptinessCheckTime: 43.2ms, AutomataDifference: 141220.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 6455 SDtfs, 6690 SDslu, 15285 SDs, 0 SdLazy, 13933 SolverSat, 2280 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 131182.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9143 GetRequests, 8925 SyntacticMatches, 17 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1431.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2912occurred in iteration=38, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 545.2ms AutomataMinimizationTime, 38 MinimizatonAttempts, 4418 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1123.3ms SsaConstructionTime, 3672.8ms SatisfiabilityAnalysisTime, 27218.6ms InterpolantComputationTime, 4577 NumberOfCodeBlocks, 4577 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 9078 ConstructedInterpolants, 148 QuantifiedInterpolants, 28615 SizeOfPredicates, 115 NumberOfNonLiveVariables, 11368 ConjunctsInSsa, 151 ConjunctsInUnsatCore, 76 InterpolantComputations, 74 PerfectInterpolantSequences, 8929/9256 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-25 20:42:02,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...