./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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.11.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 be72ada7daf51b9672b82550c90021fecf4891e35726a3813c73070b244ac267 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:39:25,475 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:39:25,478 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:39:25,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:39:25,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:39:25,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:39:25,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:39:25,530 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:39:25,532 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:39:25,537 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:39:25,538 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:39:25,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:39:25,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:39:25,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:39:25,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:39:25,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:39:25,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:39:25,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:39:25,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:39:25,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:39:25,557 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:39:25,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:39:25,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:39:25,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:39:25,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:39:25,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:39:25,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:39:25,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:39:25,570 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:39:25,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:39:25,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:39:25,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:39:25,587 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:39:25,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:39:25,588 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:39:25,590 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:39:25,590 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:39:25,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:39:25,591 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:39:25,591 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:39:25,592 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:39:25,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:39:25,595 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:39:25,636 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:39:25,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:39:25,637 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:39:25,637 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:39:25,638 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:39:25,638 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:39:25,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:39:25,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:39:25,639 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:39:25,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:39:25,640 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:39:25,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:39:25,641 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:39:25,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:39:25,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:39:25,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:39:25,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:39:25,642 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:39:25,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:39:25,642 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:39:25,642 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:39:25,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:39:25,643 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:39:25,648 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:39:25,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:39:25,648 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:39:25,648 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:39:25,649 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:39:25,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:39:25,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:39:25,649 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:39:25,649 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:39:25,650 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:39:25,650 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 -> be72ada7daf51b9672b82550c90021fecf4891e35726a3813c73070b244ac267 [2022-07-13 11:39:25,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:39:25,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:39:25,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:39:25,934 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:39:25,935 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:39:25,936 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2022-07-13 11:39:25,994 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d7b3055e/8e02bd9919f74b9788e17589a61bb2a2/FLAGf5eb8ba7f [2022-07-13 11:39:26,596 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:39:26,597 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2022-07-13 11:39:26,620 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d7b3055e/8e02bd9919f74b9788e17589a61bb2a2/FLAGf5eb8ba7f [2022-07-13 11:39:26,806 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d7b3055e/8e02bd9919f74b9788e17589a61bb2a2 [2022-07-13 11:39:26,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:39:26,810 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:39:26,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:39:26,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:39:26,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:39:26,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:39:26" (1/1) ... [2022-07-13 11:39:26,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65874168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:39:26, skipping insertion in model container [2022-07-13 11:39:26,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:39:26" (1/1) ... [2022-07-13 11:39:26,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:39:26,889 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:39:27,202 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c[74369,74382] [2022-07-13 11:39:27,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:39:27,227 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:39:27,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c[74369,74382] [2022-07-13 11:39:27,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:39:27,390 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:39:27,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:39:27 WrapperNode [2022-07-13 11:39:27,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:39:27,392 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:39:27,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:39:27,393 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:39:27,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:39:27" (1/1) ... [2022-07-13 11:39:27,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:39:27" (1/1) ... [2022-07-13 11:39:27,501 INFO L137 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 792 [2022-07-13 11:39:27,502 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:39:27,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:39:27,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:39:27,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:39:27,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:39:27" (1/1) ... [2022-07-13 11:39:27,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:39:27" (1/1) ... [2022-07-13 11:39:27,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:39:27" (1/1) ... [2022-07-13 11:39:27,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:39:27" (1/1) ... [2022-07-13 11:39:27,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:39:27" (1/1) ... [2022-07-13 11:39:27,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:39:27" (1/1) ... [2022-07-13 11:39:27,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:39:27" (1/1) ... [2022-07-13 11:39:27,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:39:27,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:39:27,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:39:27,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:39:27,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:39:27" (1/1) ... [2022-07-13 11:39:27,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:39:27,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:39:27,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 11:39:27,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 11:39:27,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:39:27,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 11:39:27,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 11:39:27,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 11:39:27,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 11:39:27,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:39:27,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:39:27,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:39:27,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:39:27,852 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:39:27,861 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:39:27,883 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:39:30,070 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-13 11:39:30,071 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-13 11:39:30,071 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:39:30,077 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:39:30,078 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 11:39:30,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:39:30 BoogieIcfgContainer [2022-07-13 11:39:30,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:39:30,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:39:30,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:39:30,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:39:30,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:39:26" (1/3) ... [2022-07-13 11:39:30,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ecfc43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:39:30, skipping insertion in model container [2022-07-13 11:39:30,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:39:27" (2/3) ... [2022-07-13 11:39:30,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ecfc43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:39:30, skipping insertion in model container [2022-07-13 11:39:30,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:39:30" (3/3) ... [2022-07-13 11:39:30,089 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2022-07-13 11:39:30,102 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:39:30,102 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:39:30,155 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:39:30,161 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6513c22d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@534cfa8a [2022-07-13 11:39:30,161 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:39:30,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 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) [2022-07-13 11:39:30,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 11:39:30,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:30,176 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:39:30,176 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:30,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:30,181 INFO L85 PathProgramCache]: Analyzing trace with hash -442385417, now seen corresponding path program 1 times [2022-07-13 11:39:30,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:30,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414757733] [2022-07-13 11:39:30,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:30,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:30,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:39:30,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:30,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414757733] [2022-07-13 11:39:30,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414757733] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:30,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:30,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:30,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003913067] [2022-07-13 11:39:30,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:30,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:30,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:30,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:30,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:30,772 INFO L87 Difference]: Start difference. First operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 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) Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:31,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:31,692 INFO L93 Difference]: Finished difference Result 421 states and 717 transitions. [2022-07-13 11:39:31,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:31,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-13 11:39:31,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:31,705 INFO L225 Difference]: With dead ends: 421 [2022-07-13 11:39:31,705 INFO L226 Difference]: Without dead ends: 256 [2022-07-13 11:39:31,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:31,712 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 169 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:31,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 439 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 11:39:31,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-07-13 11:39:31,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 165. [2022-07-13 11:39:31,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5853658536585367) internal successors, (260), 164 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) [2022-07-13 11:39:31,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 260 transitions. [2022-07-13 11:39:31,753 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 260 transitions. Word has length 37 [2022-07-13 11:39:31,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:31,754 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 260 transitions. [2022-07-13 11:39:31,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:31,754 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 260 transitions. [2022-07-13 11:39:31,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-13 11:39:31,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:31,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:39:31,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:39:31,756 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:31,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:31,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1559591931, now seen corresponding path program 1 times [2022-07-13 11:39:31,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:31,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496962734] [2022-07-13 11:39:31,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:31,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:31,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:39:31,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:31,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496962734] [2022-07-13 11:39:31,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496962734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:31,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:31,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:31,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78648359] [2022-07-13 11:39:31,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:31,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:31,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:31,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:31,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:31,894 INFO L87 Difference]: Start difference. First operand 165 states and 260 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:32,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:32,722 INFO L93 Difference]: Finished difference Result 439 states and 692 transitions. [2022-07-13 11:39:32,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:32,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-13 11:39:32,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:32,725 INFO L225 Difference]: With dead ends: 439 [2022-07-13 11:39:32,725 INFO L226 Difference]: Without dead ends: 284 [2022-07-13 11:39:32,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:32,727 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 134 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:32,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 330 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 11:39:32,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-13 11:39:32,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 194. [2022-07-13 11:39:32,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.616580310880829) internal successors, (312), 193 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:32,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 312 transitions. [2022-07-13 11:39:32,740 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 312 transitions. Word has length 38 [2022-07-13 11:39:32,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:32,741 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 312 transitions. [2022-07-13 11:39:32,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:32,741 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 312 transitions. [2022-07-13 11:39:32,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 11:39:32,743 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:32,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:39:32,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:39:32,744 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:32,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:32,744 INFO L85 PathProgramCache]: Analyzing trace with hash 917746377, now seen corresponding path program 1 times [2022-07-13 11:39:32,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:32,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885840356] [2022-07-13 11:39:32,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:32,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:39:32,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:32,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885840356] [2022-07-13 11:39:32,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885840356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:32,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:32,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:32,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587363312] [2022-07-13 11:39:32,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:32,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:32,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:32,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:32,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:32,893 INFO L87 Difference]: Start difference. First operand 194 states and 312 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:33,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:33,435 INFO L93 Difference]: Finished difference Result 406 states and 651 transitions. [2022-07-13 11:39:33,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:33,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-13 11:39:33,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:33,437 INFO L225 Difference]: With dead ends: 406 [2022-07-13 11:39:33,437 INFO L226 Difference]: Without dead ends: 222 [2022-07-13 11:39:33,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:33,439 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 22 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:33,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 469 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:39:33,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-07-13 11:39:33,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2022-07-13 11:39:33,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.6225490196078431) internal successors, (331), 204 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:33,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 331 transitions. [2022-07-13 11:39:33,449 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 331 transitions. Word has length 44 [2022-07-13 11:39:33,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:33,450 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 331 transitions. [2022-07-13 11:39:33,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:33,450 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 331 transitions. [2022-07-13 11:39:33,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 11:39:33,452 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:33,452 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:39:33,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 11:39:33,453 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:33,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:33,453 INFO L85 PathProgramCache]: Analyzing trace with hash 868700126, now seen corresponding path program 1 times [2022-07-13 11:39:33,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:33,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450051306] [2022-07-13 11:39:33,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:33,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:33,570 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:39:33,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:33,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450051306] [2022-07-13 11:39:33,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450051306] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:33,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:33,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:33,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739275716] [2022-07-13 11:39:33,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:33,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:33,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:33,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:33,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:33,573 INFO L87 Difference]: Start difference. First operand 205 states and 331 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) [2022-07-13 11:39:34,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:34,050 INFO L93 Difference]: Finished difference Result 406 states and 650 transitions. [2022-07-13 11:39:34,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:34,051 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 [2022-07-13 11:39:34,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:34,052 INFO L225 Difference]: With dead ends: 406 [2022-07-13 11:39:34,052 INFO L226 Difference]: Without dead ends: 222 [2022-07-13 11:39:34,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:34,053 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 24 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:34,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 471 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:39:34,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-07-13 11:39:34,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2022-07-13 11:39:34,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.6176470588235294) internal successors, (330), 204 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 330 transitions. [2022-07-13 11:39:34,069 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 330 transitions. Word has length 57 [2022-07-13 11:39:34,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:34,070 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 330 transitions. [2022-07-13 11:39:34,071 INFO L496 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) [2022-07-13 11:39:34,071 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 330 transitions. [2022-07-13 11:39:34,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 11:39:34,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:34,073 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:39:34,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 11:39:34,073 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:34,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:34,074 INFO L85 PathProgramCache]: Analyzing trace with hash 642771885, now seen corresponding path program 1 times [2022-07-13 11:39:34,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:34,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143286918] [2022-07-13 11:39:34,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:34,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:34,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:39:34,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:34,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143286918] [2022-07-13 11:39:34,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143286918] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:34,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:34,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:34,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365413501] [2022-07-13 11:39:34,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:34,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:34,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:34,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:34,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:34,195 INFO L87 Difference]: Start difference. First operand 205 states and 330 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:34,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:34,736 INFO L93 Difference]: Finished difference Result 405 states and 648 transitions. [2022-07-13 11:39:34,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:34,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-13 11:39:34,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:34,738 INFO L225 Difference]: With dead ends: 405 [2022-07-13 11:39:34,738 INFO L226 Difference]: Without dead ends: 221 [2022-07-13 11:39:34,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:34,739 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 28 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:34,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 473 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:39:34,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-13 11:39:34,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 205. [2022-07-13 11:39:34,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.6127450980392157) internal successors, (329), 204 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:34,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 329 transitions. [2022-07-13 11:39:34,747 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 329 transitions. Word has length 58 [2022-07-13 11:39:34,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:34,748 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 329 transitions. [2022-07-13 11:39:34,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:34,748 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 329 transitions. [2022-07-13 11:39:34,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 11:39:34,749 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:34,750 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:39:34,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 11:39:34,750 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:34,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:34,751 INFO L85 PathProgramCache]: Analyzing trace with hash -404738919, now seen corresponding path program 1 times [2022-07-13 11:39:34,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:34,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616032061] [2022-07-13 11:39:34,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:34,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:34,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:39:34,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:34,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616032061] [2022-07-13 11:39:34,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616032061] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:34,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:34,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:34,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090510586] [2022-07-13 11:39:34,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:34,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:34,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:34,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:34,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:34,904 INFO L87 Difference]: Start difference. First operand 205 states and 329 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:35,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:35,932 INFO L93 Difference]: Finished difference Result 479 states and 760 transitions. [2022-07-13 11:39:35,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:35,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-13 11:39:35,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:35,938 INFO L225 Difference]: With dead ends: 479 [2022-07-13 11:39:35,940 INFO L226 Difference]: Without dead ends: 295 [2022-07-13 11:39:35,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:35,942 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 150 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:35,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 330 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-13 11:39:35,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-07-13 11:39:35,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 205. [2022-07-13 11:39:35,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5980392156862746) internal successors, (326), 204 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:35,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 326 transitions. [2022-07-13 11:39:35,955 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 326 transitions. Word has length 58 [2022-07-13 11:39:35,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:35,955 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 326 transitions. [2022-07-13 11:39:35,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:35,955 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 326 transitions. [2022-07-13 11:39:35,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 11:39:35,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:35,957 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:39:35,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 11:39:35,957 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:35,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:35,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1540605214, now seen corresponding path program 1 times [2022-07-13 11:39:35,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:35,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618515572] [2022-07-13 11:39:35,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:35,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:36,068 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:39:36,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:36,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618515572] [2022-07-13 11:39:36,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618515572] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:36,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:36,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:36,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139988128] [2022-07-13 11:39:36,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:36,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:36,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:36,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:36,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:36,071 INFO L87 Difference]: Start difference. First operand 205 states and 326 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:36,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:36,701 INFO L93 Difference]: Finished difference Result 478 states and 754 transitions. [2022-07-13 11:39:36,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:36,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-13 11:39:36,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:36,703 INFO L225 Difference]: With dead ends: 478 [2022-07-13 11:39:36,703 INFO L226 Difference]: Without dead ends: 294 [2022-07-13 11:39:36,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:36,704 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 143 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:36,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 11:39:36,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-13 11:39:36,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 205. [2022-07-13 11:39:36,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5833333333333333) internal successors, (323), 204 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:36,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 323 transitions. [2022-07-13 11:39:36,718 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 323 transitions. Word has length 58 [2022-07-13 11:39:36,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:36,719 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 323 transitions. [2022-07-13 11:39:36,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:36,719 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 323 transitions. [2022-07-13 11:39:36,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 11:39:36,721 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:36,721 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:39:36,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 11:39:36,722 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:36,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:36,723 INFO L85 PathProgramCache]: Analyzing trace with hash -219751902, now seen corresponding path program 1 times [2022-07-13 11:39:36,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:36,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087287142] [2022-07-13 11:39:36,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:36,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:39:36,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:36,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087287142] [2022-07-13 11:39:36,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087287142] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:36,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:36,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:36,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838836157] [2022-07-13 11:39:36,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:36,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:36,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:36,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:36,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:36,871 INFO L87 Difference]: Start difference. First operand 205 states and 323 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:37,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:37,755 INFO L93 Difference]: Finished difference Result 478 states and 749 transitions. [2022-07-13 11:39:37,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:37,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-13 11:39:37,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:37,756 INFO L225 Difference]: With dead ends: 478 [2022-07-13 11:39:37,757 INFO L226 Difference]: Without dead ends: 294 [2022-07-13 11:39:37,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:37,758 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 143 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:37,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 11:39:37,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-13 11:39:37,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 205. [2022-07-13 11:39:37,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5686274509803921) internal successors, (320), 204 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:37,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 320 transitions. [2022-07-13 11:39:37,765 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 320 transitions. Word has length 58 [2022-07-13 11:39:37,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:37,766 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 320 transitions. [2022-07-13 11:39:37,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:37,766 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 320 transitions. [2022-07-13 11:39:37,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 11:39:37,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:37,767 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:39:37,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 11:39:37,768 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:37,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:37,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1716593643, now seen corresponding path program 1 times [2022-07-13 11:39:37,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:37,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856319569] [2022-07-13 11:39:37,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:37,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:37,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:39:37,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:37,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856319569] [2022-07-13 11:39:37,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856319569] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:37,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:37,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:37,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492683496] [2022-07-13 11:39:37,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:37,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:37,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:37,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:37,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:37,882 INFO L87 Difference]: Start difference. First operand 205 states and 320 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:38,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:38,694 INFO L93 Difference]: Finished difference Result 478 states and 744 transitions. [2022-07-13 11:39:38,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:38,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-07-13 11:39:38,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:38,696 INFO L225 Difference]: With dead ends: 478 [2022-07-13 11:39:38,696 INFO L226 Difference]: Without dead ends: 294 [2022-07-13 11:39:38,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:38,697 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 146 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:38,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 11:39:38,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-13 11:39:38,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 205. [2022-07-13 11:39:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.553921568627451) internal successors, (317), 204 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:38,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 317 transitions. [2022-07-13 11:39:38,703 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 317 transitions. Word has length 59 [2022-07-13 11:39:38,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:38,704 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 317 transitions. [2022-07-13 11:39:38,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:38,704 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 317 transitions. [2022-07-13 11:39:38,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-13 11:39:38,705 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:38,705 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:39:38,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 11:39:38,706 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:38,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:38,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1056186316, now seen corresponding path program 1 times [2022-07-13 11:39:38,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:38,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370541684] [2022-07-13 11:39:38,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:38,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:39:38,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:38,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370541684] [2022-07-13 11:39:38,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370541684] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:38,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:38,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:38,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108872359] [2022-07-13 11:39:38,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:38,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:38,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:38,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:38,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:38,803 INFO L87 Difference]: Start difference. First operand 205 states and 317 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:39,641 INFO L93 Difference]: Finished difference Result 402 states and 624 transitions. [2022-07-13 11:39:39,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:39,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-07-13 11:39:39,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:39,644 INFO L225 Difference]: With dead ends: 402 [2022-07-13 11:39:39,644 INFO L226 Difference]: Without dead ends: 218 [2022-07-13 11:39:39,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:39,645 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 20 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:39,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 479 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 11:39:39,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-13 11:39:39,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 205. [2022-07-13 11:39:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5490196078431373) internal successors, (316), 204 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 316 transitions. [2022-07-13 11:39:39,650 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 316 transitions. Word has length 60 [2022-07-13 11:39:39,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:39,650 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 316 transitions. [2022-07-13 11:39:39,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:39,651 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 316 transitions. [2022-07-13 11:39:39,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-13 11:39:39,652 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:39,652 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:39:39,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 11:39:39,652 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:39,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:39,653 INFO L85 PathProgramCache]: Analyzing trace with hash 614802448, now seen corresponding path program 1 times [2022-07-13 11:39:39,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:39,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708695979] [2022-07-13 11:39:39,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:39,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:39:39,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:39,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708695979] [2022-07-13 11:39:39,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708695979] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:39,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:39,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:39,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589921065] [2022-07-13 11:39:39,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:39,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:39,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:39,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:39,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:39,743 INFO L87 Difference]: Start difference. First operand 205 states and 316 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:40,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:40,566 INFO L93 Difference]: Finished difference Result 478 states and 738 transitions. [2022-07-13 11:39:40,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:40,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-07-13 11:39:40,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:40,568 INFO L225 Difference]: With dead ends: 478 [2022-07-13 11:39:40,568 INFO L226 Difference]: Without dead ends: 294 [2022-07-13 11:39:40,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:40,569 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 143 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:40,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 11:39:40,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-13 11:39:40,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 205. [2022-07-13 11:39:40,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5343137254901962) internal successors, (313), 204 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 313 transitions. [2022-07-13 11:39:40,575 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 313 transitions. Word has length 61 [2022-07-13 11:39:40,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:40,576 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 313 transitions. [2022-07-13 11:39:40,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:40,576 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 313 transitions. [2022-07-13 11:39:40,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-13 11:39:40,577 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:40,577 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:39:40,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 11:39:40,578 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:40,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:40,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1287801256, now seen corresponding path program 1 times [2022-07-13 11:39:40,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:40,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513119208] [2022-07-13 11:39:40,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:40,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:40,678 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:39:40,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:40,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513119208] [2022-07-13 11:39:40,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513119208] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:40,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:40,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:40,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718479371] [2022-07-13 11:39:40,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:40,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:40,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:40,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:40,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:40,680 INFO L87 Difference]: Start difference. First operand 205 states and 313 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:41,784 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:39:42,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:42,123 INFO L93 Difference]: Finished difference Result 508 states and 780 transitions. [2022-07-13 11:39:42,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:42,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-07-13 11:39:42,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:42,126 INFO L225 Difference]: With dead ends: 508 [2022-07-13 11:39:42,126 INFO L226 Difference]: Without dead ends: 324 [2022-07-13 11:39:42,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:42,127 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 119 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:42,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-13 11:39:42,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-07-13 11:39:42,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 245. [2022-07-13 11:39:42,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.5532786885245902) internal successors, (379), 244 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 379 transitions. [2022-07-13 11:39:42,135 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 379 transitions. Word has length 61 [2022-07-13 11:39:42,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:42,135 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 379 transitions. [2022-07-13 11:39:42,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:42,136 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 379 transitions. [2022-07-13 11:39:42,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 11:39:42,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:42,137 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:39:42,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 11:39:42,137 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:42,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:42,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1049026987, now seen corresponding path program 1 times [2022-07-13 11:39:42,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:42,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551626195] [2022-07-13 11:39:42,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:42,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:42,266 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:39:42,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:42,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551626195] [2022-07-13 11:39:42,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551626195] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:42,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:42,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:42,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941354576] [2022-07-13 11:39:42,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:42,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:42,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:42,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:42,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:42,268 INFO L87 Difference]: Start difference. First operand 245 states and 379 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:43,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:43,095 INFO L93 Difference]: Finished difference Result 511 states and 793 transitions. [2022-07-13 11:39:43,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:43,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-07-13 11:39:43,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:43,097 INFO L225 Difference]: With dead ends: 511 [2022-07-13 11:39:43,097 INFO L226 Difference]: Without dead ends: 287 [2022-07-13 11:39:43,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:43,098 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 29 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:43,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 493 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 11:39:43,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-07-13 11:39:43,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 267. [2022-07-13 11:39:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.5488721804511278) internal successors, (412), 266 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:43,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 412 transitions. [2022-07-13 11:39:43,105 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 412 transitions. Word has length 62 [2022-07-13 11:39:43,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:43,105 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 412 transitions. [2022-07-13 11:39:43,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:43,106 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 412 transitions. [2022-07-13 11:39:43,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-13 11:39:43,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:43,106 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:39:43,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 11:39:43,107 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:43,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:43,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1947485908, now seen corresponding path program 1 times [2022-07-13 11:39:43,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:43,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943023151] [2022-07-13 11:39:43,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:43,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:39:43,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:43,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943023151] [2022-07-13 11:39:43,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943023151] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:43,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:43,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:43,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645293261] [2022-07-13 11:39:43,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:43,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:43,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:43,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:43,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:43,214 INFO L87 Difference]: Start difference. First operand 267 states and 412 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:44,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:44,215 INFO L93 Difference]: Finished difference Result 531 states and 823 transitions. [2022-07-13 11:39:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:44,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-07-13 11:39:44,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:44,217 INFO L225 Difference]: With dead ends: 531 [2022-07-13 11:39:44,217 INFO L226 Difference]: Without dead ends: 285 [2022-07-13 11:39:44,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:44,218 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 34 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:44,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 497 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-13 11:39:44,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-07-13 11:39:44,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 267. [2022-07-13 11:39:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.5451127819548873) internal successors, (411), 266 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 411 transitions. [2022-07-13 11:39:44,225 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 411 transitions. Word has length 75 [2022-07-13 11:39:44,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:44,225 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 411 transitions. [2022-07-13 11:39:44,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:44,225 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 411 transitions. [2022-07-13 11:39:44,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-13 11:39:44,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:44,226 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-07-13 11:39:44,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 11:39:44,226 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:44,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:44,227 INFO L85 PathProgramCache]: Analyzing trace with hash -655331449, now seen corresponding path program 1 times [2022-07-13 11:39:44,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:44,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273031194] [2022-07-13 11:39:44,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:44,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:39:44,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:44,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273031194] [2022-07-13 11:39:44,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273031194] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:44,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:44,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:44,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153665566] [2022-07-13 11:39:44,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:44,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:44,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:44,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:44,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:44,343 INFO L87 Difference]: Start difference. First operand 267 states and 411 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:44,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:44,857 INFO L93 Difference]: Finished difference Result 530 states and 820 transitions. [2022-07-13 11:39:44,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:44,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-07-13 11:39:44,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:44,860 INFO L225 Difference]: With dead ends: 530 [2022-07-13 11:39:44,860 INFO L226 Difference]: Without dead ends: 284 [2022-07-13 11:39:44,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:44,861 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 38 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:44,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 499 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:39:44,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-13 11:39:44,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 267. [2022-07-13 11:39:44,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.5413533834586466) internal successors, (410), 266 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:44,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 410 transitions. [2022-07-13 11:39:44,869 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 410 transitions. Word has length 76 [2022-07-13 11:39:44,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:44,870 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 410 transitions. [2022-07-13 11:39:44,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:44,870 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 410 transitions. [2022-07-13 11:39:44,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-13 11:39:44,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:44,871 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:39:44,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 11:39:44,871 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:44,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:44,872 INFO L85 PathProgramCache]: Analyzing trace with hash 280248224, now seen corresponding path program 1 times [2022-07-13 11:39:44,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:44,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380334081] [2022-07-13 11:39:44,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:44,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:44,965 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:39:44,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:44,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380334081] [2022-07-13 11:39:44,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380334081] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:44,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:44,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:44,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727155178] [2022-07-13 11:39:44,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:44,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:44,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:44,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:44,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:44,968 INFO L87 Difference]: Start difference. First operand 267 states and 410 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:45,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:45,874 INFO L93 Difference]: Finished difference Result 602 states and 927 transitions. [2022-07-13 11:39:45,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:45,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-07-13 11:39:45,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:45,876 INFO L225 Difference]: With dead ends: 602 [2022-07-13 11:39:45,877 INFO L226 Difference]: Without dead ends: 356 [2022-07-13 11:39:45,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:45,878 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 144 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:45,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 334 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 11:39:45,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-07-13 11:39:45,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 267. [2022-07-13 11:39:45,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.5263157894736843) internal successors, (406), 266 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:45,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 406 transitions. [2022-07-13 11:39:45,885 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 406 transitions. Word has length 78 [2022-07-13 11:39:45,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:45,885 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 406 transitions. [2022-07-13 11:39:45,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:45,886 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 406 transitions. [2022-07-13 11:39:45,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-13 11:39:45,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:45,887 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:39:45,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 11:39:45,887 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:45,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:45,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1344832479, now seen corresponding path program 1 times [2022-07-13 11:39:45,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:45,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42447950] [2022-07-13 11:39:45,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:45,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:45,984 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:39:45,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:45,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42447950] [2022-07-13 11:39:45,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42447950] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:45,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:45,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:45,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34110350] [2022-07-13 11:39:45,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:45,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:45,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:45,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:45,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:45,987 INFO L87 Difference]: Start difference. First operand 267 states and 406 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:46,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:46,847 INFO L93 Difference]: Finished difference Result 603 states and 918 transitions. [2022-07-13 11:39:46,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:46,848 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 84 [2022-07-13 11:39:46,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:46,850 INFO L225 Difference]: With dead ends: 603 [2022-07-13 11:39:46,850 INFO L226 Difference]: Without dead ends: 357 [2022-07-13 11:39:46,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:46,851 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 67 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:46,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 469 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 11:39:46,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-07-13 11:39:46,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 309. [2022-07-13 11:39:46,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.5357142857142858) internal successors, (473), 308 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 473 transitions. [2022-07-13 11:39:46,858 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 473 transitions. Word has length 84 [2022-07-13 11:39:46,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:46,858 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 473 transitions. [2022-07-13 11:39:46,858 INFO L496 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) [2022-07-13 11:39:46,858 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 473 transitions. [2022-07-13 11:39:46,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-13 11:39:46,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:46,859 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:39:46,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 11:39:46,859 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:46,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:46,860 INFO L85 PathProgramCache]: Analyzing trace with hash -921185757, now seen corresponding path program 1 times [2022-07-13 11:39:46,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:46,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896067824] [2022-07-13 11:39:46,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:46,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:39:46,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:46,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896067824] [2022-07-13 11:39:46,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896067824] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:46,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:46,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:46,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411964400] [2022-07-13 11:39:46,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:46,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:46,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:46,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:46,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:46,961 INFO L87 Difference]: Start difference. First operand 309 states and 473 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:47,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:47,718 INFO L93 Difference]: Finished difference Result 646 states and 991 transitions. [2022-07-13 11:39:47,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:47,720 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 84 [2022-07-13 11:39:47,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:47,721 INFO L225 Difference]: With dead ends: 646 [2022-07-13 11:39:47,721 INFO L226 Difference]: Without dead ends: 358 [2022-07-13 11:39:47,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:47,722 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 36 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:47,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 591 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 11:39:47,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-07-13 11:39:47,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 333. [2022-07-13 11:39:47,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 1.533132530120482) internal successors, (509), 332 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 509 transitions. [2022-07-13 11:39:47,731 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 509 transitions. Word has length 84 [2022-07-13 11:39:47,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:47,731 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 509 transitions. [2022-07-13 11:39:47,731 INFO L496 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) [2022-07-13 11:39:47,731 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 509 transitions. [2022-07-13 11:39:47,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-13 11:39:47,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:47,732 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-07-13 11:39:47,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 11:39:47,733 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:47,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:47,733 INFO L85 PathProgramCache]: Analyzing trace with hash 742972446, now seen corresponding path program 1 times [2022-07-13 11:39:47,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:47,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107245478] [2022-07-13 11:39:47,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:47,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:39:47,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:47,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107245478] [2022-07-13 11:39:47,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107245478] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:47,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:47,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:47,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966284442] [2022-07-13 11:39:47,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:47,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:47,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:47,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:47,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:47,851 INFO L87 Difference]: Start difference. First operand 333 states and 509 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) [2022-07-13 11:39:49,267 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:39:49,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:49,573 INFO L93 Difference]: Finished difference Result 771 states and 1187 transitions. [2022-07-13 11:39:49,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:49,574 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 [2022-07-13 11:39:49,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:49,576 INFO L225 Difference]: With dead ends: 771 [2022-07-13 11:39:49,576 INFO L226 Difference]: Without dead ends: 459 [2022-07-13 11:39:49,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:49,577 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 141 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:49,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 362 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-13 11:39:49,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-07-13 11:39:49,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 349. [2022-07-13 11:39:49,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.514367816091954) internal successors, (527), 348 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:49,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 527 transitions. [2022-07-13 11:39:49,601 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 527 transitions. Word has length 97 [2022-07-13 11:39:49,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:49,603 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 527 transitions. [2022-07-13 11:39:49,603 INFO L496 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) [2022-07-13 11:39:49,603 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 527 transitions. [2022-07-13 11:39:49,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-13 11:39:49,605 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:49,605 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-07-13 11:39:49,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 11:39:49,605 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:49,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:49,606 INFO L85 PathProgramCache]: Analyzing trace with hash 659456893, now seen corresponding path program 1 times [2022-07-13 11:39:49,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:49,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994587319] [2022-07-13 11:39:49,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:49,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:49,753 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:39:49,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:49,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994587319] [2022-07-13 11:39:49,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994587319] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:49,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:49,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:49,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267292946] [2022-07-13 11:39:49,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:49,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:49,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:49,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:49,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:49,755 INFO L87 Difference]: Start difference. First operand 349 states and 527 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) [2022-07-13 11:39:51,048 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:39:51,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:51,360 INFO L93 Difference]: Finished difference Result 755 states and 1147 transitions. [2022-07-13 11:39:51,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:51,361 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 [2022-07-13 11:39:51,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:51,362 INFO L225 Difference]: With dead ends: 755 [2022-07-13 11:39:51,362 INFO L226 Difference]: Without dead ends: 427 [2022-07-13 11:39:51,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:51,364 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 139 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:51,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 356 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-13 11:39:51,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-07-13 11:39:51,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 349. [2022-07-13 11:39:51,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4971264367816093) internal successors, (521), 348 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:51,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 521 transitions. [2022-07-13 11:39:51,372 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 521 transitions. Word has length 98 [2022-07-13 11:39:51,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:51,372 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 521 transitions. [2022-07-13 11:39:51,373 INFO L496 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) [2022-07-13 11:39:51,373 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 521 transitions. [2022-07-13 11:39:51,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-13 11:39:51,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:51,374 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:39:51,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 11:39:51,374 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:51,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:51,375 INFO L85 PathProgramCache]: Analyzing trace with hash 280390343, now seen corresponding path program 1 times [2022-07-13 11:39:51,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:51,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496574438] [2022-07-13 11:39:51,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:51,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:39:51,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:51,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496574438] [2022-07-13 11:39:51,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496574438] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:51,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:51,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:51,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951021277] [2022-07-13 11:39:51,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:51,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:51,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:51,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:51,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:51,483 INFO L87 Difference]: Start difference. First operand 349 states and 521 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) [2022-07-13 11:39:53,486 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:39:53,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:53,811 INFO L93 Difference]: Finished difference Result 712 states and 1064 transitions. [2022-07-13 11:39:53,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:53,812 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 [2022-07-13 11:39:53,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:53,813 INFO L225 Difference]: With dead ends: 712 [2022-07-13 11:39:53,814 INFO L226 Difference]: Without dead ends: 384 [2022-07-13 11:39:53,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:53,815 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 71 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:53,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 489 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 11:39:53,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-07-13 11:39:53,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 349. [2022-07-13 11:39:53,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4942528735632183) internal successors, (520), 348 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:53,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 520 transitions. [2022-07-13 11:39:53,824 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 520 transitions. Word has length 104 [2022-07-13 11:39:53,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:53,824 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 520 transitions. [2022-07-13 11:39:53,824 INFO L496 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) [2022-07-13 11:39:53,824 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 520 transitions. [2022-07-13 11:39:53,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-13 11:39:53,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:53,826 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:39:53,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 11:39:53,826 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:53,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:53,827 INFO L85 PathProgramCache]: Analyzing trace with hash 509759261, now seen corresponding path program 1 times [2022-07-13 11:39:53,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:53,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094939207] [2022-07-13 11:39:53,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:53,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:53,954 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:39:53,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:53,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094939207] [2022-07-13 11:39:53,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094939207] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:53,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:53,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:53,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306017007] [2022-07-13 11:39:53,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:53,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:53,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:53,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:53,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:53,957 INFO L87 Difference]: Start difference. First operand 349 states and 520 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) [2022-07-13 11:39:54,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:54,590 INFO L93 Difference]: Finished difference Result 710 states and 1059 transitions. [2022-07-13 11:39:54,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:54,591 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 105 [2022-07-13 11:39:54,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:54,592 INFO L225 Difference]: With dead ends: 710 [2022-07-13 11:39:54,592 INFO L226 Difference]: Without dead ends: 382 [2022-07-13 11:39:54,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:54,593 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 68 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:54,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 495 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 11:39:54,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-07-13 11:39:54,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 349. [2022-07-13 11:39:54,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4913793103448276) internal successors, (519), 348 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:54,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 519 transitions. [2022-07-13 11:39:54,602 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 519 transitions. Word has length 105 [2022-07-13 11:39:54,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:54,602 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 519 transitions. [2022-07-13 11:39:54,603 INFO L496 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) [2022-07-13 11:39:54,603 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 519 transitions. [2022-07-13 11:39:54,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-13 11:39:54,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:54,604 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:39:54,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 11:39:54,604 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:54,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:54,605 INFO L85 PathProgramCache]: Analyzing trace with hash -213108826, now seen corresponding path program 1 times [2022-07-13 11:39:54,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:54,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818659215] [2022-07-13 11:39:54,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:54,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:54,705 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:39:54,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:54,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818659215] [2022-07-13 11:39:54,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818659215] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:54,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:54,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:54,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519965806] [2022-07-13 11:39:54,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:54,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:54,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:54,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:54,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:54,708 INFO L87 Difference]: Start difference. First operand 349 states and 519 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) [2022-07-13 11:39:55,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:55,631 INFO L93 Difference]: Finished difference Result 707 states and 1053 transitions. [2022-07-13 11:39:55,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:55,632 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 105 [2022-07-13 11:39:55,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:55,634 INFO L225 Difference]: With dead ends: 707 [2022-07-13 11:39:55,634 INFO L226 Difference]: Without dead ends: 379 [2022-07-13 11:39:55,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:55,635 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 61 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:55,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 501 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 11:39:55,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-07-13 11:39:55,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 349. [2022-07-13 11:39:55,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4885057471264367) internal successors, (518), 348 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:55,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 518 transitions. [2022-07-13 11:39:55,643 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 518 transitions. Word has length 105 [2022-07-13 11:39:55,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:55,644 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 518 transitions. [2022-07-13 11:39:55,644 INFO L496 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) [2022-07-13 11:39:55,644 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 518 transitions. [2022-07-13 11:39:55,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-13 11:39:55,645 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:55,645 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-07-13 11:39:55,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 11:39:55,646 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:55,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:55,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1295545029, now seen corresponding path program 1 times [2022-07-13 11:39:55,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:55,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013540310] [2022-07-13 11:39:55,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:55,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:55,757 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:39:55,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:55,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013540310] [2022-07-13 11:39:55,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013540310] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:55,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:55,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:55,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629761519] [2022-07-13 11:39:55,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:55,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:55,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:55,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:55,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:55,759 INFO L87 Difference]: Start difference. First operand 349 states and 518 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) [2022-07-13 11:39:56,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:56,608 INFO L93 Difference]: Finished difference Result 755 states and 1129 transitions. [2022-07-13 11:39:56,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:56,609 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 106 [2022-07-13 11:39:56,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:56,610 INFO L225 Difference]: With dead ends: 755 [2022-07-13 11:39:56,611 INFO L226 Difference]: Without dead ends: 427 [2022-07-13 11:39:56,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:56,612 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 125 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:56,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 368 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 11:39:56,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-07-13 11:39:56,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 349. [2022-07-13 11:39:56,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4770114942528736) internal successors, (514), 348 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:56,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 514 transitions. [2022-07-13 11:39:56,623 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 514 transitions. Word has length 106 [2022-07-13 11:39:56,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:56,624 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 514 transitions. [2022-07-13 11:39:56,624 INFO L496 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) [2022-07-13 11:39:56,624 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 514 transitions. [2022-07-13 11:39:56,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-13 11:39:56,625 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:56,625 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-07-13 11:39:56,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 11:39:56,625 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:56,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:56,626 INFO L85 PathProgramCache]: Analyzing trace with hash 878148423, now seen corresponding path program 1 times [2022-07-13 11:39:56,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:56,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684080393] [2022-07-13 11:39:56,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:56,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:56,726 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-13 11:39:56,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:56,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684080393] [2022-07-13 11:39:56,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684080393] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:56,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:56,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:39:56,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123813886] [2022-07-13 11:39:56,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:56,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:39:56,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:56,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:39:56,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:56,729 INFO L87 Difference]: Start difference. First operand 349 states and 514 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:56,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:56,764 INFO L93 Difference]: Finished difference Result 1000 states and 1488 transitions. [2022-07-13 11:39:56,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:39:56,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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 106 [2022-07-13 11:39:56,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:56,767 INFO L225 Difference]: With dead ends: 1000 [2022-07-13 11:39:56,768 INFO L226 Difference]: Without dead ends: 672 [2022-07-13 11:39:56,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:56,773 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 136 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:56,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 428 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:39:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2022-07-13 11:39:56,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2022-07-13 11:39:56,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 671 states have (on average 1.473919523099851) internal successors, (989), 671 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:56,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 989 transitions. [2022-07-13 11:39:56,796 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 989 transitions. Word has length 106 [2022-07-13 11:39:56,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:56,796 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 989 transitions. [2022-07-13 11:39:56,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:56,797 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 989 transitions. [2022-07-13 11:39:56,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-13 11:39:56,798 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:56,798 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-07-13 11:39:56,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 11:39:56,799 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:56,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:56,800 INFO L85 PathProgramCache]: Analyzing trace with hash -808031415, now seen corresponding path program 1 times [2022-07-13 11:39:56,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:56,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179398967] [2022-07-13 11:39:56,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:56,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:56,936 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 11:39:56,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:56,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179398967] [2022-07-13 11:39:56,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179398967] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:56,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:56,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:39:56,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126384018] [2022-07-13 11:39:56,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:56,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:39:56,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:56,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:39:56,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:56,939 INFO L87 Difference]: Start difference. First operand 672 states and 989 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 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) [2022-07-13 11:39:56,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:56,970 INFO L93 Difference]: Finished difference Result 1350 states and 1990 transitions. [2022-07-13 11:39:56,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:39:56,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 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 106 [2022-07-13 11:39:56,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:56,974 INFO L225 Difference]: With dead ends: 1350 [2022-07-13 11:39:56,974 INFO L226 Difference]: Without dead ends: 699 [2022-07-13 11:39:56,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:56,976 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 15 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:56,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 410 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:39:56,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-07-13 11:39:56,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2022-07-13 11:39:56,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.4670487106017192) internal successors, (1024), 698 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:56,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1024 transitions. [2022-07-13 11:39:56,993 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1024 transitions. Word has length 106 [2022-07-13 11:39:56,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:56,993 INFO L495 AbstractCegarLoop]: Abstraction has 699 states and 1024 transitions. [2022-07-13 11:39:56,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 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) [2022-07-13 11:39:56,994 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1024 transitions. [2022-07-13 11:39:56,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-13 11:39:56,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:56,995 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-07-13 11:39:56,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 11:39:56,996 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:56,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:56,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1068451403, now seen corresponding path program 1 times [2022-07-13 11:39:56,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:56,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293858629] [2022-07-13 11:39:56,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:56,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:57,087 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-13 11:39:57,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:57,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293858629] [2022-07-13 11:39:57,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293858629] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:57,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:57,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:39:57,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885135245] [2022-07-13 11:39:57,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:57,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:39:57,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:57,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:39:57,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:57,089 INFO L87 Difference]: Start difference. First operand 699 states and 1024 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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) [2022-07-13 11:39:57,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:57,114 INFO L93 Difference]: Finished difference Result 1379 states and 2026 transitions. [2022-07-13 11:39:57,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:39:57,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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 106 [2022-07-13 11:39:57,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:57,117 INFO L225 Difference]: With dead ends: 1379 [2022-07-13 11:39:57,118 INFO L226 Difference]: Without dead ends: 701 [2022-07-13 11:39:57,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:57,119 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 4 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:57,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 389 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:39:57,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2022-07-13 11:39:57,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2022-07-13 11:39:57,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 700 states have (on average 1.4657142857142857) internal successors, (1026), 700 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1026 transitions. [2022-07-13 11:39:57,135 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1026 transitions. Word has length 106 [2022-07-13 11:39:57,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:57,135 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 1026 transitions. [2022-07-13 11:39:57,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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) [2022-07-13 11:39:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1026 transitions. [2022-07-13 11:39:57,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-13 11:39:57,137 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:57,137 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1] [2022-07-13 11:39:57,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-13 11:39:57,138 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:57,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:57,138 INFO L85 PathProgramCache]: Analyzing trace with hash -414944271, now seen corresponding path program 1 times [2022-07-13 11:39:57,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:57,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617525117] [2022-07-13 11:39:57,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:57,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:57,240 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-13 11:39:57,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:57,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617525117] [2022-07-13 11:39:57,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617525117] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:57,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:57,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:39:57,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107432112] [2022-07-13 11:39:57,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:57,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:39:57,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:57,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:39:57,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:57,242 INFO L87 Difference]: Start difference. First operand 701 states and 1026 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) [2022-07-13 11:39:57,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:57,292 INFO L93 Difference]: Finished difference Result 1707 states and 2514 transitions. [2022-07-13 11:39:57,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:39:57,293 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 108 [2022-07-13 11:39:57,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:57,297 INFO L225 Difference]: With dead ends: 1707 [2022-07-13 11:39:57,297 INFO L226 Difference]: Without dead ends: 1029 [2022-07-13 11:39:57,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:57,299 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 148 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:57,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 569 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:39:57,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2022-07-13 11:39:57,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1027. [2022-07-13 11:39:57,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1026 states have (on average 1.4688109161793372) internal successors, (1507), 1026 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:57,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1507 transitions. [2022-07-13 11:39:57,354 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1507 transitions. Word has length 108 [2022-07-13 11:39:57,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:57,354 INFO L495 AbstractCegarLoop]: Abstraction has 1027 states and 1507 transitions. [2022-07-13 11:39:57,354 INFO L496 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) [2022-07-13 11:39:57,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1507 transitions. [2022-07-13 11:39:57,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-13 11:39:57,356 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:57,357 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:39:57,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-13 11:39:57,357 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:57,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:57,358 INFO L85 PathProgramCache]: Analyzing trace with hash 2063160218, now seen corresponding path program 1 times [2022-07-13 11:39:57,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:57,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525164351] [2022-07-13 11:39:57,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:57,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:57,464 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-13 11:39:57,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:57,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525164351] [2022-07-13 11:39:57,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525164351] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:57,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:57,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:39:57,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095502045] [2022-07-13 11:39:57,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:57,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:39:57,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:57,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:39:57,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:57,467 INFO L87 Difference]: Start difference. First operand 1027 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 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) [2022-07-13 11:39:57,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:57,519 INFO L93 Difference]: Finished difference Result 2353 states and 3470 transitions. [2022-07-13 11:39:57,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:39:57,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 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 125 [2022-07-13 11:39:57,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:57,524 INFO L225 Difference]: With dead ends: 2353 [2022-07-13 11:39:57,525 INFO L226 Difference]: Without dead ends: 1349 [2022-07-13 11:39:57,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:57,530 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 141 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:57,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 567 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:39:57,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2022-07-13 11:39:57,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1349. [2022-07-13 11:39:57,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1348 states have (on average 1.4688427299703264) internal successors, (1980), 1348 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:57,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1980 transitions. [2022-07-13 11:39:57,558 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1980 transitions. Word has length 125 [2022-07-13 11:39:57,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:57,559 INFO L495 AbstractCegarLoop]: Abstraction has 1349 states and 1980 transitions. [2022-07-13 11:39:57,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 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) [2022-07-13 11:39:57,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1980 transitions. [2022-07-13 11:39:57,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-13 11:39:57,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:57,562 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:39:57,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-13 11:39:57,562 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:57,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:57,563 INFO L85 PathProgramCache]: Analyzing trace with hash 726227607, now seen corresponding path program 1 times [2022-07-13 11:39:57,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:57,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241270330] [2022-07-13 11:39:57,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:57,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:57,687 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-13 11:39:57,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:57,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241270330] [2022-07-13 11:39:57,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241270330] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:57,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:57,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:39:57,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445208924] [2022-07-13 11:39:57,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:57,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:39:57,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:57,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:39:57,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:57,689 INFO L87 Difference]: Start difference. First operand 1349 states and 1980 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) [2022-07-13 11:39:57,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:57,753 INFO L93 Difference]: Finished difference Result 2005 states and 2944 transitions. [2022-07-13 11:39:57,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:39:57,753 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 128 [2022-07-13 11:39:57,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:57,759 INFO L225 Difference]: With dead ends: 2005 [2022-07-13 11:39:57,760 INFO L226 Difference]: Without dead ends: 1677 [2022-07-13 11:39:57,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:57,761 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 157 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:57,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 373 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:39:57,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2022-07-13 11:39:57,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1675. [2022-07-13 11:39:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1674 states have (on average 1.467741935483871) internal successors, (2457), 1674 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:57,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2457 transitions. [2022-07-13 11:39:57,800 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2457 transitions. Word has length 128 [2022-07-13 11:39:57,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:57,800 INFO L495 AbstractCegarLoop]: Abstraction has 1675 states and 2457 transitions. [2022-07-13 11:39:57,800 INFO L496 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) [2022-07-13 11:39:57,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2457 transitions. [2022-07-13 11:39:57,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-13 11:39:57,804 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:57,804 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:39:57,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-13 11:39:57,805 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:57,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:57,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1329906676, now seen corresponding path program 1 times [2022-07-13 11:39:57,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:57,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78494463] [2022-07-13 11:39:57,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:57,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:58,250 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-07-13 11:39:58,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:58,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78494463] [2022-07-13 11:39:58,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78494463] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:58,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:58,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:39:58,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932529446] [2022-07-13 11:39:58,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:58,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:39:58,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:58,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:39:58,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:58,252 INFO L87 Difference]: Start difference. First operand 1675 states and 2457 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:59,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:59,756 INFO L93 Difference]: Finished difference Result 3347 states and 4910 transitions. [2022-07-13 11:39:59,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:39:59,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2022-07-13 11:39:59,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:59,764 INFO L225 Difference]: With dead ends: 3347 [2022-07-13 11:39:59,764 INFO L226 Difference]: Without dead ends: 1675 [2022-07-13 11:39:59,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:39:59,767 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 7 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:59,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 671 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-13 11:39:59,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2022-07-13 11:39:59,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1675. [2022-07-13 11:39:59,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1674 states have (on average 1.4671445639187575) internal successors, (2456), 1674 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:59,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2456 transitions. [2022-07-13 11:39:59,809 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2456 transitions. Word has length 129 [2022-07-13 11:39:59,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:59,809 INFO L495 AbstractCegarLoop]: Abstraction has 1675 states and 2456 transitions. [2022-07-13 11:39:59,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:59,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2456 transitions. [2022-07-13 11:39:59,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-13 11:39:59,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:59,812 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:39:59,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-13 11:39:59,813 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:59,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:59,813 INFO L85 PathProgramCache]: Analyzing trace with hash 895401078, now seen corresponding path program 1 times [2022-07-13 11:39:59,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:59,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10990801] [2022-07-13 11:39:59,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:59,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:40:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:40:00,590 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 11:40:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:40:00,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 11:40:00,949 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 11:40:00,949 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 11:40:00,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-13 11:40:00,960 INFO L356 BasicCegarLoop]: Path program 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] [2022-07-13 11:40:00,964 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 11:40:01,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:40:01 BoogieIcfgContainer [2022-07-13 11:40:01,089 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 11:40:01,090 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 11:40:01,090 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 11:40:01,090 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 11:40:01,091 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:39:30" (3/4) ... [2022-07-13 11:40:01,093 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 11:40:01,093 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 11:40:01,094 INFO L158 Benchmark]: Toolchain (without parser) took 34284.53ms. Allocated memory was 117.4MB in the beginning and 281.0MB in the end (delta: 163.6MB). Free memory was 93.2MB in the beginning and 125.7MB in the end (delta: -32.5MB). Peak memory consumption was 131.6MB. Max. memory is 16.1GB. [2022-07-13 11:40:01,095 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 79.7MB. Free memory was 52.6MB in the beginning and 52.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:40:01,095 INFO L158 Benchmark]: CACSL2BoogieTranslator took 579.55ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 61.6MB in the end (delta: 31.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-07-13 11:40:01,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.83ms. Allocated memory is still 117.4MB. Free memory was 61.6MB in the beginning and 89.7MB in the end (delta: -28.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 11:40:01,097 INFO L158 Benchmark]: Boogie Preprocessor took 107.24ms. Allocated memory is still 117.4MB. Free memory was 89.7MB in the beginning and 82.8MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 11:40:01,101 INFO L158 Benchmark]: RCFGBuilder took 2469.42ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 82.8MB in the beginning and 120.3MB in the end (delta: -37.6MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. [2022-07-13 11:40:01,102 INFO L158 Benchmark]: TraceAbstraction took 31007.62ms. Allocated memory was 159.4MB in the beginning and 281.0MB in the end (delta: 121.6MB). Free memory was 120.3MB in the beginning and 125.7MB in the end (delta: -5.4MB). Peak memory consumption was 163.3MB. Max. memory is 16.1GB. [2022-07-13 11:40:01,102 INFO L158 Benchmark]: Witness Printer took 3.65ms. Allocated memory is still 281.0MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:40:01,105 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.22ms. Allocated memory is still 79.7MB. Free memory was 52.6MB in the beginning and 52.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 579.55ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 61.6MB in the end (delta: 31.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 109.83ms. Allocated memory is still 117.4MB. Free memory was 61.6MB in the beginning and 89.7MB in the end (delta: -28.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.24ms. Allocated memory is still 117.4MB. Free memory was 89.7MB in the beginning and 82.8MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2469.42ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 82.8MB in the beginning and 120.3MB in the end (delta: -37.6MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. * TraceAbstraction took 31007.62ms. Allocated memory was 159.4MB in the beginning and 281.0MB in the end (delta: 121.6MB). Free memory was 120.3MB in the beginning and 125.7MB in the end (delta: -5.4MB). Peak memory consumption was 163.3MB. Max. memory is 16.1GB. * Witness Printer took 3.65ms. Allocated memory is still 281.0MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1757]: 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 1475. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={4:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1087] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1088] s->options = __VERIFIER_nondet_ulong() [L1089] s->verify_mode = __VERIFIER_nondet_int() [L1090] EXPR s->session [L1090] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1091] EXPR s->s3 [L1091] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1093] EXPR s->s3 [L1093] EXPR (s->s3)->tmp.new_cipher [L1093] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1095] COND FALSE !(__VERIFIER_nondet_int()) [L1101] s->cert = malloc(sizeof(struct cert_st)) [L1102] EXPR s->cert [L1102] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1105] CALL ssl3_accept(s) [L1111] BUF_MEM *buf ; [L1112] unsigned long l ; [L1113] unsigned long Time ; [L1114] unsigned long tmp ; [L1115] void (*cb)() ; [L1116] long num1 ; [L1117] int ret ; [L1118] int new_state ; [L1119] int state ; [L1120] int skip ; [L1121] int got_new_session ; [L1122] int tmp___1 = __VERIFIER_nondet_int() ; [L1123] int tmp___2 = __VERIFIER_nondet_int() ; [L1124] int tmp___3 = __VERIFIER_nondet_int() ; [L1125] int tmp___4 = __VERIFIER_nondet_int() ; [L1126] int tmp___5 = __VERIFIER_nondet_int() ; [L1127] int tmp___6 = __VERIFIER_nondet_int() ; [L1128] int tmp___7 ; [L1129] long tmp___8 = __VERIFIER_nondet_long() ; [L1130] int tmp___9 = __VERIFIER_nondet_int() ; [L1131] int tmp___10 = __VERIFIER_nondet_int() ; [L1132] int blastFlag ; [L1136] s->state = 8464 [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->info_callback={0:5}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1161] EXPR s->cert VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->cert={-4294967295:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 VAL [={0:5}, blastFlag=1, got_new_session=0, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967321, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1167] COND TRUE 1 VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1378] COND FALSE !(ret <= 0) [L1383] s->hit VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->hit=0, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1383] COND FALSE !(s->hit) [L1386] s->state = 8512 VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1388] s->init_num = 0 VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967321, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1167] COND TRUE 1 VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1209] COND TRUE s->state == 8512 [L1392] EXPR s->s3 [L1392] EXPR (s->s3)->tmp.new_cipher [L1392] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:5}, ((s->s3)->tmp.new_cipher)->algorithms=4294967310, (s->s3)->tmp.new_cipher={-4294967292:0}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1392] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1395] ret = __VERIFIER_nondet_int() [L1396] COND TRUE blastFlag == 2 [L1397] blastFlag = 6 VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1401] COND FALSE !(ret <= 0) VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1407] s->state = 8528 [L1408] s->init_num = 0 VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967321, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1167] COND TRUE 1 VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1215] COND TRUE s->state == 8528 [L1412] EXPR s->s3 [L1412] EXPR (s->s3)->tmp.new_cipher [L1412] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1412] l = ((s->s3)->tmp.new_cipher)->algorithms [L1413] EXPR s->options VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->options=4294967315, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1413] COND TRUE s->options & 2097152UL [L1414] EXPR s->s3 [L1414] (s->s3)->tmp.use_rsa_tmp = 1 [L1418] EXPR s->s3 [L1418] (s->s3)->tmp.use_rsa_tmp VAL [={0:5}, (s->s3)->tmp.use_rsa_tmp=1, blastFlag=6, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1418] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1436] ret = __VERIFIER_nondet_int() [L1437] COND TRUE blastFlag == 6 [L1438] blastFlag = 7 VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1442] COND FALSE !(ret <= 0) VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1459] s->state = 8544 [L1460] s->init_num = 0 VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967321, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1167] COND TRUE 1 VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1221] COND TRUE s->state == 8544 [L1464] EXPR s->verify_mode VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->verify_mode=7, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1464] COND TRUE s->verify_mode & 1 [L1465] EXPR s->session [L1465] EXPR (s->session)->peer VAL [={0:5}, (s->session)->peer={0:0}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->session={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1465] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1475] EXPR s->s3 [L1475] EXPR (s->s3)->tmp.new_cipher [L1475] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:5}, ((s->s3)->tmp.new_cipher)->algorithms=4294967310, (s->s3)->tmp.new_cipher={-4294967292:0}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1475] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1485] EXPR s->s3 [L1485] (s->s3)->tmp.cert_request = 1 [L1486] ret = __VERIFIER_nondet_int() [L1487] COND TRUE blastFlag == 7 VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=0, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1757] reach_error() VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=0, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.8s, OverallIterations: 32, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 24.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2802 SdHoareTripleChecker+Valid, 23.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2802 mSDsluCounter, 13512 SdHoareTripleChecker+Invalid, 22.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7878 mSDsCounter, 836 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5592 IncrementalHoareTripleChecker+Invalid, 6428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 836 mSolverCounterUnsat, 5634 mSDtfsCounter, 5592 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1675occurred in iteration=30, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 1354 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2660 NumberOfCodeBlocks, 2660 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2500 ConstructedInterpolants, 0 QuantifiedInterpolants, 6359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 1458/1458 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 [2022-07-13 11:40:01,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.11.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 be72ada7daf51b9672b82550c90021fecf4891e35726a3813c73070b244ac267 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:40:03,067 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:40:03,070 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:40:03,117 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:40:03,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:40:03,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:40:03,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:40:03,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:40:03,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:40:03,132 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:40:03,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:40:03,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:40:03,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:40:03,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:40:03,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:40:03,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:40:03,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:40:03,146 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:40:03,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:40:03,152 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:40:03,154 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:40:03,155 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:40:03,156 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:40:03,157 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:40:03,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:40:03,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:40:03,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:40:03,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:40:03,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:40:03,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:40:03,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:40:03,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:40:03,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:40:03,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:40:03,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:40:03,172 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:40:03,173 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:40:03,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:40:03,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:40:03,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:40:03,174 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:40:03,175 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:40:03,184 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 11:40:03,207 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:40:03,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:40:03,208 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:40:03,208 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:40:03,209 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:40:03,209 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:40:03,209 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:40:03,209 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:40:03,210 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:40:03,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:40:03,211 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:40:03,211 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:40:03,211 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:40:03,211 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:40:03,211 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:40:03,212 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:40:03,212 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 11:40:03,212 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 11:40:03,212 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 11:40:03,212 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:40:03,212 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:40:03,213 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:40:03,213 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:40:03,213 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:40:03,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:40:03,213 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:40:03,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:40:03,214 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:40:03,214 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:40:03,214 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:40:03,214 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 11:40:03,215 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 11:40:03,215 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:40:03,215 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:40:03,215 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:40:03,215 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 11:40:03,216 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 -> be72ada7daf51b9672b82550c90021fecf4891e35726a3813c73070b244ac267 [2022-07-13 11:40:03,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:40:03,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:40:03,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:40:03,579 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:40:03,580 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:40:03,581 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2022-07-13 11:40:03,653 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894bdced9/180531bcf288443d9920761c0da08f27/FLAGd4ac65e7d [2022-07-13 11:40:04,187 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:40:04,188 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2022-07-13 11:40:04,209 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894bdced9/180531bcf288443d9920761c0da08f27/FLAGd4ac65e7d [2022-07-13 11:40:04,497 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894bdced9/180531bcf288443d9920761c0da08f27 [2022-07-13 11:40:04,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:40:04,500 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:40:04,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:40:04,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:40:04,509 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:40:04,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:40:04" (1/1) ... [2022-07-13 11:40:04,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11b2ea03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:04, skipping insertion in model container [2022-07-13 11:40:04,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:40:04" (1/1) ... [2022-07-13 11:40:04,516 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:40:04,574 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:40:04,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c[74369,74382] [2022-07-13 11:40:04,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:40:04,997 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-13 11:40:05,008 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:40:05,125 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c[74369,74382] [2022-07-13 11:40:05,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:40:05,133 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:40:05,232 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c[74369,74382] [2022-07-13 11:40:05,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:40:05,252 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:40:05,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:05 WrapperNode [2022-07-13 11:40:05,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:40:05,254 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:40:05,254 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:40:05,255 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:40:05,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:05" (1/1) ... [2022-07-13 11:40:05,294 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:05" (1/1) ... [2022-07-13 11:40:05,344 INFO L137 Inliner]: procedures = 35, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 762 [2022-07-13 11:40:05,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:40:05,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:40:05,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:40:05,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:40:05,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:05" (1/1) ... [2022-07-13 11:40:05,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:05" (1/1) ... [2022-07-13 11:40:05,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:05" (1/1) ... [2022-07-13 11:40:05,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:05" (1/1) ... [2022-07-13 11:40:05,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:05" (1/1) ... [2022-07-13 11:40:05,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:05" (1/1) ... [2022-07-13 11:40:05,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:05" (1/1) ... [2022-07-13 11:40:05,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:40:05,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:40:05,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:40:05,407 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:40:05,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:05" (1/1) ... [2022-07-13 11:40:05,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:40:05,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:40:05,437 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 11:40:05,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 11:40:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:40:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 11:40:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 11:40:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 11:40:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 11:40:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:40:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:40:05,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:40:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 11:40:05,610 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:40:05,631 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:40:05,656 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:40:13,880 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-13 11:40:13,880 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-13 11:40:13,881 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:40:13,887 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:40:13,887 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 11:40:13,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:40:13 BoogieIcfgContainer [2022-07-13 11:40:13,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:40:13,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:40:13,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:40:13,893 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:40:13,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:40:04" (1/3) ... [2022-07-13 11:40:13,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c7c1d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:40:13, skipping insertion in model container [2022-07-13 11:40:13,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:05" (2/3) ... [2022-07-13 11:40:13,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c7c1d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:40:13, skipping insertion in model container [2022-07-13 11:40:13,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:40:13" (3/3) ... [2022-07-13 11:40:13,896 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2022-07-13 11:40:13,908 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:40:13,909 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:40:13,951 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:40:13,956 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@34724b1c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@697207f4 [2022-07-13 11:40:13,957 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:40:13,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 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) [2022-07-13 11:40:13,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 11:40:13,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:40:13,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:40:13,970 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:40:13,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:40:13,974 INFO L85 PathProgramCache]: Analyzing trace with hash -442385417, now seen corresponding path program 1 times [2022-07-13 11:40:13,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:40:13,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192293533] [2022-07-13 11:40:13,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:40:13,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:40:13,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:40:13,995 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:40:14,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 11:40:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:40:14,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:40:14,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:40:14,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:40:14,703 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:40:14,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:40:14,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192293533] [2022-07-13 11:40:14,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192293533] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:40:14,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:40:14,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:40:14,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57368385] [2022-07-13 11:40:14,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:40:14,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:40:14,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:40:14,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:40:14,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:40:14,743 INFO L87 Difference]: Start difference. First operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 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) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:14,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:40:14,883 INFO L93 Difference]: Finished difference Result 427 states and 728 transitions. [2022-07-13 11:40:14,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:40:14,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-13 11:40:14,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:40:14,904 INFO L225 Difference]: With dead ends: 427 [2022-07-13 11:40:14,904 INFO L226 Difference]: Without dead ends: 261 [2022-07-13 11:40:14,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:40:14,912 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 201 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:40:14,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 461 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:40:14,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-07-13 11:40:14,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2022-07-13 11:40:14,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.5153846153846153) internal successors, (394), 260 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:14,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 394 transitions. [2022-07-13 11:40:14,986 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 394 transitions. Word has length 37 [2022-07-13 11:40:14,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:40:14,987 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 394 transitions. [2022-07-13 11:40:14,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:14,988 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 394 transitions. [2022-07-13 11:40:14,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-13 11:40:14,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:40:14,994 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:40:15,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-13 11:40:15,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:40:15,214 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:40:15,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:40:15,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1297584632, now seen corresponding path program 1 times [2022-07-13 11:40:15,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:40:15,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314060657] [2022-07-13 11:40:15,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:40:15,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:40:15,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:40:15,218 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:40:15,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 11:40:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:40:15,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:40:15,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:40:15,970 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:40:15,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:40:15,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:40:15,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314060657] [2022-07-13 11:40:15,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314060657] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:40:15,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:40:15,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:40:15,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228355788] [2022-07-13 11:40:15,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:40:15,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:40:15,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:40:15,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:40:15,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:40:15,974 INFO L87 Difference]: Start difference. First operand 261 states and 394 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:16,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:40:16,511 INFO L93 Difference]: Finished difference Result 510 states and 781 transitions. [2022-07-13 11:40:16,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:40:16,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-07-13 11:40:16,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:40:16,514 INFO L225 Difference]: With dead ends: 510 [2022-07-13 11:40:16,514 INFO L226 Difference]: Without dead ends: 383 [2022-07-13 11:40:16,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:40:16,516 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 150 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:40:16,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 567 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:40:16,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-07-13 11:40:16,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2022-07-13 11:40:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5052356020942408) internal successors, (575), 382 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) [2022-07-13 11:40:16,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 575 transitions. [2022-07-13 11:40:16,529 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 575 transitions. Word has length 54 [2022-07-13 11:40:16,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:40:16,530 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 575 transitions. [2022-07-13 11:40:16,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:16,530 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 575 transitions. [2022-07-13 11:40:16,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-13 11:40:16,532 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:40:16,533 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:40:16,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-13 11:40:16,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:40:16,748 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:40:16,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:40:16,749 INFO L85 PathProgramCache]: Analyzing trace with hash 2072838766, now seen corresponding path program 1 times [2022-07-13 11:40:16,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:40:16,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093287244] [2022-07-13 11:40:16,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:40:16,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:40:16,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:40:16,752 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:40:16,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 11:40:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:40:17,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:40:17,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:40:17,475 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:40:17,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:40:17,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:40:17,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093287244] [2022-07-13 11:40:17,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093287244] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:40:17,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:40:17,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:40:17,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662703348] [2022-07-13 11:40:17,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:40:17,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:40:17,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:40:17,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:40:17,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:40:17,478 INFO L87 Difference]: Start difference. First operand 383 states and 575 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:17,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:40:17,949 INFO L93 Difference]: Finished difference Result 754 states and 1144 transitions. [2022-07-13 11:40:17,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:40:17,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-07-13 11:40:17,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:40:17,952 INFO L225 Difference]: With dead ends: 754 [2022-07-13 11:40:17,952 INFO L226 Difference]: Without dead ends: 505 [2022-07-13 11:40:17,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:40:17,954 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 148 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:40:17,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 569 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:40:17,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-07-13 11:40:17,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2022-07-13 11:40:17,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 1.501984126984127) internal successors, (757), 504 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:17,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 757 transitions. [2022-07-13 11:40:17,967 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 757 transitions. Word has length 76 [2022-07-13 11:40:17,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:40:17,968 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 757 transitions. [2022-07-13 11:40:17,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:17,968 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 757 transitions. [2022-07-13 11:40:17,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-13 11:40:17,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:40:17,971 INFO L195 NwaCegarLoop]: 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] [2022-07-13 11:40:17,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-13 11:40:18,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:40:18,188 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:40:18,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:40:18,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1458485308, now seen corresponding path program 1 times [2022-07-13 11:40:18,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:40:18,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807123633] [2022-07-13 11:40:18,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:40:18,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:40:18,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:40:18,191 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:40:18,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-13 11:40:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:40:18,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:40:18,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:40:18,926 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-13 11:40:18,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:40:18,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:40:18,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807123633] [2022-07-13 11:40:18,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807123633] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:40:18,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:40:18,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:40:18,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052812787] [2022-07-13 11:40:18,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:40:18,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:40:18,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:40:18,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:40:18,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:40:18,928 INFO L87 Difference]: Start difference. First operand 505 states and 757 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:19,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:40:19,589 INFO L93 Difference]: Finished difference Result 1000 states and 1510 transitions. [2022-07-13 11:40:19,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:40:19,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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 100 [2022-07-13 11:40:19,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:40:19,592 INFO L225 Difference]: With dead ends: 1000 [2022-07-13 11:40:19,593 INFO L226 Difference]: Without dead ends: 629 [2022-07-13 11:40:19,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:40:19,594 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 152 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:40:19,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 572 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 11:40:19,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2022-07-13 11:40:19,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2022-07-13 11:40:19,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 628 states have (on average 1.4984076433121019) internal successors, (941), 628 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:19,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 941 transitions. [2022-07-13 11:40:19,608 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 941 transitions. Word has length 100 [2022-07-13 11:40:19,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:40:19,609 INFO L495 AbstractCegarLoop]: Abstraction has 629 states and 941 transitions. [2022-07-13 11:40:19,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:19,609 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 941 transitions. [2022-07-13 11:40:19,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-13 11:40:19,611 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:40:19,611 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:40:19,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-13 11:40:19,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:40:19,828 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:40:19,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:40:19,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1045011737, now seen corresponding path program 1 times [2022-07-13 11:40:19,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:40:19,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727670587] [2022-07-13 11:40:19,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:40:19,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:40:19,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:40:19,831 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:40:19,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-13 11:40:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:40:20,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:40:20,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:40:20,575 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-13 11:40:20,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:40:20,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:40:20,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727670587] [2022-07-13 11:40:20,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1727670587] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:40:20,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:40:20,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:40:20,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889472858] [2022-07-13 11:40:20,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:40:20,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:40:20,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:40:20,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:40:20,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:40:20,577 INFO L87 Difference]: Start difference. First operand 629 states and 941 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:21,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:40:21,410 INFO L93 Difference]: Finished difference Result 1246 states and 1875 transitions. [2022-07-13 11:40:21,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:40:21,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2022-07-13 11:40:21,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:40:21,425 INFO L225 Difference]: With dead ends: 1246 [2022-07-13 11:40:21,425 INFO L226 Difference]: Without dead ends: 751 [2022-07-13 11:40:21,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:40:21,427 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 149 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:40:21,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 569 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 11:40:21,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2022-07-13 11:40:21,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 751. [2022-07-13 11:40:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 750 states have (on average 1.496) internal successors, (1122), 750 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:21,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1122 transitions. [2022-07-13 11:40:21,497 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1122 transitions. Word has length 117 [2022-07-13 11:40:21,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:40:21,497 INFO L495 AbstractCegarLoop]: Abstraction has 751 states and 1122 transitions. [2022-07-13 11:40:21,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:21,499 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1122 transitions. [2022-07-13 11:40:21,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-13 11:40:21,501 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:40:21,508 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:40:21,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-13 11:40:21,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:40:21,722 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:40:21,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:40:21,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1006485834, now seen corresponding path program 1 times [2022-07-13 11:40:21,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:40:21,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702788693] [2022-07-13 11:40:21,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:40:21,723 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:40:21,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:40:21,725 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:40:21,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-13 11:40:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:40:23,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-13 11:40:23,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:40:23,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:40:23,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:40:23,891 INFO L356 Elim1Store]: treesize reduction 1496, result has 4.7 percent of original size [2022-07-13 11:40:23,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 85 [2022-07-13 11:40:23,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:23,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:24,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:24,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:24,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 36 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 85 [2022-07-13 11:40:24,204 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-13 11:40:24,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-13 11:40:24,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:24,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:24,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:24,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:24,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:24,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:24,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:24,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:24,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:24,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:40:24,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2022-07-13 11:40:24,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 11:40:24,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 11:40:24,319 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-07-13 11:40:24,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:40:24,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:40:24,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702788693] [2022-07-13 11:40:24,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702788693] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:40:24,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:40:24,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:40:24,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585141083] [2022-07-13 11:40:24,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:40:24,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:40:24,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:40:24,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:40:24,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:40:24,330 INFO L87 Difference]: Start difference. First operand 751 states and 1122 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:26,351 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:40:28,356 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:40:29,850 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:40:32,479 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:40:35,732 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:40:36,797 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:40:39,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:40:39,338 INFO L93 Difference]: Finished difference Result 1499 states and 2240 transitions. [2022-07-13 11:40:39,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:40:39,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2022-07-13 11:40:39,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:40:39,347 INFO L225 Difference]: With dead ends: 1499 [2022-07-13 11:40:39,347 INFO L226 Difference]: Without dead ends: 751 [2022-07-13 11:40:39,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:40:39,354 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 7 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2022-07-13 11:40:39,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 671 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 14.9s Time] [2022-07-13 11:40:39,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2022-07-13 11:40:39,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 751. [2022-07-13 11:40:39,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 750 states have (on average 1.4946666666666666) internal successors, (1121), 750 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:39,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1121 transitions. [2022-07-13 11:40:39,396 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1121 transitions. Word has length 129 [2022-07-13 11:40:39,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:40:39,396 INFO L495 AbstractCegarLoop]: Abstraction has 751 states and 1121 transitions. [2022-07-13 11:40:39,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:39,397 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1121 transitions. [2022-07-13 11:40:39,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-13 11:40:39,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:40:39,399 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:40:39,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-13 11:40:39,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:40:39,620 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:40:39,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:40:39,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1440991432, now seen corresponding path program 1 times [2022-07-13 11:40:39,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:40:39,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334307454] [2022-07-13 11:40:39,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:40:39,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:40:39,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:40:39,622 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:40:39,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-13 11:40:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:40:41,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 11:40:41,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:40:41,230 INFO L356 Elim1Store]: treesize reduction 180, result has 14.3 percent of original size [2022-07-13 11:40:41,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 39 [2022-07-13 11:40:41,383 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-13 11:40:41,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 51 [2022-07-13 11:40:41,486 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:40:41,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 15 [2022-07-13 11:40:41,513 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-13 11:40:41,514 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:40:41,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:40:41,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334307454] [2022-07-13 11:40:41,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334307454] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:40:41,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:40:41,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:40:41,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653461229] [2022-07-13 11:40:41,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:40:41,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:40:41,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:40:41,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:40:41,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:40:41,517 INFO L87 Difference]: Start difference. First operand 751 states and 1121 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) [2022-07-13 11:40:43,565 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:40:46,065 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:40:49,968 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:40:51,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:40:51,238 INFO L93 Difference]: Finished difference Result 1770 states and 2646 transitions. [2022-07-13 11:40:51,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:40:51,241 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 129 [2022-07-13 11:40:51,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:40:51,246 INFO L225 Difference]: With dead ends: 1770 [2022-07-13 11:40:51,247 INFO L226 Difference]: Without dead ends: 1029 [2022-07-13 11:40:51,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:40:51,249 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 36 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:40:51,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 590 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 139 Invalid, 1 Unknown, 40 Unchecked, 9.7s Time] [2022-07-13 11:40:51,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2022-07-13 11:40:51,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 906. [2022-07-13 11:40:51,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 905 states have (on average 1.529281767955801) internal successors, (1384), 905 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:51,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1384 transitions. [2022-07-13 11:40:51,274 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1384 transitions. Word has length 129 [2022-07-13 11:40:51,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:40:51,274 INFO L495 AbstractCegarLoop]: Abstraction has 906 states and 1384 transitions. [2022-07-13 11:40:51,275 INFO L496 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) [2022-07-13 11:40:51,275 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1384 transitions. [2022-07-13 11:40:51,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-13 11:40:51,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:40:51,278 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:40:51,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-13 11:40:51,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:40:51,492 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:40:51,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:40:51,492 INFO L85 PathProgramCache]: Analyzing trace with hash 895401078, now seen corresponding path program 1 times [2022-07-13 11:40:51,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:40:51,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348392150] [2022-07-13 11:40:51,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:40:51,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:40:51,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:40:51,494 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:40:51,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-13 11:40:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:40:55,798 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 11:40:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:40:59,314 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-13 11:40:59,315 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 11:40:59,316 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 11:40:59,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-13 11:40:59,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:40:59,525 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:40:59,528 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 11:40:59,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:40:59 BoogieIcfgContainer [2022-07-13 11:40:59,668 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 11:40:59,668 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 11:40:59,668 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 11:40:59,669 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 11:40:59,669 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:40:13" (3/4) ... [2022-07-13 11:40:59,671 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 11:40:59,784 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 11:40:59,785 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 11:40:59,785 INFO L158 Benchmark]: Toolchain (without parser) took 55285.66ms. Allocated memory was 52.4MB in the beginning and 79.7MB in the end (delta: 27.3MB). Free memory was 27.7MB in the beginning and 31.7MB in the end (delta: -4.0MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2022-07-13 11:40:59,786 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 52.4MB. Free memory is still 34.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:40:59,786 INFO L158 Benchmark]: CACSL2BoogieTranslator took 752.35ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 27.4MB in the beginning and 30.5MB in the end (delta: -3.1MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2022-07-13 11:40:59,786 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.38ms. Allocated memory is still 65.0MB. Free memory was 30.5MB in the beginning and 43.3MB in the end (delta: -12.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 11:40:59,786 INFO L158 Benchmark]: Boogie Preprocessor took 60.52ms. Allocated memory is still 65.0MB. Free memory was 43.3MB in the beginning and 36.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 11:40:59,787 INFO L158 Benchmark]: RCFGBuilder took 8482.98ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 36.0MB in the beginning and 37.9MB in the end (delta: -1.8MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2022-07-13 11:40:59,787 INFO L158 Benchmark]: TraceAbstraction took 45777.16ms. Allocated memory is still 79.7MB. Free memory was 37.4MB in the beginning and 28.4MB in the end (delta: 8.9MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2022-07-13 11:40:59,787 INFO L158 Benchmark]: Witness Printer took 116.64ms. Allocated memory is still 79.7MB. Free memory was 28.4MB in the beginning and 31.7MB in the end (delta: -3.3MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2022-07-13 11:40:59,789 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.20ms. Allocated memory is still 52.4MB. Free memory is still 34.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 752.35ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 27.4MB in the beginning and 30.5MB in the end (delta: -3.1MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.38ms. Allocated memory is still 65.0MB. Free memory was 30.5MB in the beginning and 43.3MB in the end (delta: -12.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.52ms. Allocated memory is still 65.0MB. Free memory was 43.3MB in the beginning and 36.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 8482.98ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 36.0MB in the beginning and 37.9MB in the end (delta: -1.8MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * TraceAbstraction took 45777.16ms. Allocated memory is still 79.7MB. Free memory was 37.4MB in the beginning and 28.4MB in the end (delta: 8.9MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Witness Printer took 116.64ms. Allocated memory is still 79.7MB. Free memory was 28.4MB in the beginning and 31.7MB in the end (delta: -3.3MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1757]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={4:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1087] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1088] s->options = __VERIFIER_nondet_ulong() [L1089] s->verify_mode = __VERIFIER_nondet_int() [L1090] EXPR s->session [L1090] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1091] EXPR s->s3 [L1091] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1093] EXPR s->s3 [L1093] EXPR (s->s3)->tmp.new_cipher [L1093] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1095] COND FALSE !(__VERIFIER_nondet_int()) [L1101] s->cert = malloc(sizeof(struct cert_st)) [L1102] EXPR s->cert [L1102] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1105] CALL ssl3_accept(s) [L1111] BUF_MEM *buf ; [L1112] unsigned long l ; [L1113] unsigned long Time ; [L1114] unsigned long tmp ; [L1115] void (*cb)() ; [L1116] long num1 ; [L1117] int ret ; [L1118] int new_state ; [L1119] int state ; [L1120] int skip ; [L1121] int got_new_session ; [L1122] int tmp___1 = __VERIFIER_nondet_int() ; [L1123] int tmp___2 = __VERIFIER_nondet_int() ; [L1124] int tmp___3 = __VERIFIER_nondet_int() ; [L1125] int tmp___4 = __VERIFIER_nondet_int() ; [L1126] int tmp___5 = __VERIFIER_nondet_int() ; [L1127] int tmp___6 = __VERIFIER_nondet_int() ; [L1128] int tmp___7 ; [L1129] long tmp___8 = __VERIFIER_nondet_long() ; [L1130] int tmp___9 = __VERIFIER_nondet_int() ; [L1131] int tmp___10 = __VERIFIER_nondet_int() ; [L1132] int blastFlag ; [L1136] s->state = 8464 [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->info_callback={0:-2147483648}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5] [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5, tmp___1=0] [L1161] EXPR s->cert VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->cert={6:0}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5, tmp___1=0] [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5, tmp___1=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 VAL [={0:-2147483648}, blastFlag=1, got_new_session=0, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->s3={13:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1378] COND FALSE !(ret <= 0) [L1383] s->hit VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->hit=0, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1383] COND FALSE !(s->hit) [L1386] s->state = 8512 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1388] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->s3={13:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1209] COND TRUE s->state == 8512 [L1392] EXPR s->s3 [L1392] EXPR (s->s3)->tmp.new_cipher [L1392] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-2147483648}, ((s->s3)->tmp.new_cipher)->algorithms=0, (s->s3)->tmp.new_cipher={1073741837:0}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->s3={13:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1392] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1395] ret = __VERIFIER_nondet_int() [L1396] COND TRUE blastFlag == 2 [L1397] blastFlag = 6 VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1401] COND FALSE !(ret <= 0) VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1407] s->state = 8528 [L1408] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->s3={13:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1215] COND TRUE s->state == 8528 [L1412] EXPR s->s3 [L1412] EXPR (s->s3)->tmp.new_cipher [L1412] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1412] l = ((s->s3)->tmp.new_cipher)->algorithms [L1413] EXPR s->options VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->options=2097152, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1413] COND TRUE s->options & 2097152UL [L1414] EXPR s->s3 [L1414] (s->s3)->tmp.use_rsa_tmp = 1 [L1418] EXPR s->s3 [L1418] (s->s3)->tmp.use_rsa_tmp VAL [={0:-2147483648}, (s->s3)->tmp.use_rsa_tmp=1, blastFlag=6, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->s3={13:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1418] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1436] ret = __VERIFIER_nondet_int() [L1437] COND TRUE blastFlag == 6 [L1438] blastFlag = 7 VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1442] COND FALSE !(ret <= 0) VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1459] s->state = 8544 [L1460] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->s3={13:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1221] COND TRUE s->state == 8544 [L1464] EXPR s->verify_mode VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->verify_mode=1, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1464] COND TRUE s->verify_mode & 1 [L1465] EXPR s->session [L1465] EXPR (s->session)->peer VAL [={0:-2147483648}, (s->session)->peer={0:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->session={12:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1465] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1475] EXPR s->s3 [L1475] EXPR (s->s3)->tmp.new_cipher [L1475] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-2147483648}, ((s->s3)->tmp.new_cipher)->algorithms=0, (s->s3)->tmp.new_cipher={1073741837:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->s3={13:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1475] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1485] EXPR s->s3 [L1485] (s->s3)->tmp.cert_request = 1 [L1486] ret = __VERIFIER_nondet_int() [L1487] COND TRUE blastFlag == 7 VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=8, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1757] reach_error() VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=8, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.6s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 843 SdHoareTripleChecker+Valid, 27.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 843 mSDsluCounter, 3999 SdHoareTripleChecker+Invalid, 26.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 40 IncrementalHoareTripleChecker+Unchecked, 1789 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 455 IncrementalHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 2210 mSDtfsCounter, 455 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 638 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=906occurred in iteration=7, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 123 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 7.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 771 NumberOfCodeBlocks, 771 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 635 ConstructedInterpolants, 1 QuantifiedInterpolants, 1250 SizeOfPredicates, 11 NumberOfNonLiveVariables, 5501 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 534/534 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-13 11:40:59,835 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE