./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_clnt.blast.03.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_clnt.blast.03.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 1c5ecbc156ef402fa8ca002c27ace1df37fef4394f3f2e7d74e739b1fb38fbd5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:48:38,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:48:38,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:48:38,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:48:38,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:48:38,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:48:38,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:48:38,330 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:48:38,332 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:48:38,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:48:38,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:48:38,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:48:38,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:48:38,343 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:48:38,345 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:48:38,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:48:38,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:48:38,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:48:38,352 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:48:38,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:48:38,358 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:48:38,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:48:38,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:48:38,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:48:38,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:48:38,367 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:48:38,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:48:38,368 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:48:38,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:48:38,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:48:38,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:48:38,370 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:48:38,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:48:38,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:48:38,373 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:48:38,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:48:38,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:48:38,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:48:38,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:48:38,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:48:38,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:48:38,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:48:38,378 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:48:38,412 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:48:38,412 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:48:38,413 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:48:38,413 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:48:38,414 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:48:38,414 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:48:38,414 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:48:38,415 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:48:38,415 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:48:38,416 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:48:38,416 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:48:38,416 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:48:38,416 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:48:38,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:48:38,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:48:38,417 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:48:38,417 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:48:38,417 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:48:38,417 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:48:38,417 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:48:38,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:48:38,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:48:38,418 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:48:38,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:48:38,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:48:38,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:48:38,419 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:48:38,419 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:48:38,419 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:48:38,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:48:38,420 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:48:38,420 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:48:38,420 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:48:38,420 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 -> 1c5ecbc156ef402fa8ca002c27ace1df37fef4394f3f2e7d74e739b1fb38fbd5 [2022-07-11 23:48:38,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:48:38,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:48:38,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:48:38,689 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:48:38,690 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:48:38,691 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.03.i.cil-1.c [2022-07-11 23:48:38,761 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e4de67d1/c0a3349e43d842ec9507174d826580f0/FLAG9e8133657 [2022-07-11 23:48:39,325 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:48:39,326 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.03.i.cil-1.c [2022-07-11 23:48:39,338 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e4de67d1/c0a3349e43d842ec9507174d826580f0/FLAG9e8133657 [2022-07-11 23:48:39,778 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e4de67d1/c0a3349e43d842ec9507174d826580f0 [2022-07-11 23:48:39,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:48:39,782 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:48:39,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:48:39,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:48:39,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:48:39,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:48:39" (1/1) ... [2022-07-11 23:48:39,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8e1c62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:39, skipping insertion in model container [2022-07-11 23:48:39,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:48:39" (1/1) ... [2022-07-11 23:48:39,795 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:48:39,846 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:48:40,173 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_clnt.blast.03.i.cil-1.c[65397,65410] [2022-07-11 23:48:40,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:48:40,192 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:48:40,320 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_clnt.blast.03.i.cil-1.c[65397,65410] [2022-07-11 23:48:40,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:48:40,342 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:48:40,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:40 WrapperNode [2022-07-11 23:48:40,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:48:40,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:48:40,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:48:40,344 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:48:40,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:40" (1/1) ... [2022-07-11 23:48:40,377 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:40" (1/1) ... [2022-07-11 23:48:40,425 INFO L137 Inliner]: procedures = 31, calls = 217, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 718 [2022-07-11 23:48:40,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:48:40,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:48:40,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:48:40,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:48:40,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:40" (1/1) ... [2022-07-11 23:48:40,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:40" (1/1) ... [2022-07-11 23:48:40,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:40" (1/1) ... [2022-07-11 23:48:40,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:40" (1/1) ... [2022-07-11 23:48:40,500 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:40" (1/1) ... [2022-07-11 23:48:40,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:40" (1/1) ... [2022-07-11 23:48:40,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:40" (1/1) ... [2022-07-11 23:48:40,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:48:40,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:48:40,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:48:40,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:48:40,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:40" (1/1) ... [2022-07-11 23:48:40,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:48:40,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:48:40,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-11 23:48:40,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-11 23:48:40,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:48:40,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-11 23:48:40,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 23:48:40,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 23:48:40,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-11 23:48:40,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:48:40,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:48:40,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:48:40,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:48:40,741 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:48:40,743 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:48:40,764 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:48:43,520 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-11 23:48:43,520 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-11 23:48:43,520 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:48:43,527 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:48:43,528 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:48:43,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:48:43 BoogieIcfgContainer [2022-07-11 23:48:43,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:48:43,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:48:43,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:48:43,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:48:43,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:48:39" (1/3) ... [2022-07-11 23:48:43,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7413fb54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:48:43, skipping insertion in model container [2022-07-11 23:48:43,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:40" (2/3) ... [2022-07-11 23:48:43,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7413fb54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:48:43, skipping insertion in model container [2022-07-11 23:48:43,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:48:43" (3/3) ... [2022-07-11 23:48:43,537 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-1.c [2022-07-11 23:48:43,550 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:48:43,550 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:48:43,594 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:48:43,600 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@5d95ec64, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@39c4d926 [2022-07-11 23:48:43,600 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:48:43,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:43,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-11 23:48:43,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:43,612 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] [2022-07-11 23:48:43,613 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:43,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:43,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2022-07-11 23:48:43,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:43,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409816627] [2022-07-11 23:48:43,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:43,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:44,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:48:44,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:44,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409816627] [2022-07-11 23:48:44,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409816627] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:44,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:44,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:48:44,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21231260] [2022-07-11 23:48:44,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:44,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:48:44,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:44,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:48:44,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:48:44,256 INFO L87 Difference]: Start difference. First operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 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 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:46,290 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:46,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:46,601 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2022-07-11 23:48:46,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:48:46,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-11 23:48:46,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:46,614 INFO L225 Difference]: With dead ends: 255 [2022-07-11 23:48:46,615 INFO L226 Difference]: Without dead ends: 116 [2022-07-11 23:48:46,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:48:46,626 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 7 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:46,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 530 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-11 23:48:46,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-11 23:48:46,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2022-07-11 23:48:46,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.5087719298245614) internal successors, (172), 114 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:46,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2022-07-11 23:48:46,688 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2022-07-11 23:48:46,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:46,689 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2022-07-11 23:48:46,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:46,690 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2022-07-11 23:48:46,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-11 23:48:46,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:46,694 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] [2022-07-11 23:48:46,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:48:46,694 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:46,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:46,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2022-07-11 23:48:46,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:46,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110506823] [2022-07-11 23:48:46,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:46,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:47,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-11 23:48:47,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:47,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110506823] [2022-07-11 23:48:47,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110506823] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:47,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:47,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:48:47,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418025709] [2022-07-11 23:48:47,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:47,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:48:47,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:47,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:48:47,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:48:47,006 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:47,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:47,050 INFO L93 Difference]: Finished difference Result 321 states and 484 transitions. [2022-07-11 23:48:47,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:48:47,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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-11 23:48:47,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:47,057 INFO L225 Difference]: With dead ends: 321 [2022-07-11 23:48:47,058 INFO L226 Difference]: Without dead ends: 216 [2022-07-11 23:48:47,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:48:47,062 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 124 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:47,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 310 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:48:47,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-11 23:48:47,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-07-11 23:48:47,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.4883720930232558) internal successors, (320), 215 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-11 23:48:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 320 transitions. [2022-07-11 23:48:47,084 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 320 transitions. Word has length 38 [2022-07-11 23:48:47,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:47,084 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 320 transitions. [2022-07-11 23:48:47,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:47,085 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 320 transitions. [2022-07-11 23:48:47,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-11 23:48:47,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:47,087 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:48:47,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:48:47,087 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:47,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:47,088 INFO L85 PathProgramCache]: Analyzing trace with hash -596933037, now seen corresponding path program 1 times [2022-07-11 23:48:47,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:47,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335079528] [2022-07-11 23:48:47,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:47,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:47,329 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-11 23:48:47,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:47,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335079528] [2022-07-11 23:48:47,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335079528] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:47,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:47,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:48:47,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591649249] [2022-07-11 23:48:47,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:47,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:48:47,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:47,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:48:47,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:48:47,333 INFO L87 Difference]: Start difference. First operand 216 states and 320 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:49,342 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:49,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:49,389 INFO L93 Difference]: Finished difference Result 420 states and 629 transitions. [2022-07-11 23:48:49,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:48:49,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-07-11 23:48:49,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:49,413 INFO L225 Difference]: With dead ends: 420 [2022-07-11 23:48:49,413 INFO L226 Difference]: Without dead ends: 315 [2022-07-11 23:48:49,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:48:49,414 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 123 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:49,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 461 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-11 23:48:49,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-07-11 23:48:49,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2022-07-11 23:48:49,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 1.484076433121019) internal successors, (466), 314 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:49,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 466 transitions. [2022-07-11 23:48:49,437 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 466 transitions. Word has length 53 [2022-07-11 23:48:49,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:49,437 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 466 transitions. [2022-07-11 23:48:49,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:49,438 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 466 transitions. [2022-07-11 23:48:49,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-11 23:48:49,445 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:49,446 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:48:49,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 23:48:49,446 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:49,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:49,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1173568974, now seen corresponding path program 1 times [2022-07-11 23:48:49,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:49,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788139952] [2022-07-11 23:48:49,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:49,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-11 23:48:49,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:49,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788139952] [2022-07-11 23:48:49,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788139952] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:49,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:49,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:48:49,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629533074] [2022-07-11 23:48:49,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:49,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:48:49,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:49,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:48:49,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:48:49,686 INFO L87 Difference]: Start difference. First operand 315 states and 466 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:51,704 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:52,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:52,070 INFO L93 Difference]: Finished difference Result 891 states and 1325 transitions. [2022-07-11 23:48:52,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:48:52,072 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 71 [2022-07-11 23:48:52,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:52,074 INFO L225 Difference]: With dead ends: 891 [2022-07-11 23:48:52,075 INFO L226 Difference]: Without dead ends: 586 [2022-07-11 23:48:52,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:48:52,077 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 107 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:52,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 265 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-07-11 23:48:52,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2022-07-11 23:48:52,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 387. [2022-07-11 23:48:52,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 386 states have (on average 1.5336787564766838) internal successors, (592), 386 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:52,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 592 transitions. [2022-07-11 23:48:52,112 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 592 transitions. Word has length 71 [2022-07-11 23:48:52,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:52,112 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 592 transitions. [2022-07-11 23:48:52,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:52,113 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 592 transitions. [2022-07-11 23:48:52,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-11 23:48:52,115 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:52,115 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:48:52,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 23:48:52,116 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:52,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:52,116 INFO L85 PathProgramCache]: Analyzing trace with hash -2025585655, now seen corresponding path program 1 times [2022-07-11 23:48:52,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:52,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751934413] [2022-07-11 23:48:52,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:52,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:52,354 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-11 23:48:52,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:52,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751934413] [2022-07-11 23:48:52,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751934413] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:52,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:52,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:48:52,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661317177] [2022-07-11 23:48:52,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:52,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:48:52,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:52,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:48:52,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:48:52,358 INFO L87 Difference]: Start difference. First operand 387 states and 592 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:54,367 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:56,382 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:56,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:56,712 INFO L93 Difference]: Finished difference Result 942 states and 1439 transitions. [2022-07-11 23:48:56,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:48:56,713 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 72 [2022-07-11 23:48:56,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:56,715 INFO L225 Difference]: With dead ends: 942 [2022-07-11 23:48:56,715 INFO L226 Difference]: Without dead ends: 565 [2022-07-11 23:48:56,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:48:56,717 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 91 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:56,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 550 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-11 23:48:56,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-07-11 23:48:56,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 439. [2022-07-11 23:48:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 1.552511415525114) internal successors, (680), 438 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:56,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 680 transitions. [2022-07-11 23:48:56,731 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 680 transitions. Word has length 72 [2022-07-11 23:48:56,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:56,731 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 680 transitions. [2022-07-11 23:48:56,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:56,732 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 680 transitions. [2022-07-11 23:48:56,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-11 23:48:56,733 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:56,733 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:48:56,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-11 23:48:56,734 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:56,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:56,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1885037045, now seen corresponding path program 1 times [2022-07-11 23:48:56,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:56,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385324168] [2022-07-11 23:48:56,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:56,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:56,968 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-11 23:48:56,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:56,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385324168] [2022-07-11 23:48:56,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385324168] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:56,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:56,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:48:56,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744510055] [2022-07-11 23:48:56,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:56,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:48:56,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:56,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:48:56,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:48:56,972 INFO L87 Difference]: Start difference. First operand 439 states and 680 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:58,981 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:59,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:59,300 INFO L93 Difference]: Finished difference Result 1139 states and 1753 transitions. [2022-07-11 23:48:59,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:48:59,300 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 72 [2022-07-11 23:48:59,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:59,304 INFO L225 Difference]: With dead ends: 1139 [2022-07-11 23:48:59,304 INFO L226 Difference]: Without dead ends: 710 [2022-07-11 23:48:59,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:48:59,305 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 107 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:59,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-11 23:48:59,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-07-11 23:48:59,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 462. [2022-07-11 23:48:59,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 461 states have (on average 1.5704989154013016) internal successors, (724), 461 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:59,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 724 transitions. [2022-07-11 23:48:59,321 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 724 transitions. Word has length 72 [2022-07-11 23:48:59,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:59,322 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 724 transitions. [2022-07-11 23:48:59,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:59,322 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 724 transitions. [2022-07-11 23:48:59,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-11 23:48:59,323 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:59,323 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:48:59,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-11 23:48:59,324 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:59,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:59,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1523957901, now seen corresponding path program 1 times [2022-07-11 23:48:59,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:59,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265945667] [2022-07-11 23:48:59,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:59,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:59,554 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-11 23:48:59,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:59,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265945667] [2022-07-11 23:48:59,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265945667] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:59,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:59,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:48:59,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903534923] [2022-07-11 23:48:59,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:59,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:48:59,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:59,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:48:59,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:48:59,557 INFO L87 Difference]: Start difference. First operand 462 states and 724 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:01,566 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:03,579 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:03,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:03,879 INFO L93 Difference]: Finished difference Result 1092 states and 1701 transitions. [2022-07-11 23:49:03,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:49:03,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2022-07-11 23:49:03,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:03,882 INFO L225 Difference]: With dead ends: 1092 [2022-07-11 23:49:03,882 INFO L226 Difference]: Without dead ends: 640 [2022-07-11 23:49:03,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:49:03,883 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 93 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:03,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 550 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-11 23:49:03,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2022-07-11 23:49:03,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 508. [2022-07-11 23:49:03,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 1.581854043392505) internal successors, (802), 507 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 802 transitions. [2022-07-11 23:49:03,896 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 802 transitions. Word has length 92 [2022-07-11 23:49:03,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:03,897 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 802 transitions. [2022-07-11 23:49:03,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:03,897 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 802 transitions. [2022-07-11 23:49:03,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-11 23:49:03,898 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:03,898 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:49:03,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-11 23:49:03,899 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:03,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:03,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1877523057, now seen corresponding path program 1 times [2022-07-11 23:49:03,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:49:03,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079304806] [2022-07-11 23:49:03,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:03,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-11 23:49:04,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:04,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079304806] [2022-07-11 23:49:04,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079304806] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:04,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:04,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:49:04,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275502918] [2022-07-11 23:49:04,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:04,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:49:04,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:04,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:49:04,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:49:04,091 INFO L87 Difference]: Start difference. First operand 508 states and 802 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:06,100 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:08,109 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:08,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:08,351 INFO L93 Difference]: Finished difference Result 1092 states and 1718 transitions. [2022-07-11 23:49:08,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:49:08,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2022-07-11 23:49:08,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:08,354 INFO L225 Difference]: With dead ends: 1092 [2022-07-11 23:49:08,355 INFO L226 Difference]: Without dead ends: 594 [2022-07-11 23:49:08,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:49:08,356 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 40 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:08,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 494 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-11 23:49:08,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-07-11 23:49:08,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 548. [2022-07-11 23:49:08,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5904936014625228) internal successors, (870), 547 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 870 transitions. [2022-07-11 23:49:08,371 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 870 transitions. Word has length 92 [2022-07-11 23:49:08,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:08,372 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 870 transitions. [2022-07-11 23:49:08,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:08,372 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 870 transitions. [2022-07-11 23:49:08,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-11 23:49:08,373 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:08,373 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:49:08,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-11 23:49:08,374 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:08,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:08,374 INFO L85 PathProgramCache]: Analyzing trace with hash 377535094, now seen corresponding path program 1 times [2022-07-11 23:49:08,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:49:08,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659486860] [2022-07-11 23:49:08,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:08,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-11 23:49:08,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:08,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659486860] [2022-07-11 23:49:08,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659486860] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:08,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:08,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:49:08,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874112329] [2022-07-11 23:49:08,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:08,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:49:08,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:08,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:49:08,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:49:08,566 INFO L87 Difference]: Start difference. First operand 548 states and 870 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:10,575 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:10,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:10,849 INFO L93 Difference]: Finished difference Result 1282 states and 1998 transitions. [2022-07-11 23:49:10,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:49:10,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2022-07-11 23:49:10,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:10,853 INFO L225 Difference]: With dead ends: 1282 [2022-07-11 23:49:10,853 INFO L226 Difference]: Without dead ends: 744 [2022-07-11 23:49:10,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:49:10,854 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 108 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:10,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-11 23:49:10,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-07-11 23:49:10,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 548. [2022-07-11 23:49:10,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5795246800731262) internal successors, (864), 547 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:10,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 864 transitions. [2022-07-11 23:49:10,869 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 864 transitions. Word has length 93 [2022-07-11 23:49:10,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:10,869 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 864 transitions. [2022-07-11 23:49:10,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:10,870 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 864 transitions. [2022-07-11 23:49:10,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-11 23:49:10,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:10,871 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:49:10,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-11 23:49:10,872 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:10,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:10,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1171686517, now seen corresponding path program 2 times [2022-07-11 23:49:10,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:49:10,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109234577] [2022-07-11 23:49:10,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:10,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:11,068 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-11 23:49:11,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:11,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109234577] [2022-07-11 23:49:11,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109234577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:11,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:11,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:49:11,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405658715] [2022-07-11 23:49:11,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:11,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:49:11,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:11,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:49:11,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:49:11,072 INFO L87 Difference]: Start difference. First operand 548 states and 864 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:13,084 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:15,095 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:15,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:15,400 INFO L93 Difference]: Finished difference Result 1279 states and 1983 transitions. [2022-07-11 23:49:15,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:49:15,401 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 106 [2022-07-11 23:49:15,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:15,404 INFO L225 Difference]: With dead ends: 1279 [2022-07-11 23:49:15,404 INFO L226 Difference]: Without dead ends: 741 [2022-07-11 23:49:15,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:49:15,405 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 111 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:15,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 282 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 203 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-11 23:49:15,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2022-07-11 23:49:15,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 548. [2022-07-11 23:49:15,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5612431444241317) internal successors, (854), 547 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:15,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 854 transitions. [2022-07-11 23:49:15,421 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 854 transitions. Word has length 106 [2022-07-11 23:49:15,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:15,422 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 854 transitions. [2022-07-11 23:49:15,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:15,422 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 854 transitions. [2022-07-11 23:49:15,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-11 23:49:15,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:15,426 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:49:15,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-11 23:49:15,426 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:15,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:15,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1788158099, now seen corresponding path program 1 times [2022-07-11 23:49:15,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:49:15,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281485001] [2022-07-11 23:49:15,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:15,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:15,629 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-11 23:49:15,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:15,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281485001] [2022-07-11 23:49:15,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281485001] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:15,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:15,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:49:15,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224067099] [2022-07-11 23:49:15,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:15,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:49:15,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:15,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:49:15,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:49:15,633 INFO L87 Difference]: Start difference. First operand 548 states and 854 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:17,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:19,654 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:19,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:19,929 INFO L93 Difference]: Finished difference Result 1210 states and 1870 transitions. [2022-07-11 23:49:19,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:49:19,930 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 106 [2022-07-11 23:49:19,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:19,932 INFO L225 Difference]: With dead ends: 1210 [2022-07-11 23:49:19,932 INFO L226 Difference]: Without dead ends: 672 [2022-07-11 23:49:19,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:49:19,934 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 97 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:19,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 538 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 228 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-11 23:49:19,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2022-07-11 23:49:19,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 548. [2022-07-11 23:49:19,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5575868372943327) internal successors, (852), 547 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:19,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 852 transitions. [2022-07-11 23:49:19,948 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 852 transitions. Word has length 106 [2022-07-11 23:49:19,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:19,949 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 852 transitions. [2022-07-11 23:49:19,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:19,949 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 852 transitions. [2022-07-11 23:49:19,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-11 23:49:19,951 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:19,951 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:49:19,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-11 23:49:19,951 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:19,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:19,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1946109419, now seen corresponding path program 1 times [2022-07-11 23:49:19,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:49:19,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499422187] [2022-07-11 23:49:19,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:19,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:20,121 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-11 23:49:20,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:20,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499422187] [2022-07-11 23:49:20,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499422187] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:20,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:20,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:49:20,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811958815] [2022-07-11 23:49:20,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:20,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:49:20,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:20,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:49:20,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:49:20,124 INFO L87 Difference]: Start difference. First operand 548 states and 852 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:22,133 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:24,151 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:24,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:24,351 INFO L93 Difference]: Finished difference Result 1130 states and 1746 transitions. [2022-07-11 23:49:24,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:49:24,352 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 106 [2022-07-11 23:49:24,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:24,354 INFO L225 Difference]: With dead ends: 1130 [2022-07-11 23:49:24,354 INFO L226 Difference]: Without dead ends: 592 [2022-07-11 23:49:24,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:49:24,356 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 46 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:24,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 492 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-11 23:49:24,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-07-11 23:49:24,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 548. [2022-07-11 23:49:24,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5539305301645339) internal successors, (850), 547 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:24,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 850 transitions. [2022-07-11 23:49:24,369 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 850 transitions. Word has length 106 [2022-07-11 23:49:24,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:24,369 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 850 transitions. [2022-07-11 23:49:24,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:24,370 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 850 transitions. [2022-07-11 23:49:24,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-11 23:49:24,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:24,371 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:49:24,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-11 23:49:24,372 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:24,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:24,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1275446372, now seen corresponding path program 1 times [2022-07-11 23:49:24,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:49:24,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458289071] [2022-07-11 23:49:24,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:24,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:24,544 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-11 23:49:24,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:24,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458289071] [2022-07-11 23:49:24,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458289071] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:24,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:24,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:49:24,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678409307] [2022-07-11 23:49:24,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:24,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:49:24,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:24,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:49:24,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:49:24,546 INFO L87 Difference]: Start difference. First operand 548 states and 850 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:26,556 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:26,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:26,843 INFO L93 Difference]: Finished difference Result 1280 states and 1956 transitions. [2022-07-11 23:49:26,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:49:26,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-07-11 23:49:26,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:26,846 INFO L225 Difference]: With dead ends: 1280 [2022-07-11 23:49:26,846 INFO L226 Difference]: Without dead ends: 742 [2022-07-11 23:49:26,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:49:26,848 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 117 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:26,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 286 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-11 23:49:26,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2022-07-11 23:49:26,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 548. [2022-07-11 23:49:26,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5356489945155394) internal successors, (840), 547 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:26,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 840 transitions. [2022-07-11 23:49:26,863 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 840 transitions. Word has length 107 [2022-07-11 23:49:26,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:26,864 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 840 transitions. [2022-07-11 23:49:26,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:26,864 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 840 transitions. [2022-07-11 23:49:26,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-11 23:49:26,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:26,866 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-11 23:49:26,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-11 23:49:26,866 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:26,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:26,866 INFO L85 PathProgramCache]: Analyzing trace with hash 889473249, now seen corresponding path program 1 times [2022-07-11 23:49:26,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:49:26,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495642905] [2022-07-11 23:49:26,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:26,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:27,054 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-11 23:49:27,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:27,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495642905] [2022-07-11 23:49:27,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495642905] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:27,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:27,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:49:27,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393147296] [2022-07-11 23:49:27,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:27,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:49:27,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:27,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:49:27,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:49:27,057 INFO L87 Difference]: Start difference. First operand 548 states and 840 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:29,067 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:29,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:29,390 INFO L93 Difference]: Finished difference Result 1164 states and 1763 transitions. [2022-07-11 23:49:29,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:49:29,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-07-11 23:49:29,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:29,394 INFO L225 Difference]: With dead ends: 1164 [2022-07-11 23:49:29,394 INFO L226 Difference]: Without dead ends: 817 [2022-07-11 23:49:29,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:49:29,395 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 113 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:29,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 492 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-11 23:49:29,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2022-07-11 23:49:29,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 596. [2022-07-11 23:49:29,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 595 states have (on average 1.5210084033613445) internal successors, (905), 595 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:29,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 905 transitions. [2022-07-11 23:49:29,412 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 905 transitions. Word has length 107 [2022-07-11 23:49:29,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:29,412 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 905 transitions. [2022-07-11 23:49:29,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:29,413 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 905 transitions. [2022-07-11 23:49:29,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-11 23:49:29,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:29,414 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:49:29,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-11 23:49:29,415 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:29,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:29,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2005302672, now seen corresponding path program 1 times [2022-07-11 23:49:29,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:49:29,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850971193] [2022-07-11 23:49:29,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:29,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:29,591 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-11 23:49:29,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:29,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850971193] [2022-07-11 23:49:29,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850971193] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:29,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:29,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:49:29,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503496988] [2022-07-11 23:49:29,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:29,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:49:29,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:29,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:49:29,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:49:29,594 INFO L87 Difference]: Start difference. First operand 596 states and 905 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-11 23:49:31,603 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:31,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:31,915 INFO L93 Difference]: Finished difference Result 1457 states and 2189 transitions. [2022-07-11 23:49:31,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:49:31,915 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 107 [2022-07-11 23:49:31,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:31,918 INFO L225 Difference]: With dead ends: 1457 [2022-07-11 23:49:31,918 INFO L226 Difference]: Without dead ends: 871 [2022-07-11 23:49:31,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:49:31,922 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 93 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:31,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 266 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-11 23:49:31,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-07-11 23:49:31,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 710. [2022-07-11 23:49:31,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 709 states have (on average 1.538787023977433) internal successors, (1091), 709 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:31,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1091 transitions. [2022-07-11 23:49:31,940 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1091 transitions. Word has length 107 [2022-07-11 23:49:31,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:31,940 INFO L495 AbstractCegarLoop]: Abstraction has 710 states and 1091 transitions. [2022-07-11 23:49:31,940 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-11 23:49:31,941 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1091 transitions. [2022-07-11 23:49:31,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-11 23:49:31,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:31,942 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:49:31,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-11 23:49:31,943 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:31,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:31,943 INFO L85 PathProgramCache]: Analyzing trace with hash -386918792, now seen corresponding path program 1 times [2022-07-11 23:49:31,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:49:31,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424999216] [2022-07-11 23:49:31,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:31,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:32,140 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-11 23:49:32,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:32,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424999216] [2022-07-11 23:49:32,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424999216] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:32,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:32,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:49:32,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442688098] [2022-07-11 23:49:32,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:32,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:49:32,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:32,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:49:32,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:49:32,145 INFO L87 Difference]: Start difference. First operand 710 states and 1091 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:34,154 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:36,169 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:36,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:36,457 INFO L93 Difference]: Finished difference Result 1534 states and 2342 transitions. [2022-07-11 23:49:36,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:49:36,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-11 23:49:36,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:36,463 INFO L225 Difference]: With dead ends: 1534 [2022-07-11 23:49:36,464 INFO L226 Difference]: Without dead ends: 834 [2022-07-11 23:49:36,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:49:36,466 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 91 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:36,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 530 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 228 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-11 23:49:36,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-07-11 23:49:36,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 710. [2022-07-11 23:49:36,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 709 states have (on average 1.535966149506347) internal successors, (1089), 709 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:36,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1089 transitions. [2022-07-11 23:49:36,490 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1089 transitions. Word has length 108 [2022-07-11 23:49:36,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:36,491 INFO L495 AbstractCegarLoop]: Abstraction has 710 states and 1089 transitions. [2022-07-11 23:49:36,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:36,491 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1089 transitions. [2022-07-11 23:49:36,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-11 23:49:36,493 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:36,493 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:49:36,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-11 23:49:36,493 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:36,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:36,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1089441208, now seen corresponding path program 1 times [2022-07-11 23:49:36,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:49:36,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442506280] [2022-07-11 23:49:36,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:36,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:36,684 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-11 23:49:36,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:36,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442506280] [2022-07-11 23:49:36,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442506280] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:36,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:36,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:49:36,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546001670] [2022-07-11 23:49:36,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:36,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:49:36,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:36,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:49:36,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:49:36,687 INFO L87 Difference]: Start difference. First operand 710 states and 1089 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:38,698 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:40,710 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:40,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:40,990 INFO L93 Difference]: Finished difference Result 1283 states and 1956 transitions. [2022-07-11 23:49:40,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:49:40,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-11 23:49:40,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:40,993 INFO L225 Difference]: With dead ends: 1283 [2022-07-11 23:49:40,993 INFO L226 Difference]: Without dead ends: 828 [2022-07-11 23:49:40,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:49:40,995 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 85 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:40,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 524 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 223 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-11 23:49:40,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2022-07-11 23:49:41,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 710. [2022-07-11 23:49:41,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 709 states have (on average 1.533145275035261) internal successors, (1087), 709 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:41,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1087 transitions. [2022-07-11 23:49:41,013 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1087 transitions. Word has length 108 [2022-07-11 23:49:41,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:41,013 INFO L495 AbstractCegarLoop]: Abstraction has 710 states and 1087 transitions. [2022-07-11 23:49:41,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:41,013 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1087 transitions. [2022-07-11 23:49:41,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-11 23:49:41,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:41,026 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:49:41,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-11 23:49:41,026 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:41,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:41,027 INFO L85 PathProgramCache]: Analyzing trace with hash 546201863, now seen corresponding path program 1 times [2022-07-11 23:49:41,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:49:41,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674197894] [2022-07-11 23:49:41,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:41,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:41,190 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-11 23:49:41,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:41,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674197894] [2022-07-11 23:49:41,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674197894] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:41,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:41,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:49:41,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760866851] [2022-07-11 23:49:41,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:41,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:49:41,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:41,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:49:41,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:49:41,192 INFO L87 Difference]: Start difference. First operand 710 states and 1087 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-11 23:49:43,204 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:43,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:43,430 INFO L93 Difference]: Finished difference Result 1604 states and 2430 transitions. [2022-07-11 23:49:43,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:49:43,430 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 108 [2022-07-11 23:49:43,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:43,433 INFO L225 Difference]: With dead ends: 1604 [2022-07-11 23:49:43,433 INFO L226 Difference]: Without dead ends: 904 [2022-07-11 23:49:43,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:49:43,459 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 92 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:43,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 268 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-11 23:49:43,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2022-07-11 23:49:43,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 746. [2022-07-11 23:49:43,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 745 states have (on average 1.5516778523489934) internal successors, (1156), 745 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:43,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1156 transitions. [2022-07-11 23:49:43,478 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1156 transitions. Word has length 108 [2022-07-11 23:49:43,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:43,478 INFO L495 AbstractCegarLoop]: Abstraction has 746 states and 1156 transitions. [2022-07-11 23:49:43,479 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-11 23:49:43,479 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1156 transitions. [2022-07-11 23:49:43,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-11 23:49:43,481 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:43,481 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:49:43,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-11 23:49:43,481 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:43,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:43,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1432649300, now seen corresponding path program 1 times [2022-07-11 23:49:43,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:49:43,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034692855] [2022-07-11 23:49:43,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:43,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-11 23:49:43,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:43,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034692855] [2022-07-11 23:49:43,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034692855] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:43,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:43,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:49:43,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356762362] [2022-07-11 23:49:43,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:43,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:49:43,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:43,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:49:43,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:49:43,645 INFO L87 Difference]: Start difference. First operand 746 states and 1156 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-11 23:49:45,660 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:47,672 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:47,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:47,916 INFO L93 Difference]: Finished difference Result 1596 states and 2459 transitions. [2022-07-11 23:49:47,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:49:47,924 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 108 [2022-07-11 23:49:47,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:47,929 INFO L225 Difference]: With dead ends: 1596 [2022-07-11 23:49:47,929 INFO L226 Difference]: Without dead ends: 860 [2022-07-11 23:49:47,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:49:47,931 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 61 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:47,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 518 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 220 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-11 23:49:47,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-07-11 23:49:47,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 778. [2022-07-11 23:49:47,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 1.5546975546975548) internal successors, (1208), 777 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:47,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1208 transitions. [2022-07-11 23:49:47,956 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1208 transitions. Word has length 108 [2022-07-11 23:49:47,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:47,957 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1208 transitions. [2022-07-11 23:49:47,957 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-11 23:49:47,957 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1208 transitions. [2022-07-11 23:49:47,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-11 23:49:47,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:47,959 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:49:47,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-11 23:49:47,959 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:47,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:47,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1574655866, now seen corresponding path program 1 times [2022-07-11 23:49:47,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:49:47,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543080762] [2022-07-11 23:49:47,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:47,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:48,113 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-11 23:49:48,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:48,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543080762] [2022-07-11 23:49:48,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543080762] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:48,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:48,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:49:48,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712833264] [2022-07-11 23:49:48,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:48,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:49:48,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:48,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:49:48,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:49:48,116 INFO L87 Difference]: Start difference. First operand 778 states and 1208 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:50,137 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:50,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:50,409 INFO L93 Difference]: Finished difference Result 1704 states and 2600 transitions. [2022-07-11 23:49:50,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:49:50,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-11 23:49:50,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:50,413 INFO L225 Difference]: With dead ends: 1704 [2022-07-11 23:49:50,413 INFO L226 Difference]: Without dead ends: 936 [2022-07-11 23:49:50,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:49:50,415 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 114 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:50,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-11 23:49:50,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2022-07-11 23:49:50,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 778. [2022-07-11 23:49:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 1.5366795366795367) internal successors, (1194), 777 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:50,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1194 transitions. [2022-07-11 23:49:50,435 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1194 transitions. Word has length 108 [2022-07-11 23:49:50,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:50,436 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1194 transitions. [2022-07-11 23:49:50,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:50,436 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1194 transitions. [2022-07-11 23:49:50,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-11 23:49:50,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:50,438 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:49:50,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-11 23:49:50,438 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:50,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:50,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1243951430, now seen corresponding path program 1 times [2022-07-11 23:49:50,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:49:50,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400780914] [2022-07-11 23:49:50,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:50,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:50,601 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-11 23:49:50,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:50,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400780914] [2022-07-11 23:49:50,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400780914] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:50,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:50,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:49:50,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817317772] [2022-07-11 23:49:50,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:50,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:49:50,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:50,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:49:50,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:49:50,604 INFO L87 Difference]: Start difference. First operand 778 states and 1194 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:52,613 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:52,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:52,836 INFO L93 Difference]: Finished difference Result 1486 states and 2256 transitions. [2022-07-11 23:49:52,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:49:52,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-11 23:49:52,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:52,839 INFO L225 Difference]: With dead ends: 1486 [2022-07-11 23:49:52,840 INFO L226 Difference]: Without dead ends: 991 [2022-07-11 23:49:52,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:49:52,841 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 107 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:52,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 474 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-11 23:49:52,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2022-07-11 23:49:52,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 781. [2022-07-11 23:49:52,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 780 states have (on average 1.5243589743589743) internal successors, (1189), 780 states have internal predecessors, (1189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:52,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1189 transitions. [2022-07-11 23:49:52,862 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1189 transitions. Word has length 108 [2022-07-11 23:49:52,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:52,862 INFO L495 AbstractCegarLoop]: Abstraction has 781 states and 1189 transitions. [2022-07-11 23:49:52,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:52,863 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1189 transitions. [2022-07-11 23:49:52,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-11 23:49:52,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:52,864 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:49:52,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-11 23:49:52,865 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:52,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:52,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1536349215, now seen corresponding path program 1 times [2022-07-11 23:49:52,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:49:52,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501917729] [2022-07-11 23:49:52,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:52,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:53,036 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-11 23:49:53,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:53,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501917729] [2022-07-11 23:49:53,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501917729] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:53,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:53,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:49:53,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328846551] [2022-07-11 23:49:53,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:53,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:49:53,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:53,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:49:53,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:49:53,038 INFO L87 Difference]: Start difference. First operand 781 states and 1189 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:55,047 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:55,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:55,308 INFO L93 Difference]: Finished difference Result 1710 states and 2562 transitions. [2022-07-11 23:49:55,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:49:55,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-07-11 23:49:55,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:55,314 INFO L225 Difference]: With dead ends: 1710 [2022-07-11 23:49:55,314 INFO L226 Difference]: Without dead ends: 939 [2022-07-11 23:49:55,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:49:55,316 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 112 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:55,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 268 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-11 23:49:55,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2022-07-11 23:49:55,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 781. [2022-07-11 23:49:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 780 states have (on average 1.5038461538461538) internal successors, (1173), 780 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1173 transitions. [2022-07-11 23:49:55,354 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1173 transitions. Word has length 109 [2022-07-11 23:49:55,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:55,355 INFO L495 AbstractCegarLoop]: Abstraction has 781 states and 1173 transitions. [2022-07-11 23:49:55,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:55,355 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1173 transitions. [2022-07-11 23:49:55,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-11 23:49:55,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:55,357 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:49:55,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-11 23:49:55,357 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:55,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:55,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1835668675, now seen corresponding path program 1 times [2022-07-11 23:49:55,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:49:55,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670607937] [2022-07-11 23:49:55,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:55,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:55,519 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-11 23:49:55,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:55,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670607937] [2022-07-11 23:49:55,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670607937] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:55,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:55,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:49:55,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074652340] [2022-07-11 23:49:55,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:55,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:49:55,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:55,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:49:55,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:49:55,521 INFO L87 Difference]: Start difference. First operand 781 states and 1173 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:57,545 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:57,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:57,767 INFO L93 Difference]: Finished difference Result 1710 states and 2530 transitions. [2022-07-11 23:49:57,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:49:57,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-07-11 23:49:57,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:57,770 INFO L225 Difference]: With dead ends: 1710 [2022-07-11 23:49:57,770 INFO L226 Difference]: Without dead ends: 939 [2022-07-11 23:49:57,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:49:57,772 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 87 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:57,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-11 23:49:57,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2022-07-11 23:49:57,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 787. [2022-07-11 23:49:57,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.5038167938931297) internal successors, (1182), 786 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:57,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1182 transitions. [2022-07-11 23:49:57,794 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1182 transitions. Word has length 109 [2022-07-11 23:49:57,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:57,795 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1182 transitions. [2022-07-11 23:49:57,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:57,795 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1182 transitions. [2022-07-11 23:49:57,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-11 23:49:57,797 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:57,797 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:49:57,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-11 23:49:57,797 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:57,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:57,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1487102300, now seen corresponding path program 1 times [2022-07-11 23:49:57,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:49:57,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184118856] [2022-07-11 23:49:57,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:57,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:57,974 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-11 23:49:57,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:57,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184118856] [2022-07-11 23:49:57,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184118856] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:57,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:57,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:49:57,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640511270] [2022-07-11 23:49:57,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:57,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:49:57,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:57,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:49:57,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:49:57,976 INFO L87 Difference]: Start difference. First operand 787 states and 1182 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:59,985 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:00,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:50:00,253 INFO L93 Difference]: Finished difference Result 1716 states and 2536 transitions. [2022-07-11 23:50:00,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:50:00,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-07-11 23:50:00,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:50:00,255 INFO L225 Difference]: With dead ends: 1716 [2022-07-11 23:50:00,255 INFO L226 Difference]: Without dead ends: 939 [2022-07-11 23:50:00,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:50:00,257 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 105 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:50:00,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 270 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 211 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-11 23:50:00,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2022-07-11 23:50:00,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 787. [2022-07-11 23:50:00,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.4898218829516539) internal successors, (1171), 786 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:00,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1171 transitions. [2022-07-11 23:50:00,287 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1171 transitions. Word has length 110 [2022-07-11 23:50:00,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:50:00,287 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1171 transitions. [2022-07-11 23:50:00,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:00,287 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1171 transitions. [2022-07-11 23:50:00,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-11 23:50:00,289 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:50:00,289 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:50:00,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-11 23:50:00,289 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:50:00,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:50:00,290 INFO L85 PathProgramCache]: Analyzing trace with hash -540911783, now seen corresponding path program 1 times [2022-07-11 23:50:00,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:50:00,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965608277] [2022-07-11 23:50:00,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:50:00,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:50:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-11 23:50:00,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:50:00,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965608277] [2022-07-11 23:50:00,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965608277] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:50:00,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:50:00,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:50:00,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076999003] [2022-07-11 23:50:00,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:50:00,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:50:00,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:50:00,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:50:00,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:50:00,482 INFO L87 Difference]: Start difference. First operand 787 states and 1171 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:02,491 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:02,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:50:02,758 INFO L93 Difference]: Finished difference Result 1707 states and 2502 transitions. [2022-07-11 23:50:02,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:50:02,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-07-11 23:50:02,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:50:02,761 INFO L225 Difference]: With dead ends: 1707 [2022-07-11 23:50:02,761 INFO L226 Difference]: Without dead ends: 927 [2022-07-11 23:50:02,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:50:02,762 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 83 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:50:02,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 270 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 203 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-11 23:50:02,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2022-07-11 23:50:02,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 793. [2022-07-11 23:50:02,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 792 states have (on average 1.4898989898989898) internal successors, (1180), 792 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:02,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1180 transitions. [2022-07-11 23:50:02,787 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1180 transitions. Word has length 110 [2022-07-11 23:50:02,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:50:02,788 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 1180 transitions. [2022-07-11 23:50:02,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:02,788 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1180 transitions. [2022-07-11 23:50:02,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-11 23:50:02,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:50:02,790 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:50:02,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-11 23:50:02,790 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:50:02,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:50:02,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1069705694, now seen corresponding path program 1 times [2022-07-11 23:50:02,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:50:02,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207029994] [2022-07-11 23:50:02,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:50:02,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:50:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-11 23:50:02,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:50:02,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207029994] [2022-07-11 23:50:02,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207029994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:50:02,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:50:02,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:50:02,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746653771] [2022-07-11 23:50:02,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:50:02,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:50:02,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:50:02,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:50:02,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:50:02,952 INFO L87 Difference]: Start difference. First operand 793 states and 1180 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:04,959 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:05,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:50:05,020 INFO L93 Difference]: Finished difference Result 1577 states and 2354 transitions. [2022-07-11 23:50:05,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:50:05,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-07-11 23:50:05,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:50:05,024 INFO L225 Difference]: With dead ends: 1577 [2022-07-11 23:50:05,024 INFO L226 Difference]: Without dead ends: 1074 [2022-07-11 23:50:05,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:50:05,026 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 124 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:50:05,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 468 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-11 23:50:05,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2022-07-11 23:50:05,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1074. [2022-07-11 23:50:05,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 1073 states have (on average 1.4874184529356944) internal successors, (1596), 1073 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:05,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1596 transitions. [2022-07-11 23:50:05,052 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1596 transitions. Word has length 110 [2022-07-11 23:50:05,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:50:05,052 INFO L495 AbstractCegarLoop]: Abstraction has 1074 states and 1596 transitions. [2022-07-11 23:50:05,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:05,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1596 transitions. [2022-07-11 23:50:05,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-11 23:50:05,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:50:05,055 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:50:05,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-11 23:50:05,055 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:50:05,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:50:05,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1254631592, now seen corresponding path program 1 times [2022-07-11 23:50:05,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:50:05,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423607384] [2022-07-11 23:50:05,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:50:05,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:50:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-11 23:50:06,093 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-11 23:50:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-11 23:50:06,516 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-11 23:50:06,517 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-11 23:50:06,517 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-11 23:50:06,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-11 23:50:06,525 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:50:06,528 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-11 23:50:06,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 11:50:06 BoogieIcfgContainer [2022-07-11 23:50:06,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-11 23:50:06,665 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-11 23:50:06,665 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-11 23:50:06,665 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-11 23:50:06,665 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:48:43" (3/4) ... [2022-07-11 23:50:06,668 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-11 23:50:06,668 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-11 23:50:06,668 INFO L158 Benchmark]: Toolchain (without parser) took 86886.67ms. Allocated memory was 96.5MB in the beginning and 207.6MB in the end (delta: 111.1MB). Free memory was 55.4MB in the beginning and 73.7MB in the end (delta: -18.4MB). Peak memory consumption was 93.7MB. Max. memory is 16.1GB. [2022-07-11 23:50:06,668 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 96.5MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:50:06,669 INFO L158 Benchmark]: CACSL2BoogieTranslator took 560.21ms. Allocated memory is still 96.5MB. Free memory was 55.2MB in the beginning and 52.9MB in the end (delta: 2.2MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2022-07-11 23:50:06,669 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.15ms. Allocated memory is still 96.5MB. Free memory was 52.9MB in the beginning and 48.0MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-11 23:50:06,669 INFO L158 Benchmark]: Boogie Preprocessor took 108.25ms. Allocated memory is still 96.5MB. Free memory was 48.0MB in the beginning and 41.5MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-11 23:50:06,670 INFO L158 Benchmark]: RCFGBuilder took 2994.54ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 41.5MB in the beginning and 54.8MB in the end (delta: -13.3MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2022-07-11 23:50:06,670 INFO L158 Benchmark]: TraceAbstraction took 83132.75ms. Allocated memory was 117.4MB in the beginning and 207.6MB in the end (delta: 90.2MB). Free memory was 54.3MB in the beginning and 73.7MB in the end (delta: -19.4MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. [2022-07-11 23:50:06,670 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 207.6MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:50:06,671 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.21ms. Allocated memory is still 96.5MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 560.21ms. Allocated memory is still 96.5MB. Free memory was 55.2MB in the beginning and 52.9MB in the end (delta: 2.2MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.15ms. Allocated memory is still 96.5MB. Free memory was 52.9MB in the beginning and 48.0MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.25ms. Allocated memory is still 96.5MB. Free memory was 48.0MB in the beginning and 41.5MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2994.54ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 41.5MB in the beginning and 54.8MB in the end (delta: -13.3MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * TraceAbstraction took 83132.75ms. Allocated memory was 117.4MB in the beginning and 207.6MB in the end (delta: 90.2MB). Free memory was 54.3MB in the beginning and 73.7MB in the end (delta: -19.4MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 207.6MB. Free memory is still 73.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: 1665]: 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 1360. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={4:0}] [L1077] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1081] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1082] s->ctx = malloc(sizeof(SSL_CTX)) [L1083] s->session = malloc(sizeof(SSL_SESSION)) [L1084] s->state = 12292 [L1085] s->version = __VERIFIER_nondet_int() [L1087] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1088] EXPR s->ctx [L1088] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1089] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1090] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1091] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->flags = __VERIFIER_nondet_long() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1094] EXPR s->s3 [L1094] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1096] EXPR s->s3 [L1096] (s->s3)->tmp.next_state = __VERIFIER_nondet_int() [L1098] CALL ssl3_connect(s) [L1104] BUF_MEM *buf ; [L1105] unsigned long tmp ; [L1106] unsigned long l ; [L1107] long num1 ; [L1108] void (*cb)() ; [L1109] int ret ; [L1110] int new_state ; [L1111] int state ; [L1112] int skip ; [L1113] int tmp___1 = __VERIFIER_nondet_int() ; [L1114] int tmp___2 = __VERIFIER_nondet_int() ; [L1115] int tmp___3 = __VERIFIER_nondet_int() ; [L1116] int tmp___4 = __VERIFIER_nondet_int() ; [L1117] int tmp___5 = __VERIFIER_nondet_int() ; [L1118] int tmp___6 = __VERIFIER_nondet_int() ; [L1119] int tmp___7 = __VERIFIER_nondet_int() ; [L1120] int tmp___8 = __VERIFIER_nondet_int() ; [L1121] long tmp___9 = __VERIFIER_nondet_long() ; [L1122] int blastFlag ; [L1125] blastFlag = 0 [L1126] s->hit=__VERIFIER_nondet_int () [L1127] s->state = 12292 [L1128] tmp = __VERIFIER_nondet_int() [L1129] cb = (void (*)())((void *)0) [L1130] ret = -1 [L1131] skip = 0 [L1132] EXPR s->info_callback VAL [={0:0}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->info_callback={0:-2147483648}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1133] EXPR s->info_callback [L1133] cb = s->info_callback [L1141] EXPR s->in_handshake [L1141] s->in_handshake += 1 [L1142] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=12292, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND TRUE s->state == 12292 [L1258] s->new_session = 1 [L1259] s->state = 4096 [L1260] EXPR s->ctx [L1260] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1260] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1265] s->server = 0 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1266] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1271] EXPR s->version VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->version=-6, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1271] COND FALSE !((s->version & 65280) != 768) [L1277] s->type = 4096 [L1278] EXPR s->init_buf VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->init_buf={0:1}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1278] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1296] COND FALSE !(! tmp___4) VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1302] COND FALSE !(! tmp___5) [L1308] s->state = 4368 [L1309] EXPR s->ctx [L1309] EXPR (s->ctx)->stats.sess_connect [L1309] (s->ctx)->stats.sess_connect += 1 [L1310] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967336, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND TRUE s->state == 4368 [L1314] s->shutdown = 0 [L1315] ret = __VERIFIER_nondet_int() [L1316] COND TRUE blastFlag == 0 [L1317] blastFlag = 1 VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1321] COND FALSE !(ret <= 0) [L1326] s->state = 4384 [L1327] s->init_num = 0 [L1328] EXPR s->bbio [L1328] EXPR s->wbio VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->bbio={0:11}, s->wbio={0:-13}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1328] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967336, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND TRUE s->state == 4384 [L1336] ret = __VERIFIER_nondet_int() [L1337] COND TRUE blastFlag == 1 [L1338] blastFlag = 2 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1346] COND FALSE !(ret <= 0) [L1351] s->hit VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1351] COND FALSE !(s->hit) [L1354] s->state = 4400 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1356] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967336, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1182] COND TRUE s->state == 4400 [L1360] EXPR s->s3 [L1360] EXPR (s->s3)->tmp.new_cipher [L1360] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-2147483648}, ((s->s3)->tmp.new_cipher)->algorithms=4294967345, (s->s3)->tmp.new_cipher={-7:0}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1360] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1363] ret = __VERIFIER_nondet_int() [L1364] COND TRUE blastFlag == 2 [L1365] blastFlag = 3 VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1369] COND FALSE !(ret <= 0) VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1375] s->state = 4416 [L1376] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967336, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1188] COND TRUE s->state == 4416 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 3 [L1382] blastFlag = 4 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1386] COND FALSE !(ret <= 0) [L1391] s->state = 4432 [L1392] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1393] COND FALSE !(! tmp___6) VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967336, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 4416) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 4417) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1194] COND TRUE s->state == 4432 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=0, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1665] reach_error() VAL [={0:-2147483648}, blastFlag=4, init=1, ret=0, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 82.9s, OverallIterations: 27, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 75.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 34 mSolverCounterUnknown, 2438 SdHoareTripleChecker+Valid, 74.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2438 mSDsluCounter, 10162 SdHoareTripleChecker+Invalid, 72.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5839 mSDsCounter, 627 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4734 IncrementalHoareTripleChecker+Invalid, 5395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 627 mSolverCounterUnsat, 4323 mSDtfsCounter, 4734 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1074occurred in iteration=26, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 3331 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2554 NumberOfCodeBlocks, 2554 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2416 ConstructedInterpolants, 0 QuantifiedInterpolants, 6030 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 2491/2491 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-11 23:50:06,717 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 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_clnt.blast.03.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 1c5ecbc156ef402fa8ca002c27ace1df37fef4394f3f2e7d74e739b1fb38fbd5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:50:08,625 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:50:08,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:50:08,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:50:08,655 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:50:08,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:50:08,660 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:50:08,663 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:50:08,665 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:50:08,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:50:08,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:50:08,675 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:50:08,675 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:50:08,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:50:08,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:50:08,682 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:50:08,682 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:50:08,684 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:50:08,685 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:50:08,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:50:08,692 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:50:08,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:50:08,694 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:50:08,695 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:50:08,696 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:50:08,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:50:08,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:50:08,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:50:08,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:50:08,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:50:08,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:50:08,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:50:08,708 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:50:08,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:50:08,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:50:08,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:50:08,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:50:08,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:50:08,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:50:08,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:50:08,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:50:08,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:50:08,718 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-11 23:50:08,740 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:50:08,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:50:08,741 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:50:08,741 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:50:08,742 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:50:08,742 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:50:08,742 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:50:08,742 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:50:08,743 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:50:08,743 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:50:08,744 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:50:08,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:50:08,744 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:50:08,744 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:50:08,744 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:50:08,744 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:50:08,745 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-11 23:50:08,745 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-11 23:50:08,745 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-11 23:50:08,745 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:50:08,745 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:50:08,745 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:50:08,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:50:08,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:50:08,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:50:08,746 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:50:08,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:50:08,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:50:08,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:50:08,747 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:50:08,747 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-11 23:50:08,747 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-11 23:50:08,747 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:50:08,748 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:50:08,748 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:50:08,748 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-11 23:50:08,748 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 -> 1c5ecbc156ef402fa8ca002c27ace1df37fef4394f3f2e7d74e739b1fb38fbd5 [2022-07-11 23:50:09,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:50:09,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:50:09,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:50:09,071 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:50:09,072 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:50:09,073 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.03.i.cil-1.c [2022-07-11 23:50:09,134 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff48db075/45769fb8294f4e4687874c34d98e45c4/FLAGb8bbd3c89 [2022-07-11 23:50:09,685 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:50:09,687 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.03.i.cil-1.c [2022-07-11 23:50:09,717 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff48db075/45769fb8294f4e4687874c34d98e45c4/FLAGb8bbd3c89 [2022-07-11 23:50:09,978 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff48db075/45769fb8294f4e4687874c34d98e45c4 [2022-07-11 23:50:09,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:50:09,982 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:50:09,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:50:09,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:50:09,991 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:50:09,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:50:09" (1/1) ... [2022-07-11 23:50:09,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e8fad57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:50:09, skipping insertion in model container [2022-07-11 23:50:09,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:50:09" (1/1) ... [2022-07-11 23:50:10,000 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:50:10,044 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:50:10,435 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_clnt.blast.03.i.cil-1.c[65397,65410] [2022-07-11 23:50:10,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:50:10,471 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-11 23:50:10,480 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:50:10,597 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_clnt.blast.03.i.cil-1.c[65397,65410] [2022-07-11 23:50:10,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:50:10,612 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:50:10,700 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_clnt.blast.03.i.cil-1.c[65397,65410] [2022-07-11 23:50:10,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:50:10,723 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:50:10,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:50:10 WrapperNode [2022-07-11 23:50:10,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:50:10,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:50:10,727 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:50:10,727 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:50:10,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:50:10" (1/1) ... [2022-07-11 23:50:10,767 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:50:10" (1/1) ... [2022-07-11 23:50:10,816 INFO L137 Inliner]: procedures = 35, calls = 217, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 689 [2022-07-11 23:50:10,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:50:10,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:50:10,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:50:10,828 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:50:10,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:50:10" (1/1) ... [2022-07-11 23:50:10,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:50:10" (1/1) ... [2022-07-11 23:50:10,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:50:10" (1/1) ... [2022-07-11 23:50:10,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:50:10" (1/1) ... [2022-07-11 23:50:10,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:50:10" (1/1) ... [2022-07-11 23:50:10,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:50:10" (1/1) ... [2022-07-11 23:50:10,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:50:10" (1/1) ... [2022-07-11 23:50:10,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:50:10,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:50:10,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:50:10,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:50:10,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:50:10" (1/1) ... [2022-07-11 23:50:10,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:50:10,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:50:10,913 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-11 23:50:10,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-11 23:50:10,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:50:10,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-11 23:50:10,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-11 23:50:10,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-11 23:50:10,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-11 23:50:10,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:50:10,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:50:10,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:50:10,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-11 23:50:11,126 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:50:11,128 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:50:11,144 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:50:18,379 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-11 23:50:18,379 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-11 23:50:18,379 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:50:18,388 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:50:18,389 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:50:18,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:50:18 BoogieIcfgContainer [2022-07-11 23:50:18,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:50:18,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:50:18,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:50:18,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:50:18,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:50:09" (1/3) ... [2022-07-11 23:50:18,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794ad9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:50:18, skipping insertion in model container [2022-07-11 23:50:18,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:50:10" (2/3) ... [2022-07-11 23:50:18,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794ad9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:50:18, skipping insertion in model container [2022-07-11 23:50:18,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:50:18" (3/3) ... [2022-07-11 23:50:18,402 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-1.c [2022-07-11 23:50:18,415 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:50:18,415 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:50:18,483 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:50:18,489 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@57d19c9a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2bd0b0a [2022-07-11 23:50:18,490 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:50:18,495 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:18,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-11 23:50:18,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:50:18,511 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] [2022-07-11 23:50:18,511 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:50:18,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:50:18,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2022-07-11 23:50:18,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:50:18,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674582755] [2022-07-11 23:50:18,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:50:18,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:50:18,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:50:18,543 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:50:18,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-11 23:50:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:19,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:50:19,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:50:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:50:19,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:50:19,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:50:19,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674582755] [2022-07-11 23:50:19,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [674582755] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:50:19,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:50:19,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:50:19,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560749612] [2022-07-11 23:50:19,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:50:19,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:50:19,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:50:19,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:50:19,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:50:19,500 INFO L87 Difference]: Start difference. First operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:19,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:50:19,607 INFO L93 Difference]: Finished difference Result 369 states and 623 transitions. [2022-07-11 23:50:19,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:50:19,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-11 23:50:19,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:50:19,619 INFO L225 Difference]: With dead ends: 369 [2022-07-11 23:50:19,619 INFO L226 Difference]: Without dead ends: 213 [2022-07-11 23:50:19,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:50:19,625 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 180 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:50:19,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 400 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:50:19,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-11 23:50:19,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2022-07-11 23:50:19,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.4952830188679245) internal successors, (317), 212 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-11 23:50:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 317 transitions. [2022-07-11 23:50:19,667 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 317 transitions. Word has length 24 [2022-07-11 23:50:19,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:50:19,668 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 317 transitions. [2022-07-11 23:50:19,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:19,668 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 317 transitions. [2022-07-11 23:50:19,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-11 23:50:19,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:50:19,670 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] [2022-07-11 23:50:19,693 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-11 23:50:19,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:50:19,884 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:50:19,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:50:19,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1192110763, now seen corresponding path program 1 times [2022-07-11 23:50:19,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:50:19,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428197997] [2022-07-11 23:50:19,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:50:19,886 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:50:19,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:50:19,890 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:50:19,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-11 23:50:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:20,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:50:20,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:50:20,818 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:50:20,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:50:20,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:50:20,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428197997] [2022-07-11 23:50:20,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428197997] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:50:20,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:50:20,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:50:20,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809569757] [2022-07-11 23:50:20,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:50:20,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:50:20,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:50:20,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:50:20,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:50:20,821 INFO L87 Difference]: Start difference. First operand 213 states and 317 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:22,847 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:22,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:50:22,940 INFO L93 Difference]: Finished difference Result 417 states and 626 transitions. [2022-07-11 23:50:22,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:50:22,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-11 23:50:22,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:50:22,943 INFO L225 Difference]: With dead ends: 417 [2022-07-11 23:50:22,943 INFO L226 Difference]: Without dead ends: 312 [2022-07-11 23:50:22,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:50:22,945 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 123 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:50:22,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 461 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-11 23:50:22,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-07-11 23:50:22,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2022-07-11 23:50:22,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 1.4887459807073955) internal successors, (463), 311 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:22,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 463 transitions. [2022-07-11 23:50:22,964 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 463 transitions. Word has length 39 [2022-07-11 23:50:22,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:50:22,965 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 463 transitions. [2022-07-11 23:50:22,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:22,965 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 463 transitions. [2022-07-11 23:50:22,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-11 23:50:22,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:50:22,968 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:50:23,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-11 23:50:23,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:50:23,188 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:50:23,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:50:23,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1499463818, now seen corresponding path program 1 times [2022-07-11 23:50:23,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:50:23,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984172968] [2022-07-11 23:50:23,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:50:23,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:50:23,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:50:23,194 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:50:23,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-11 23:50:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:23,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:50:23,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:50:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-11 23:50:24,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:50:24,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:50:24,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984172968] [2022-07-11 23:50:24,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984172968] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:50:24,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:50:24,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:50:24,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143400951] [2022-07-11 23:50:24,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:50:24,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:50:24,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:50:24,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:50:24,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:50:24,119 INFO L87 Difference]: Start difference. First operand 312 states and 463 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:26,142 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:26,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:50:26,247 INFO L93 Difference]: Finished difference Result 618 states and 923 transitions. [2022-07-11 23:50:26,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:50:26,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-07-11 23:50:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:50:26,250 INFO L225 Difference]: With dead ends: 618 [2022-07-11 23:50:26,250 INFO L226 Difference]: Without dead ends: 414 [2022-07-11 23:50:26,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:50:26,252 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 126 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:50:26,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 468 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-11 23:50:26,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-07-11 23:50:26,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2022-07-11 23:50:26,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 1.4842615012106537) internal successors, (613), 413 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:26,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 613 transitions. [2022-07-11 23:50:26,288 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 613 transitions. Word has length 57 [2022-07-11 23:50:26,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:50:26,289 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 613 transitions. [2022-07-11 23:50:26,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 613 transitions. [2022-07-11 23:50:26,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-11 23:50:26,293 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:50:26,293 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:50:26,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-11 23:50:26,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:50:26,512 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:50:26,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:50:26,512 INFO L85 PathProgramCache]: Analyzing trace with hash -817434927, now seen corresponding path program 1 times [2022-07-11 23:50:26,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:50:26,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [100810771] [2022-07-11 23:50:26,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:50:26,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:50:26,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:50:26,514 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:50:26,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-11 23:50:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:27,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:50:27,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:50:27,588 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-11 23:50:27,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:50:27,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:50:27,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [100810771] [2022-07-11 23:50:27,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [100810771] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:50:27,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:50:27,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:50:27,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039964622] [2022-07-11 23:50:27,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:50:27,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:50:27,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:50:27,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:50:27,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:50:27,591 INFO L87 Difference]: Start difference. First operand 414 states and 613 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:29,613 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:29,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:50:29,704 INFO L93 Difference]: Finished difference Result 821 states and 1222 transitions. [2022-07-11 23:50:29,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:50:29,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-07-11 23:50:29,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:50:29,707 INFO L225 Difference]: With dead ends: 821 [2022-07-11 23:50:29,707 INFO L226 Difference]: Without dead ends: 515 [2022-07-11 23:50:29,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:50:29,710 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 126 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:50:29,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 467 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-11 23:50:29,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-07-11 23:50:29,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2022-07-11 23:50:29,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 514 states have (on average 1.482490272373541) internal successors, (762), 514 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:29,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 762 transitions. [2022-07-11 23:50:29,732 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 762 transitions. Word has length 77 [2022-07-11 23:50:29,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:50:29,733 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 762 transitions. [2022-07-11 23:50:29,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:29,733 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 762 transitions. [2022-07-11 23:50:29,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-11 23:50:29,738 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:50:29,738 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:50:29,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-11 23:50:29,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:50:29,960 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:50:29,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:50:29,961 INFO L85 PathProgramCache]: Analyzing trace with hash 922615118, now seen corresponding path program 1 times [2022-07-11 23:50:29,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:50:29,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055801050] [2022-07-11 23:50:29,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:50:29,962 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:50:29,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:50:29,963 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:50:29,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-11 23:50:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:31,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:50:31,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:50:33,031 INFO L356 Elim1Store]: treesize reduction 32, result has 78.5 percent of original size [2022-07-11 23:50:33,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 1482 treesize of output 1090 [2022-07-11 23:50:50,501 WARN L233 SmtUtils]: Spent 17.36s on a formula simplification. DAG size of input: 205 DAG size of output: 93 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-11 23:50:50,502 INFO L356 Elim1Store]: treesize reduction 1374, result has 25.4 percent of original size [2022-07-11 23:50:50,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 9 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 4790 treesize of output 4750 [2022-07-11 23:50:50,587 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 4345 treesize of output 3031 [2022-07-11 23:50:51,192 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:50:51,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2466 treesize of output 1710 [2022-07-11 23:50:52,126 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:50:52,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 968 treesize of output 891 [2022-07-11 23:50:52,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:52,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:52,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:52,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:52,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:52,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:52,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:52,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:52,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:52,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:52,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:53,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:53,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:53,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:53,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:53,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:53,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:53,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:53,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:53,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:53,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:53,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:53,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:53,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:53,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:53,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:53,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:53,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:53,681 INFO L244 Elim1Store]: Index analysis took 1081 ms [2022-07-11 23:50:54,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 31 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 87 [2022-07-11 23:50:55,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:55,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:56,192 INFO L244 Elim1Store]: Index analysis took 824 ms [2022-07-11 23:50:56,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 31 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 111 [2022-07-11 23:50:57,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:57,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:50:58,020 INFO L244 Elim1Store]: Index analysis took 766 ms [2022-07-11 23:50:58,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 31 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 111 [2022-07-11 23:50:59,044 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 431 treesize of output 371 [2022-07-11 23:50:59,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 123 [2022-07-11 23:50:59,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 115