./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl-simplified/s3_srvr_2.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 724fb2d5eb33b2f1563a1f753919b88185f2f4bb .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:13:13,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:13:13,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:13:13,853 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:13:13,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:13:13,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:13:13,858 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:13:13,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:13:13,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:13:13,870 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:13:13,871 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:13:13,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:13:13,876 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:13:13,878 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:13:13,880 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:13:13,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:13:13,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:13:13,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:13:13,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:13:13,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:13:13,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:13:13,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:13:13,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:13:13,899 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:13:13,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:13:13,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:13:13,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:13:13,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:13:13,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:13:13,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:13:13,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:13:13,906 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:13:13,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:13:13,908 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:13:13,909 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:13:13,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:13:13,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:13:13,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:13:13,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:13:13,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:13:13,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:13:13,914 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 20:13:13,951 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:13:13,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:13:13,952 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:13:13,953 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:13:13,954 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:13:13,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:13:13,955 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:13:13,955 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:13:13,955 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:13:13,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:13:13,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:13:13,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:13:13,957 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:13:13,957 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:13:13,957 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:13:13,957 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:13:13,957 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:13:13,957 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:13:13,958 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:13:13,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:13:13,958 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:13:13,958 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:13:13,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:13:13,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:13:13,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:13:13,959 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:13:13,959 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:13:13,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:13:13,959 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:13:13,960 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:13:13,960 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 -> 724fb2d5eb33b2f1563a1f753919b88185f2f4bb [2021-08-25 20:13:14,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:13:14,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:13:14,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:13:14,351 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:13:14,352 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:13:14,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_2.cil-1.c [2021-08-25 20:13:14,422 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19bd9154f/60d24ada012146e6b6d7ba8d582326e2/FLAGd7f46a8d9 [2021-08-25 20:13:14,881 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:13:14,881 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_2.cil-1.c [2021-08-25 20:13:14,909 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19bd9154f/60d24ada012146e6b6d7ba8d582326e2/FLAGd7f46a8d9 [2021-08-25 20:13:15,402 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19bd9154f/60d24ada012146e6b6d7ba8d582326e2 [2021-08-25 20:13:15,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:13:15,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:13:15,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:13:15,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:13:15,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:13:15,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79266a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15, skipping insertion in model container [2021-08-25 20:13:15,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:13:15,463 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:13:15,687 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_2.cil-1.c[42372,42385] [2021-08-25 20:13:15,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:13:15,727 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:13:15,792 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_2.cil-1.c[42372,42385] [2021-08-25 20:13:15,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:13:15,814 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:13:15,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15 WrapperNode [2021-08-25 20:13:15,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:13:15,817 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:13:15,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:13:15,818 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:13:15,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,848 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:13:15,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:13:15,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:13:15,878 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:13:15,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:13:15,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:13:15,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:13:15,906 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:13:15,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,912 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:13:15,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:15,930 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 20:13:15,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 20:13:15,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:13:15,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:13:15,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:13:15,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:13:16,170 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:13:16,865 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-08-25 20:13:16,865 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-08-25 20:13:16,876 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:13:16,876 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:13:16,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:13:16 BoogieIcfgContainer [2021-08-25 20:13:16,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:13:16,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:13:16,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:13:16,883 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:13:16,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:13:15" (1/3) ... [2021-08-25 20:13:16,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6672dd62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:13:16, skipping insertion in model container [2021-08-25 20:13:16,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (2/3) ... [2021-08-25 20:13:16,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6672dd62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:13:16, skipping insertion in model container [2021-08-25 20:13:16,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:13:16" (3/3) ... [2021-08-25 20:13:16,886 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.cil-1.c [2021-08-25 20:13:16,890 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:13:16,890 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:13:16,929 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:13:16,935 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 20:13:16,935 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:13:16,950 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-25 20:13:16,957 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:16,957 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:16,958 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:16,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:16,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1632005994, now seen corresponding path program 1 times [2021-08-25 20:13:16,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:16,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810816851] [2021-08-25 20:13:16,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:16,972 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:13:17,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:17,200 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810816851] [2021-08-25 20:13:17,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810816851] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:17,201 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:17,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:17,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110679526] [2021-08-25 20:13:17,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:17,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:17,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:17,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:17,220 INFO L87 Difference]: Start difference. First operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 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 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:17,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:17,633 INFO L93 Difference]: Finished difference Result 328 states and 564 transitions. [2021-08-25 20:13:17,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:17,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-08-25 20:13:17,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:17,648 INFO L225 Difference]: With dead ends: 328 [2021-08-25 20:13:17,648 INFO L226 Difference]: Without dead ends: 175 [2021-08-25 20:13:17,652 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:17,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-08-25 20:13:17,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2021-08-25 20:13:17,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.6272189349112427) internal successors, (275), 169 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:17,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 275 transitions. [2021-08-25 20:13:17,694 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 275 transitions. Word has length 44 [2021-08-25 20:13:17,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:17,694 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 275 transitions. [2021-08-25 20:13:17,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 275 transitions. [2021-08-25 20:13:17,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-25 20:13:17,697 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:17,697 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:17,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:13:17,697 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:17,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:17,698 INFO L82 PathProgramCache]: Analyzing trace with hash -954576436, now seen corresponding path program 1 times [2021-08-25 20:13:17,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:17,699 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913912498] [2021-08-25 20:13:17,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:17,699 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:17,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:13:17,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:17,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913912498] [2021-08-25 20:13:17,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913912498] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:17,790 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:17,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:17,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774608608] [2021-08-25 20:13:17,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:17,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:17,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:17,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:17,793 INFO L87 Difference]: Start difference. First operand 170 states and 275 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:18,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:18,074 INFO L93 Difference]: Finished difference Result 380 states and 624 transitions. [2021-08-25 20:13:18,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:18,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-08-25 20:13:18,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:18,077 INFO L225 Difference]: With dead ends: 380 [2021-08-25 20:13:18,077 INFO L226 Difference]: Without dead ends: 216 [2021-08-25 20:13:18,078 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-08-25 20:13:18,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2021-08-25 20:13:18,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.6761904761904762) internal successors, (352), 210 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:18,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 352 transitions. [2021-08-25 20:13:18,092 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 352 transitions. Word has length 45 [2021-08-25 20:13:18,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:18,092 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 352 transitions. [2021-08-25 20:13:18,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:18,093 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 352 transitions. [2021-08-25 20:13:18,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-25 20:13:18,095 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:18,095 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:18,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:13:18,096 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:18,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:18,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2071968837, now seen corresponding path program 1 times [2021-08-25 20:13:18,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:18,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624228365] [2021-08-25 20:13:18,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:18,097 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:18,167 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:13:18,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:18,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624228365] [2021-08-25 20:13:18,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624228365] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:18,168 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:18,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:18,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606538387] [2021-08-25 20:13:18,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:18,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:18,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:18,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,170 INFO L87 Difference]: Start difference. First operand 211 states and 352 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:18,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:18,329 INFO L93 Difference]: Finished difference Result 445 states and 750 transitions. [2021-08-25 20:13:18,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:18,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-08-25 20:13:18,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:18,332 INFO L225 Difference]: With dead ends: 445 [2021-08-25 20:13:18,332 INFO L226 Difference]: Without dead ends: 242 [2021-08-25 20:13:18,333 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-08-25 20:13:18,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-08-25 20:13:18,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.6929460580912863) internal successors, (408), 241 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 408 transitions. [2021-08-25 20:13:18,349 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 408 transitions. Word has length 72 [2021-08-25 20:13:18,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:18,349 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 408 transitions. [2021-08-25 20:13:18,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:18,350 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 408 transitions. [2021-08-25 20:13:18,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-25 20:13:18,353 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:18,353 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:18,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:13:18,353 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:18,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:18,354 INFO L82 PathProgramCache]: Analyzing trace with hash -947039589, now seen corresponding path program 1 times [2021-08-25 20:13:18,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:18,355 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291662821] [2021-08-25 20:13:18,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:18,355 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:18,401 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:13:18,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:18,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291662821] [2021-08-25 20:13:18,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291662821] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:18,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:18,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:18,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724964377] [2021-08-25 20:13:18,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:18,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:18,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:18,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,405 INFO L87 Difference]: Start difference. First operand 242 states and 408 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:18,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:18,540 INFO L93 Difference]: Finished difference Result 493 states and 832 transitions. [2021-08-25 20:13:18,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:18,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 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 84 [2021-08-25 20:13:18,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:18,542 INFO L225 Difference]: With dead ends: 493 [2021-08-25 20:13:18,543 INFO L226 Difference]: Without dead ends: 259 [2021-08-25 20:13:18,543 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-08-25 20:13:18,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2021-08-25 20:13:18,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.68359375) internal successors, (431), 256 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:18,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 431 transitions. [2021-08-25 20:13:18,554 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 431 transitions. Word has length 84 [2021-08-25 20:13:18,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:18,555 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 431 transitions. [2021-08-25 20:13:18,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:18,555 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 431 transitions. [2021-08-25 20:13:18,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-25 20:13:18,558 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:18,558 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:18,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:13:18,559 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:18,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:18,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1168944985, now seen corresponding path program 1 times [2021-08-25 20:13:18,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:18,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686151037] [2021-08-25 20:13:18,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:18,560 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:18,609 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:13:18,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:18,610 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686151037] [2021-08-25 20:13:18,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686151037] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:18,610 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:18,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:18,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699843156] [2021-08-25 20:13:18,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:18,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:18,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:18,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,612 INFO L87 Difference]: Start difference. First operand 257 states and 431 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:18,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:18,785 INFO L93 Difference]: Finished difference Result 552 states and 931 transitions. [2021-08-25 20:13:18,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:18,785 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 84 [2021-08-25 20:13:18,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:18,787 INFO L225 Difference]: With dead ends: 552 [2021-08-25 20:13:18,788 INFO L226 Difference]: Without dead ends: 303 [2021-08-25 20:13:18,788 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-08-25 20:13:18,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2021-08-25 20:13:18,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6946308724832215) internal successors, (505), 298 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:18,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 505 transitions. [2021-08-25 20:13:18,798 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 505 transitions. Word has length 84 [2021-08-25 20:13:18,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:18,799 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 505 transitions. [2021-08-25 20:13:18,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:18,799 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 505 transitions. [2021-08-25 20:13:18,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-25 20:13:18,802 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:18,802 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:18,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:13:18,802 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:18,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:18,803 INFO L82 PathProgramCache]: Analyzing trace with hash 2129818626, now seen corresponding path program 1 times [2021-08-25 20:13:18,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:18,803 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414420803] [2021-08-25 20:13:18,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:18,804 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:13:18,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:18,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414420803] [2021-08-25 20:13:18,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414420803] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:18,867 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:18,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:18,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264956248] [2021-08-25 20:13:18,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:18,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:18,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:18,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,869 INFO L87 Difference]: Start difference. First operand 299 states and 505 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:18,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:18,999 INFO L93 Difference]: Finished difference Result 592 states and 1000 transitions. [2021-08-25 20:13:19,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:19,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 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 85 [2021-08-25 20:13:19,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:19,009 INFO L225 Difference]: With dead ends: 592 [2021-08-25 20:13:19,009 INFO L226 Difference]: Without dead ends: 301 [2021-08-25 20:13:19,010 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:19,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-08-25 20:13:19,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2021-08-25 20:13:19,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6812080536912752) internal successors, (501), 298 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:19,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 501 transitions. [2021-08-25 20:13:19,020 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 501 transitions. Word has length 85 [2021-08-25 20:13:19,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:19,020 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 501 transitions. [2021-08-25 20:13:19,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:19,021 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 501 transitions. [2021-08-25 20:13:19,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-25 20:13:19,022 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:19,022 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:19,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:13:19,023 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:19,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:19,024 INFO L82 PathProgramCache]: Analyzing trace with hash -122958423, now seen corresponding path program 1 times [2021-08-25 20:13:19,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:19,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579482702] [2021-08-25 20:13:19,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:19,029 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:19,103 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:13:19,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:19,104 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579482702] [2021-08-25 20:13:19,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579482702] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:19,104 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:19,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:19,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309620237] [2021-08-25 20:13:19,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:19,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:19,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:19,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:19,108 INFO L87 Difference]: Start difference. First operand 299 states and 501 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:19,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:19,275 INFO L93 Difference]: Finished difference Result 594 states and 995 transitions. [2021-08-25 20:13:19,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:19,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-25 20:13:19,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:19,277 INFO L225 Difference]: With dead ends: 594 [2021-08-25 20:13:19,277 INFO L226 Difference]: Without dead ends: 301 [2021-08-25 20:13:19,278 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:19,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-08-25 20:13:19,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2021-08-25 20:13:19,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.6756756756756757) internal successors, (496), 296 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:19,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 496 transitions. [2021-08-25 20:13:19,287 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 496 transitions. Word has length 85 [2021-08-25 20:13:19,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:19,287 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 496 transitions. [2021-08-25 20:13:19,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:19,287 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 496 transitions. [2021-08-25 20:13:19,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-08-25 20:13:19,288 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:19,288 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:19,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:13:19,289 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:19,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:19,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1553184093, now seen corresponding path program 1 times [2021-08-25 20:13:19,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:19,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138274062] [2021-08-25 20:13:19,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:19,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:19,331 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-25 20:13:19,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:19,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138274062] [2021-08-25 20:13:19,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138274062] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:19,334 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:19,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:19,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214263989] [2021-08-25 20:13:19,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:19,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:19,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:19,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:19,336 INFO L87 Difference]: Start difference. First operand 297 states and 496 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:19,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:19,445 INFO L93 Difference]: Finished difference Result 595 states and 992 transitions. [2021-08-25 20:13:19,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:19,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-08-25 20:13:19,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:19,447 INFO L225 Difference]: With dead ends: 595 [2021-08-25 20:13:19,447 INFO L226 Difference]: Without dead ends: 306 [2021-08-25 20:13:19,448 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:19,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-08-25 20:13:19,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2021-08-25 20:13:19,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.6459016393442623) internal successors, (502), 305 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:19,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2021-08-25 20:13:19,457 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 97 [2021-08-25 20:13:19,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:19,457 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2021-08-25 20:13:19,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:19,458 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2021-08-25 20:13:19,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:13:19,459 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:19,459 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:19,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:13:19,459 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:19,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:19,460 INFO L82 PathProgramCache]: Analyzing trace with hash -2083521026, now seen corresponding path program 1 times [2021-08-25 20:13:19,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:19,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098349582] [2021-08-25 20:13:19,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:19,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:19,503 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:13:19,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:19,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098349582] [2021-08-25 20:13:19,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098349582] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:19,504 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:19,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:19,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616505687] [2021-08-25 20:13:19,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:19,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:19,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:19,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:19,509 INFO L87 Difference]: Start difference. First operand 306 states and 502 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:19,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:19,655 INFO L93 Difference]: Finished difference Result 635 states and 1045 transitions. [2021-08-25 20:13:19,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:19,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-25 20:13:19,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:19,657 INFO L225 Difference]: With dead ends: 635 [2021-08-25 20:13:19,657 INFO L226 Difference]: Without dead ends: 337 [2021-08-25 20:13:19,658 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:19,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-08-25 20:13:19,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2021-08-25 20:13:19,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.6437125748502994) internal successors, (549), 334 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 549 transitions. [2021-08-25 20:13:19,668 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 549 transitions. Word has length 98 [2021-08-25 20:13:19,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:19,668 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 549 transitions. [2021-08-25 20:13:19,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:19,669 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 549 transitions. [2021-08-25 20:13:19,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-25 20:13:19,670 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:19,670 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:19,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:13:19,670 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:19,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:19,671 INFO L82 PathProgramCache]: Analyzing trace with hash -102460539, now seen corresponding path program 1 times [2021-08-25 20:13:19,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:19,671 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719512228] [2021-08-25 20:13:19,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:19,672 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:13:19,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:19,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719512228] [2021-08-25 20:13:19,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719512228] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:19,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:19,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:19,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207476217] [2021-08-25 20:13:19,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:19,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:19,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:19,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:19,701 INFO L87 Difference]: Start difference. First operand 335 states and 549 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:19,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:19,836 INFO L93 Difference]: Finished difference Result 664 states and 1088 transitions. [2021-08-25 20:13:19,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:19,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-08-25 20:13:19,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:19,839 INFO L225 Difference]: With dead ends: 664 [2021-08-25 20:13:19,839 INFO L226 Difference]: Without dead ends: 337 [2021-08-25 20:13:19,840 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:19,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-08-25 20:13:19,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2021-08-25 20:13:19,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.6317365269461077) internal successors, (545), 334 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 545 transitions. [2021-08-25 20:13:19,849 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 545 transitions. Word has length 99 [2021-08-25 20:13:19,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:19,851 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 545 transitions. [2021-08-25 20:13:19,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:19,851 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 545 transitions. [2021-08-25 20:13:19,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-25 20:13:19,852 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:19,852 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:19,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:13:19,853 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:19,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:19,854 INFO L82 PathProgramCache]: Analyzing trace with hash -651386898, now seen corresponding path program 1 times [2021-08-25 20:13:19,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:19,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268149933] [2021-08-25 20:13:19,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:19,856 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:19,901 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:13:19,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:19,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268149933] [2021-08-25 20:13:19,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268149933] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:19,902 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:19,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:19,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17099117] [2021-08-25 20:13:19,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:19,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:19,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:19,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:19,904 INFO L87 Difference]: Start difference. First operand 335 states and 545 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:20,054 INFO L93 Difference]: Finished difference Result 697 states and 1138 transitions. [2021-08-25 20:13:20,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:20,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-25 20:13:20,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:20,056 INFO L225 Difference]: With dead ends: 697 [2021-08-25 20:13:20,057 INFO L226 Difference]: Without dead ends: 370 [2021-08-25 20:13:20,058 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-08-25 20:13:20,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2021-08-25 20:13:20,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.626038781163435) internal successors, (587), 361 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 587 transitions. [2021-08-25 20:13:20,069 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 587 transitions. Word has length 100 [2021-08-25 20:13:20,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:20,069 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 587 transitions. [2021-08-25 20:13:20,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,070 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 587 transitions. [2021-08-25 20:13:20,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-25 20:13:20,071 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:20,071 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:20,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:13:20,071 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:20,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:20,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1258189035, now seen corresponding path program 1 times [2021-08-25 20:13:20,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:20,072 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660616767] [2021-08-25 20:13:20,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:20,073 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:20,113 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:13:20,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:20,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660616767] [2021-08-25 20:13:20,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660616767] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:20,115 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:20,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:20,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32455587] [2021-08-25 20:13:20,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:20,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:20,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:20,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,116 INFO L87 Difference]: Start difference. First operand 362 states and 587 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:20,265 INFO L93 Difference]: Finished difference Result 724 states and 1175 transitions. [2021-08-25 20:13:20,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:20,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-08-25 20:13:20,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:20,270 INFO L225 Difference]: With dead ends: 724 [2021-08-25 20:13:20,270 INFO L226 Difference]: Without dead ends: 370 [2021-08-25 20:13:20,271 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-08-25 20:13:20,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2021-08-25 20:13:20,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.6121883656509695) internal successors, (582), 361 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 582 transitions. [2021-08-25 20:13:20,282 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 582 transitions. Word has length 101 [2021-08-25 20:13:20,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:20,282 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 582 transitions. [2021-08-25 20:13:20,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,282 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 582 transitions. [2021-08-25 20:13:20,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-25 20:13:20,283 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:20,284 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:20,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:13:20,284 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:20,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:20,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1027805126, now seen corresponding path program 1 times [2021-08-25 20:13:20,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:20,285 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431178788] [2021-08-25 20:13:20,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:20,285 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:20,322 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-08-25 20:13:20,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:20,323 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431178788] [2021-08-25 20:13:20,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431178788] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:20,323 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:20,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:20,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883661374] [2021-08-25 20:13:20,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:20,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:20,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:20,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,325 INFO L87 Difference]: Start difference. First operand 362 states and 582 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:20,459 INFO L93 Difference]: Finished difference Result 742 states and 1195 transitions. [2021-08-25 20:13:20,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:20,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-08-25 20:13:20,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:20,462 INFO L225 Difference]: With dead ends: 742 [2021-08-25 20:13:20,462 INFO L226 Difference]: Without dead ends: 388 [2021-08-25 20:13:20,463 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-08-25 20:13:20,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2021-08-25 20:13:20,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5994764397905759) internal successors, (611), 382 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 611 transitions. [2021-08-25 20:13:20,475 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 611 transitions. Word has length 105 [2021-08-25 20:13:20,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:20,475 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 611 transitions. [2021-08-25 20:13:20,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,476 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 611 transitions. [2021-08-25 20:13:20,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-25 20:13:20,477 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:20,477 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:20,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:13:20,478 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:20,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:20,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1570072403, now seen corresponding path program 1 times [2021-08-25 20:13:20,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:20,485 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910875558] [2021-08-25 20:13:20,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:20,485 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:20,516 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-08-25 20:13:20,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:20,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910875558] [2021-08-25 20:13:20,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910875558] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:20,517 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:20,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:20,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724780757] [2021-08-25 20:13:20,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:20,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:20,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:20,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,519 INFO L87 Difference]: Start difference. First operand 383 states and 611 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:20,651 INFO L93 Difference]: Finished difference Result 763 states and 1218 transitions. [2021-08-25 20:13:20,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:20,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-25 20:13:20,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:20,654 INFO L225 Difference]: With dead ends: 763 [2021-08-25 20:13:20,654 INFO L226 Difference]: Without dead ends: 388 [2021-08-25 20:13:20,656 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-08-25 20:13:20,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2021-08-25 20:13:20,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5837696335078535) internal successors, (605), 382 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 605 transitions. [2021-08-25 20:13:20,668 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 605 transitions. Word has length 106 [2021-08-25 20:13:20,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:20,669 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 605 transitions. [2021-08-25 20:13:20,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,669 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 605 transitions. [2021-08-25 20:13:20,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-08-25 20:13:20,671 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:20,671 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:20,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:13:20,671 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:20,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:20,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1383340250, now seen corresponding path program 1 times [2021-08-25 20:13:20,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:20,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760803008] [2021-08-25 20:13:20,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:20,673 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:20,722 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-08-25 20:13:20,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:20,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760803008] [2021-08-25 20:13:20,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760803008] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:20,723 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:20,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:20,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325223069] [2021-08-25 20:13:20,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:20,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:20,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:20,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,725 INFO L87 Difference]: Start difference. First operand 383 states and 605 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:20,768 INFO L93 Difference]: Finished difference Result 758 states and 1198 transitions. [2021-08-25 20:13:20,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:20,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2021-08-25 20:13:20,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:20,772 INFO L225 Difference]: With dead ends: 758 [2021-08-25 20:13:20,772 INFO L226 Difference]: Without dead ends: 756 [2021-08-25 20:13:20,774 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2021-08-25 20:13:20,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2021-08-25 20:13:20,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 755 states have (on average 1.5841059602649006) internal successors, (1196), 755 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1196 transitions. [2021-08-25 20:13:20,812 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1196 transitions. Word has length 121 [2021-08-25 20:13:20,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:20,813 INFO L470 AbstractCegarLoop]: Abstraction has 756 states and 1196 transitions. [2021-08-25 20:13:20,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,813 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1196 transitions. [2021-08-25 20:13:20,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-08-25 20:13:20,815 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:20,815 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:20,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:13:20,816 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:20,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:20,816 INFO L82 PathProgramCache]: Analyzing trace with hash 56372730, now seen corresponding path program 1 times [2021-08-25 20:13:20,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:20,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846790071] [2021-08-25 20:13:20,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:20,817 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:20,853 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-08-25 20:13:20,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:20,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846790071] [2021-08-25 20:13:20,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846790071] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:20,857 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:20,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:20,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643519128] [2021-08-25 20:13:20,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:20,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:20,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:20,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,858 INFO L87 Difference]: Start difference. First operand 756 states and 1196 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:20,901 INFO L93 Difference]: Finished difference Result 1872 states and 2964 transitions. [2021-08-25 20:13:20,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:20,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2021-08-25 20:13:20,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:20,906 INFO L225 Difference]: With dead ends: 1872 [2021-08-25 20:13:20,906 INFO L226 Difference]: Without dead ends: 1124 [2021-08-25 20:13:20,907 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2021-08-25 20:13:20,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1124. [2021-08-25 20:13:20,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 1123 states have (on average 1.5823686553873553) internal successors, (1777), 1123 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1777 transitions. [2021-08-25 20:13:20,944 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1777 transitions. Word has length 122 [2021-08-25 20:13:20,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:20,944 INFO L470 AbstractCegarLoop]: Abstraction has 1124 states and 1777 transitions. [2021-08-25 20:13:20,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1777 transitions. [2021-08-25 20:13:20,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-08-25 20:13:20,947 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:20,947 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:20,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-25 20:13:20,948 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:20,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:20,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1445666744, now seen corresponding path program 1 times [2021-08-25 20:13:20,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:20,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894187095] [2021-08-25 20:13:20,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:20,949 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:20,975 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-08-25 20:13:20,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:20,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894187095] [2021-08-25 20:13:20,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894187095] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:20,976 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:20,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:20,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794381610] [2021-08-25 20:13:20,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:20,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:20,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:20,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,978 INFO L87 Difference]: Start difference. First operand 1124 states and 1777 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:21,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:21,052 INFO L93 Difference]: Finished difference Result 2591 states and 4097 transitions. [2021-08-25 20:13:21,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:21,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2021-08-25 20:13:21,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:21,059 INFO L225 Difference]: With dead ends: 2591 [2021-08-25 20:13:21,059 INFO L226 Difference]: Without dead ends: 1475 [2021-08-25 20:13:21,061 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:21,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2021-08-25 20:13:21,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1475. [2021-08-25 20:13:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1474 states have (on average 1.5793758480325644) internal successors, (2328), 1474 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 2328 transitions. [2021-08-25 20:13:21,126 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 2328 transitions. Word has length 122 [2021-08-25 20:13:21,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:21,127 INFO L470 AbstractCegarLoop]: Abstraction has 1475 states and 2328 transitions. [2021-08-25 20:13:21,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:21,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 2328 transitions. [2021-08-25 20:13:21,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-08-25 20:13:21,132 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:21,132 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:21,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-25 20:13:21,132 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:21,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:21,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1566103125, now seen corresponding path program 1 times [2021-08-25 20:13:21,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:21,133 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345802005] [2021-08-25 20:13:21,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:21,134 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:21,171 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-08-25 20:13:21,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:21,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345802005] [2021-08-25 20:13:21,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345802005] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:21,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:21,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:21,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560333599] [2021-08-25 20:13:21,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:21,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:21,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:21,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:21,175 INFO L87 Difference]: Start difference. First operand 1475 states and 2328 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:21,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:21,380 INFO L93 Difference]: Finished difference Result 2982 states and 4692 transitions. [2021-08-25 20:13:21,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:21,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2021-08-25 20:13:21,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:21,386 INFO L225 Difference]: With dead ends: 2982 [2021-08-25 20:13:21,387 INFO L226 Difference]: Without dead ends: 1515 [2021-08-25 20:13:21,389 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:21,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2021-08-25 20:13:21,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1475. [2021-08-25 20:13:21,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1474 states have (on average 1.4816824966078697) internal successors, (2184), 1474 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:21,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 2184 transitions. [2021-08-25 20:13:21,437 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 2184 transitions. Word has length 159 [2021-08-25 20:13:21,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:21,437 INFO L470 AbstractCegarLoop]: Abstraction has 1475 states and 2184 transitions. [2021-08-25 20:13:21,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:21,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 2184 transitions. [2021-08-25 20:13:21,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-08-25 20:13:21,441 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:21,442 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:21,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-25 20:13:21,442 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:21,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:21,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1636228969, now seen corresponding path program 1 times [2021-08-25 20:13:21,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:21,443 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58724980] [2021-08-25 20:13:21,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:21,443 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:21,494 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-08-25 20:13:21,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:21,494 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58724980] [2021-08-25 20:13:21,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58724980] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:21,495 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:21,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:21,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690719764] [2021-08-25 20:13:21,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:21,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:21,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:21,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:21,497 INFO L87 Difference]: Start difference. First operand 1475 states and 2184 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:21,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:21,694 INFO L93 Difference]: Finished difference Result 3138 states and 4656 transitions. [2021-08-25 20:13:21,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:21,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2021-08-25 20:13:21,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:21,702 INFO L225 Difference]: With dead ends: 3138 [2021-08-25 20:13:21,702 INFO L226 Difference]: Without dead ends: 1671 [2021-08-25 20:13:21,705 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:21,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2021-08-25 20:13:21,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1555. [2021-08-25 20:13:21,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1554 states have (on average 1.444015444015444) internal successors, (2244), 1554 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:21,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2244 transitions. [2021-08-25 20:13:21,766 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2244 transitions. Word has length 159 [2021-08-25 20:13:21,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:21,767 INFO L470 AbstractCegarLoop]: Abstraction has 1555 states and 2244 transitions. [2021-08-25 20:13:21,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:21,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2244 transitions. [2021-08-25 20:13:21,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-08-25 20:13:21,771 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:21,771 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:21,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-25 20:13:21,771 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:21,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:21,772 INFO L82 PathProgramCache]: Analyzing trace with hash 442177989, now seen corresponding path program 1 times [2021-08-25 20:13:21,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:21,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944275203] [2021-08-25 20:13:21,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:21,773 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2021-08-25 20:13:21,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:21,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944275203] [2021-08-25 20:13:21,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944275203] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:21,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:21,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:21,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357999029] [2021-08-25 20:13:21,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:21,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:21,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:21,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:21,806 INFO L87 Difference]: Start difference. First operand 1555 states and 2244 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:21,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:21,998 INFO L93 Difference]: Finished difference Result 3158 states and 4542 transitions. [2021-08-25 20:13:21,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:22,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2021-08-25 20:13:22,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:22,006 INFO L225 Difference]: With dead ends: 3158 [2021-08-25 20:13:22,006 INFO L226 Difference]: Without dead ends: 1611 [2021-08-25 20:13:22,009 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:22,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2021-08-25 20:13:22,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1555. [2021-08-25 20:13:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1554 states have (on average 1.404118404118404) internal successors, (2182), 1554 states have internal predecessors, (2182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2182 transitions. [2021-08-25 20:13:22,071 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2182 transitions. Word has length 173 [2021-08-25 20:13:22,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:22,071 INFO L470 AbstractCegarLoop]: Abstraction has 1555 states and 2182 transitions. [2021-08-25 20:13:22,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2182 transitions. [2021-08-25 20:13:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-08-25 20:13:22,076 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:22,076 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:22,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-25 20:13:22,076 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:22,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:22,077 INFO L82 PathProgramCache]: Analyzing trace with hash 893492071, now seen corresponding path program 1 times [2021-08-25 20:13:22,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:22,077 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506604514] [2021-08-25 20:13:22,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:22,077 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:22,106 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-08-25 20:13:22,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:22,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506604514] [2021-08-25 20:13:22,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506604514] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:22,107 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:22,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:22,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837602051] [2021-08-25 20:13:22,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:22,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:22,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:22,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:22,109 INFO L87 Difference]: Start difference. First operand 1555 states and 2182 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:22,261 INFO L93 Difference]: Finished difference Result 3187 states and 4459 transitions. [2021-08-25 20:13:22,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:22,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 189 [2021-08-25 20:13:22,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:22,268 INFO L225 Difference]: With dead ends: 3187 [2021-08-25 20:13:22,269 INFO L226 Difference]: Without dead ends: 1640 [2021-08-25 20:13:22,271 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:22,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2021-08-25 20:13:22,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1624. [2021-08-25 20:13:22,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1623 states have (on average 1.3961799137399877) internal successors, (2266), 1623 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2266 transitions. [2021-08-25 20:13:22,329 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2266 transitions. Word has length 189 [2021-08-25 20:13:22,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:22,329 INFO L470 AbstractCegarLoop]: Abstraction has 1624 states and 2266 transitions. [2021-08-25 20:13:22,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2266 transitions. [2021-08-25 20:13:22,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-08-25 20:13:22,334 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:22,334 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:22,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-25 20:13:22,334 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:22,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:22,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1767840956, now seen corresponding path program 1 times [2021-08-25 20:13:22,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:22,335 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262441543] [2021-08-25 20:13:22,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:22,336 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2021-08-25 20:13:22,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:22,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262441543] [2021-08-25 20:13:22,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262441543] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:22,387 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:22,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:22,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348856058] [2021-08-25 20:13:22,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:22,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:22,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:22,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:22,390 INFO L87 Difference]: Start difference. First operand 1624 states and 2266 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:22,563 INFO L93 Difference]: Finished difference Result 3392 states and 4736 transitions. [2021-08-25 20:13:22,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:22,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2021-08-25 20:13:22,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:22,576 INFO L225 Difference]: With dead ends: 3392 [2021-08-25 20:13:22,577 INFO L226 Difference]: Without dead ends: 1776 [2021-08-25 20:13:22,580 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:22,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2021-08-25 20:13:22,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1724. [2021-08-25 20:13:22,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1724 states, 1723 states have (on average 1.3847939640162508) internal successors, (2386), 1723 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2386 transitions. [2021-08-25 20:13:22,645 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2386 transitions. Word has length 210 [2021-08-25 20:13:22,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:22,645 INFO L470 AbstractCegarLoop]: Abstraction has 1724 states and 2386 transitions. [2021-08-25 20:13:22,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2386 transitions. [2021-08-25 20:13:22,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-08-25 20:13:22,650 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:22,652 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:22,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-25 20:13:22,652 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:22,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:22,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1550608766, now seen corresponding path program 1 times [2021-08-25 20:13:22,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:22,653 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587233941] [2021-08-25 20:13:22,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:22,653 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:22,690 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2021-08-25 20:13:22,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:22,691 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587233941] [2021-08-25 20:13:22,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587233941] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:22,691 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:22,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:22,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118002706] [2021-08-25 20:13:22,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:22,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:22,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:22,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:22,694 INFO L87 Difference]: Start difference. First operand 1724 states and 2386 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:22,899 INFO L93 Difference]: Finished difference Result 3494 states and 4822 transitions. [2021-08-25 20:13:22,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:22,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 213 [2021-08-25 20:13:22,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:22,907 INFO L225 Difference]: With dead ends: 3494 [2021-08-25 20:13:22,907 INFO L226 Difference]: Without dead ends: 1778 [2021-08-25 20:13:22,909 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:22,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2021-08-25 20:13:22,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1724. [2021-08-25 20:13:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1724 states, 1723 states have (on average 1.380150899593732) internal successors, (2378), 1723 states have internal predecessors, (2378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2378 transitions. [2021-08-25 20:13:22,965 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2378 transitions. Word has length 213 [2021-08-25 20:13:22,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:22,965 INFO L470 AbstractCegarLoop]: Abstraction has 1724 states and 2378 transitions. [2021-08-25 20:13:22,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2378 transitions. [2021-08-25 20:13:22,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2021-08-25 20:13:22,970 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:22,971 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:22,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-25 20:13:22,971 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:22,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:22,972 INFO L82 PathProgramCache]: Analyzing trace with hash -615950364, now seen corresponding path program 1 times [2021-08-25 20:13:22,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:22,972 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931182541] [2021-08-25 20:13:22,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:22,972 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:23,021 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2021-08-25 20:13:23,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:23,021 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931182541] [2021-08-25 20:13:23,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931182541] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:23,022 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:23,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:23,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858377116] [2021-08-25 20:13:23,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:23,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:23,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:23,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:23,023 INFO L87 Difference]: Start difference. First operand 1724 states and 2378 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:23,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:23,202 INFO L93 Difference]: Finished difference Result 3636 states and 5036 transitions. [2021-08-25 20:13:23,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:23,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2021-08-25 20:13:23,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:23,210 INFO L225 Difference]: With dead ends: 3636 [2021-08-25 20:13:23,210 INFO L226 Difference]: Without dead ends: 1820 [2021-08-25 20:13:23,213 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:23,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2021-08-25 20:13:23,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1780. [2021-08-25 20:13:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1779 states have (on average 1.3614390106801575) internal successors, (2422), 1779 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2422 transitions. [2021-08-25 20:13:23,267 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2422 transitions. Word has length 234 [2021-08-25 20:13:23,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:23,267 INFO L470 AbstractCegarLoop]: Abstraction has 1780 states and 2422 transitions. [2021-08-25 20:13:23,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:23,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2422 transitions. [2021-08-25 20:13:23,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2021-08-25 20:13:23,272 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:23,272 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:23,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-25 20:13:23,273 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:23,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:23,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1751905145, now seen corresponding path program 1 times [2021-08-25 20:13:23,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:23,275 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564672223] [2021-08-25 20:13:23,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:23,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2021-08-25 20:13:23,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:23,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564672223] [2021-08-25 20:13:23,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564672223] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:23,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:23,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:23,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874862971] [2021-08-25 20:13:23,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:23,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:23,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:23,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:23,324 INFO L87 Difference]: Start difference. First operand 1780 states and 2422 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:23,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:23,478 INFO L93 Difference]: Finished difference Result 3584 states and 4884 transitions. [2021-08-25 20:13:23,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:23,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2021-08-25 20:13:23,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:23,485 INFO L225 Difference]: With dead ends: 3584 [2021-08-25 20:13:23,485 INFO L226 Difference]: Without dead ends: 1812 [2021-08-25 20:13:23,488 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:23,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2021-08-25 20:13:23,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1780. [2021-08-25 20:13:23,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1779 states have (on average 1.3501967397414278) internal successors, (2402), 1779 states have internal predecessors, (2402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:23,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2402 transitions. [2021-08-25 20:13:23,553 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2402 transitions. Word has length 236 [2021-08-25 20:13:23,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:23,553 INFO L470 AbstractCegarLoop]: Abstraction has 1780 states and 2402 transitions. [2021-08-25 20:13:23,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:23,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2402 transitions. [2021-08-25 20:13:23,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2021-08-25 20:13:23,559 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:23,559 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:23,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-25 20:13:23,560 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:23,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:23,560 INFO L82 PathProgramCache]: Analyzing trace with hash 264243297, now seen corresponding path program 1 times [2021-08-25 20:13:23,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:23,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102612691] [2021-08-25 20:13:23,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:23,561 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:23,610 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 425 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2021-08-25 20:13:23,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:23,611 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102612691] [2021-08-25 20:13:23,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102612691] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:23,611 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951919615] [2021-08-25 20:13:23,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:23,611 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:23,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:23,617 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:13:23,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-25 20:13:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:23,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:13:23,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2021-08-25 20:13:24,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951919615] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:24,621 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 20:13:24,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-08-25 20:13:24,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353000873] [2021-08-25 20:13:24,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:24,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:24,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:24,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:24,623 INFO L87 Difference]: Start difference. First operand 1780 states and 2402 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:24,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:24,695 INFO L93 Difference]: Finished difference Result 3574 states and 4830 transitions. [2021-08-25 20:13:24,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:24,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 246 [2021-08-25 20:13:24,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:24,704 INFO L225 Difference]: With dead ends: 3574 [2021-08-25 20:13:24,705 INFO L226 Difference]: Without dead ends: 2235 [2021-08-25 20:13:24,707 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2235 states. [2021-08-25 20:13:24,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2235 to 2235. [2021-08-25 20:13:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2235 states, 2234 states have (on average 1.3504923903312445) internal successors, (3017), 2234 states have internal predecessors, (3017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:24,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 3017 transitions. [2021-08-25 20:13:24,773 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 3017 transitions. Word has length 246 [2021-08-25 20:13:24,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:24,773 INFO L470 AbstractCegarLoop]: Abstraction has 2235 states and 3017 transitions. [2021-08-25 20:13:24,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:24,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 3017 transitions. [2021-08-25 20:13:24,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-08-25 20:13:24,779 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:24,780 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:24,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-25 20:13:24,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-08-25 20:13:24,993 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:24,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:24,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1153610059, now seen corresponding path program 1 times [2021-08-25 20:13:24,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:24,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819319276] [2021-08-25 20:13:24,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:24,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:25,047 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-08-25 20:13:25,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:25,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819319276] [2021-08-25 20:13:25,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819319276] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:25,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675909907] [2021-08-25 20:13:25,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:25,048 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:25,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:25,050 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:13:25,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-25 20:13:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:25,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:13:25,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:26,020 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-08-25 20:13:26,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675909907] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:26,021 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:13:26,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-25 20:13:26,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025306270] [2021-08-25 20:13:26,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:13:26,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:26,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:13:26,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:13:26,023 INFO L87 Difference]: Start difference. First operand 2235 states and 3017 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:26,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:26,413 INFO L93 Difference]: Finished difference Result 7149 states and 9661 transitions. [2021-08-25 20:13:26,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:13:26,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2021-08-25 20:13:26,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:26,429 INFO L225 Difference]: With dead ends: 7149 [2021-08-25 20:13:26,430 INFO L226 Difference]: Without dead ends: 4922 [2021-08-25 20:13:26,434 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:26,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4922 states. [2021-08-25 20:13:26,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4922 to 2780. [2021-08-25 20:13:26,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2780 states, 2779 states have (on average 1.3195394026628284) internal successors, (3667), 2779 states have internal predecessors, (3667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2780 states to 2780 states and 3667 transitions. [2021-08-25 20:13:26,525 INFO L78 Accepts]: Start accepts. Automaton has 2780 states and 3667 transitions. Word has length 253 [2021-08-25 20:13:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:26,525 INFO L470 AbstractCegarLoop]: Abstraction has 2780 states and 3667 transitions. [2021-08-25 20:13:26,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:26,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2780 states and 3667 transitions. [2021-08-25 20:13:26,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-08-25 20:13:26,532 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:26,532 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:26,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-25 20:13:26,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-08-25 20:13:26,757 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:26,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:26,757 INFO L82 PathProgramCache]: Analyzing trace with hash -864790669, now seen corresponding path program 1 times [2021-08-25 20:13:26,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:26,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857959218] [2021-08-25 20:13:26,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:26,758 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:26,801 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2021-08-25 20:13:26,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:26,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857959218] [2021-08-25 20:13:26,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857959218] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:26,802 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:26,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:26,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628390622] [2021-08-25 20:13:26,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:26,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:26,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:26,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:26,804 INFO L87 Difference]: Start difference. First operand 2780 states and 3667 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:26,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:26,919 INFO L93 Difference]: Finished difference Result 7809 states and 10357 transitions. [2021-08-25 20:13:26,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:26,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2021-08-25 20:13:26,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:26,930 INFO L225 Difference]: With dead ends: 7809 [2021-08-25 20:13:26,930 INFO L226 Difference]: Without dead ends: 5037 [2021-08-25 20:13:26,935 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:26,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5037 states. [2021-08-25 20:13:27,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5037 to 5035. [2021-08-25 20:13:27,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5035 states, 5034 states have (on average 1.3283671036948748) internal successors, (6687), 5034 states have internal predecessors, (6687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5035 states to 5035 states and 6687 transitions. [2021-08-25 20:13:27,081 INFO L78 Accepts]: Start accepts. Automaton has 5035 states and 6687 transitions. Word has length 253 [2021-08-25 20:13:27,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:27,082 INFO L470 AbstractCegarLoop]: Abstraction has 5035 states and 6687 transitions. [2021-08-25 20:13:27,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:27,082 INFO L276 IsEmpty]: Start isEmpty. Operand 5035 states and 6687 transitions. [2021-08-25 20:13:27,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2021-08-25 20:13:27,091 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:27,091 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:27,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-25 20:13:27,092 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:27,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:27,092 INFO L82 PathProgramCache]: Analyzing trace with hash 52349753, now seen corresponding path program 1 times [2021-08-25 20:13:27,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:27,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647310935] [2021-08-25 20:13:27,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:27,093 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:27,138 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2021-08-25 20:13:27,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:27,139 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647310935] [2021-08-25 20:13:27,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647310935] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:27,139 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:27,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:27,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875844648] [2021-08-25 20:13:27,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:27,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:27,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:27,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:27,141 INFO L87 Difference]: Start difference. First operand 5035 states and 6687 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:27,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:27,412 INFO L93 Difference]: Finished difference Result 10162 states and 13482 transitions. [2021-08-25 20:13:27,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:27,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 256 [2021-08-25 20:13:27,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:27,423 INFO L225 Difference]: With dead ends: 10162 [2021-08-25 20:13:27,424 INFO L226 Difference]: Without dead ends: 5135 [2021-08-25 20:13:27,431 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:27,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5135 states. [2021-08-25 20:13:27,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5135 to 5035. [2021-08-25 20:13:27,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5035 states, 5034 states have (on average 1.3112832737385778) internal successors, (6601), 5034 states have internal predecessors, (6601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:27,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5035 states to 5035 states and 6601 transitions. [2021-08-25 20:13:27,574 INFO L78 Accepts]: Start accepts. Automaton has 5035 states and 6601 transitions. Word has length 256 [2021-08-25 20:13:27,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:27,574 INFO L470 AbstractCegarLoop]: Abstraction has 5035 states and 6601 transitions. [2021-08-25 20:13:27,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:27,575 INFO L276 IsEmpty]: Start isEmpty. Operand 5035 states and 6601 transitions. [2021-08-25 20:13:27,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2021-08-25 20:13:27,585 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:27,585 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:27,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-25 20:13:27,586 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:27,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:27,587 INFO L82 PathProgramCache]: Analyzing trace with hash 212492165, now seen corresponding path program 1 times [2021-08-25 20:13:27,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:27,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904931466] [2021-08-25 20:13:27,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:27,587 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2021-08-25 20:13:27,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:27,639 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904931466] [2021-08-25 20:13:27,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904931466] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:27,639 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465712694] [2021-08-25 20:13:27,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:27,640 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:27,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:27,641 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:13:27,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-25 20:13:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:27,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:13:27,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:28,660 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 460 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2021-08-25 20:13:28,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465712694] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:28,661 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 20:13:28,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-08-25 20:13:28,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934206633] [2021-08-25 20:13:28,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:28,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:28,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:28,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:28,663 INFO L87 Difference]: Start difference. First operand 5035 states and 6601 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:28,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:28,887 INFO L93 Difference]: Finished difference Result 9422 states and 12426 transitions. [2021-08-25 20:13:28,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:28,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 282 [2021-08-25 20:13:28,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:28,898 INFO L225 Difference]: With dead ends: 9422 [2021-08-25 20:13:28,899 INFO L226 Difference]: Without dead ends: 5375 [2021-08-25 20:13:28,905 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:28,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5375 states. [2021-08-25 20:13:29,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5375 to 5055. [2021-08-25 20:13:29,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5055 states, 5054 states have (on average 1.307281361297982) internal successors, (6607), 5054 states have internal predecessors, (6607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:29,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5055 states to 5055 states and 6607 transitions. [2021-08-25 20:13:29,058 INFO L78 Accepts]: Start accepts. Automaton has 5055 states and 6607 transitions. Word has length 282 [2021-08-25 20:13:29,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:29,059 INFO L470 AbstractCegarLoop]: Abstraction has 5055 states and 6607 transitions. [2021-08-25 20:13:29,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:29,059 INFO L276 IsEmpty]: Start isEmpty. Operand 5055 states and 6607 transitions. [2021-08-25 20:13:29,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2021-08-25 20:13:29,068 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:29,068 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:29,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-25 20:13:29,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:29,285 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:29,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:29,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1760130215, now seen corresponding path program 1 times [2021-08-25 20:13:29,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:29,286 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213397379] [2021-08-25 20:13:29,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:29,286 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:29,330 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2021-08-25 20:13:29,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:29,330 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213397379] [2021-08-25 20:13:29,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213397379] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:29,330 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17642435] [2021-08-25 20:13:29,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:29,331 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:29,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:29,332 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:13:29,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-25 20:13:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:29,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:13:29,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:30,612 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2021-08-25 20:13:30,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17642435] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:30,613 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 20:13:30,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-08-25 20:13:30,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513180786] [2021-08-25 20:13:30,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:30,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:30,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:30,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:30,615 INFO L87 Difference]: Start difference. First operand 5055 states and 6607 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:30,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:30,796 INFO L93 Difference]: Finished difference Result 10102 states and 13202 transitions. [2021-08-25 20:13:30,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:30,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 283 [2021-08-25 20:13:30,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:30,806 INFO L225 Difference]: With dead ends: 10102 [2021-08-25 20:13:30,806 INFO L226 Difference]: Without dead ends: 5055 [2021-08-25 20:13:30,812 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:30,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5055 states. [2021-08-25 20:13:30,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5055 to 5055. [2021-08-25 20:13:30,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5055 states, 5054 states have (on average 1.3053027305104867) internal successors, (6597), 5054 states have internal predecessors, (6597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:30,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5055 states to 5055 states and 6597 transitions. [2021-08-25 20:13:30,949 INFO L78 Accepts]: Start accepts. Automaton has 5055 states and 6597 transitions. Word has length 283 [2021-08-25 20:13:30,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:30,950 INFO L470 AbstractCegarLoop]: Abstraction has 5055 states and 6597 transitions. [2021-08-25 20:13:30,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:30,950 INFO L276 IsEmpty]: Start isEmpty. Operand 5055 states and 6597 transitions. [2021-08-25 20:13:30,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2021-08-25 20:13:30,958 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:30,958 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:30,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-25 20:13:31,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:31,173 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:31,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:31,173 INFO L82 PathProgramCache]: Analyzing trace with hash 228335597, now seen corresponding path program 1 times [2021-08-25 20:13:31,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:31,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105353290] [2021-08-25 20:13:31,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:31,174 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:31,224 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2021-08-25 20:13:31,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:31,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105353290] [2021-08-25 20:13:31,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105353290] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:31,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809840010] [2021-08-25 20:13:31,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:31,225 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:31,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:31,226 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:13:31,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-25 20:13:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:31,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:13:31,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:32,455 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2021-08-25 20:13:32,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809840010] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:32,455 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:13:32,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-25 20:13:32,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118769708] [2021-08-25 20:13:32,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:13:32,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:32,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:13:32,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:13:32,458 INFO L87 Difference]: Start difference. First operand 5055 states and 6597 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:32,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:32,846 INFO L93 Difference]: Finished difference Result 11826 states and 15346 transitions. [2021-08-25 20:13:32,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:13:32,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 283 [2021-08-25 20:13:32,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:32,858 INFO L225 Difference]: With dead ends: 11826 [2021-08-25 20:13:32,858 INFO L226 Difference]: Without dead ends: 6713 [2021-08-25 20:13:32,864 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:32,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6713 states. [2021-08-25 20:13:32,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6713 to 4419. [2021-08-25 20:13:32,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4419 states, 4418 states have (on average 1.2847442281575374) internal successors, (5676), 4418 states have internal predecessors, (5676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:32,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4419 states to 4419 states and 5676 transitions. [2021-08-25 20:13:32,976 INFO L78 Accepts]: Start accepts. Automaton has 4419 states and 5676 transitions. Word has length 283 [2021-08-25 20:13:32,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:32,977 INFO L470 AbstractCegarLoop]: Abstraction has 4419 states and 5676 transitions. [2021-08-25 20:13:32,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:32,977 INFO L276 IsEmpty]: Start isEmpty. Operand 4419 states and 5676 transitions. [2021-08-25 20:13:32,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2021-08-25 20:13:32,983 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:32,984 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:33,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-25 20:13:33,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:33,193 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:33,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:33,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1511923228, now seen corresponding path program 1 times [2021-08-25 20:13:33,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:33,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655046122] [2021-08-25 20:13:33,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:33,194 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:33,246 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2021-08-25 20:13:33,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:33,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655046122] [2021-08-25 20:13:33,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655046122] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:33,247 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:33,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:33,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430241512] [2021-08-25 20:13:33,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:33,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:33,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:33,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:33,249 INFO L87 Difference]: Start difference. First operand 4419 states and 5676 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:33,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:33,390 INFO L93 Difference]: Finished difference Result 7455 states and 9474 transitions. [2021-08-25 20:13:33,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:33,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 321 [2021-08-25 20:13:33,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:33,395 INFO L225 Difference]: With dead ends: 7455 [2021-08-25 20:13:33,395 INFO L226 Difference]: Without dead ends: 2236 [2021-08-25 20:13:33,399 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:33,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2021-08-25 20:13:33,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 2236. [2021-08-25 20:13:33,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2236 states, 2235 states have (on average 1.2644295302013422) internal successors, (2826), 2235 states have internal predecessors, (2826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:33,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 2826 transitions. [2021-08-25 20:13:33,447 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 2826 transitions. Word has length 321 [2021-08-25 20:13:33,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:33,447 INFO L470 AbstractCegarLoop]: Abstraction has 2236 states and 2826 transitions. [2021-08-25 20:13:33,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:33,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2826 transitions. [2021-08-25 20:13:33,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2021-08-25 20:13:33,451 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:33,452 INFO L512 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:33,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-25 20:13:33,452 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:33,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:33,453 INFO L82 PathProgramCache]: Analyzing trace with hash 761483812, now seen corresponding path program 1 times [2021-08-25 20:13:33,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:33,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190225159] [2021-08-25 20:13:33,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:33,453 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:33,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2021-08-25 20:13:33,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:33,498 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190225159] [2021-08-25 20:13:33,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190225159] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:33,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:33,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:33,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603831894] [2021-08-25 20:13:33,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:33,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:33,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:33,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:33,514 INFO L87 Difference]: Start difference. First operand 2236 states and 2826 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:33,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:33,670 INFO L93 Difference]: Finished difference Result 4474 states and 5650 transitions. [2021-08-25 20:13:33,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:33,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 360 [2021-08-25 20:13:33,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:33,675 INFO L225 Difference]: With dead ends: 4474 [2021-08-25 20:13:33,675 INFO L226 Difference]: Without dead ends: 2246 [2021-08-25 20:13:33,678 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:33,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2021-08-25 20:13:33,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2236. [2021-08-25 20:13:33,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2236 states, 2235 states have (on average 1.2532438478747203) internal successors, (2801), 2235 states have internal predecessors, (2801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:33,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 2801 transitions. [2021-08-25 20:13:33,747 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 2801 transitions. Word has length 360 [2021-08-25 20:13:33,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:33,748 INFO L470 AbstractCegarLoop]: Abstraction has 2236 states and 2801 transitions. [2021-08-25 20:13:33,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:33,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2801 transitions. [2021-08-25 20:13:33,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2021-08-25 20:13:33,753 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:33,753 INFO L512 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:33,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-25 20:13:33,753 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:33,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:33,756 INFO L82 PathProgramCache]: Analyzing trace with hash 35349519, now seen corresponding path program 1 times [2021-08-25 20:13:33,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:33,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136145664] [2021-08-25 20:13:33,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:33,757 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:33,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2021-08-25 20:13:33,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:33,828 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136145664] [2021-08-25 20:13:33,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136145664] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:33,829 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933117793] [2021-08-25 20:13:33,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:33,829 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:33,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:33,833 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:13:33,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-25 20:13:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:34,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:13:34,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2021-08-25 20:13:35,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933117793] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:35,428 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 20:13:35,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-08-25 20:13:35,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132457893] [2021-08-25 20:13:35,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:35,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:35,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:35,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:35,430 INFO L87 Difference]: Start difference. First operand 2236 states and 2801 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:35,482 INFO L93 Difference]: Finished difference Result 2855 states and 3603 transitions. [2021-08-25 20:13:35,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:35,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 393 [2021-08-25 20:13:35,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:35,487 INFO L225 Difference]: With dead ends: 2855 [2021-08-25 20:13:35,487 INFO L226 Difference]: Without dead ends: 2763 [2021-08-25 20:13:35,488 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:35,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2021-08-25 20:13:35,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2146. [2021-08-25 20:13:35,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2146 states, 2145 states have (on average 1.2587412587412588) internal successors, (2700), 2145 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 2700 transitions. [2021-08-25 20:13:35,539 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 2700 transitions. Word has length 393 [2021-08-25 20:13:35,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:35,539 INFO L470 AbstractCegarLoop]: Abstraction has 2146 states and 2700 transitions. [2021-08-25 20:13:35,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:35,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2700 transitions. [2021-08-25 20:13:35,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2021-08-25 20:13:35,545 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:35,545 INFO L512 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-08-25 20:13:35,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-25 20:13:35,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:35,767 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:35,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:35,768 INFO L82 PathProgramCache]: Analyzing trace with hash 431667755, now seen corresponding path program 1 times [2021-08-25 20:13:35,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:35,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606017718] [2021-08-25 20:13:35,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:35,768 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2021-08-25 20:13:35,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:35,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606017718] [2021-08-25 20:13:35,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606017718] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:35,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523526628] [2021-08-25 20:13:35,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:35,839 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:35,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:35,840 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:13:35,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-25 20:13:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:36,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:13:36,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:37,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2021-08-25 20:13:37,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523526628] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:37,793 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:13:37,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-25 20:13:37,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460816239] [2021-08-25 20:13:37,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:13:37,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:37,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:13:37,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:13:37,794 INFO L87 Difference]: Start difference. First operand 2146 states and 2700 transitions. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:38,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:38,100 INFO L93 Difference]: Finished difference Result 5212 states and 6569 transitions. [2021-08-25 20:13:38,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:13:38,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 533 [2021-08-25 20:13:38,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:38,106 INFO L225 Difference]: With dead ends: 5212 [2021-08-25 20:13:38,106 INFO L226 Difference]: Without dead ends: 3032 [2021-08-25 20:13:38,109 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 535 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:38,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3032 states. [2021-08-25 20:13:38,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3032 to 2206. [2021-08-25 20:13:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2206 states, 2205 states have (on average 1.2607709750566893) internal successors, (2780), 2205 states have internal predecessors, (2780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:38,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 2780 transitions. [2021-08-25 20:13:38,163 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 2780 transitions. Word has length 533 [2021-08-25 20:13:38,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:38,163 INFO L470 AbstractCegarLoop]: Abstraction has 2206 states and 2780 transitions. [2021-08-25 20:13:38,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:38,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 2780 transitions. [2021-08-25 20:13:38,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2021-08-25 20:13:38,169 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:38,170 INFO L512 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 11, 11, 8, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:38,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-25 20:13:38,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:38,385 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:38,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:38,385 INFO L82 PathProgramCache]: Analyzing trace with hash 316649701, now seen corresponding path program 1 times [2021-08-25 20:13:38,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:38,385 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521894226] [2021-08-25 20:13:38,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:38,386 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:38,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 2066 proven. 0 refuted. 0 times theorem prover too weak. 1910 trivial. 0 not checked. [2021-08-25 20:13:38,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:38,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521894226] [2021-08-25 20:13:38,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521894226] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:38,497 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:38,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:38,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117827995] [2021-08-25 20:13:38,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:38,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:38,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:38,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:38,500 INFO L87 Difference]: Start difference. First operand 2206 states and 2780 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:38,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:38,675 INFO L93 Difference]: Finished difference Result 4584 states and 5788 transitions. [2021-08-25 20:13:38,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:38,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 595 [2021-08-25 20:13:38,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:38,681 INFO L225 Difference]: With dead ends: 4584 [2021-08-25 20:13:38,681 INFO L226 Difference]: Without dead ends: 2386 [2021-08-25 20:13:38,684 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:38,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2021-08-25 20:13:38,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2376. [2021-08-25 20:13:38,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2376 states, 2375 states have (on average 1.2526315789473683) internal successors, (2975), 2375 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:38,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 2975 transitions. [2021-08-25 20:13:38,759 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 2975 transitions. Word has length 595 [2021-08-25 20:13:38,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:38,760 INFO L470 AbstractCegarLoop]: Abstraction has 2376 states and 2975 transitions. [2021-08-25 20:13:38,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:38,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 2975 transitions. [2021-08-25 20:13:38,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2021-08-25 20:13:38,767 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:38,767 INFO L512 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 10, 8, 8, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:38,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-08-25 20:13:38,768 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:38,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:38,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1796704043, now seen corresponding path program 1 times [2021-08-25 20:13:38,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:38,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753499714] [2021-08-25 20:13:38,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:38,769 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:38,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4945 backedges. 2605 proven. 0 refuted. 0 times theorem prover too weak. 2340 trivial. 0 not checked. [2021-08-25 20:13:38,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:38,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753499714] [2021-08-25 20:13:38,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753499714] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:38,850 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:38,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:38,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804006933] [2021-08-25 20:13:38,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:38,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:38,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:38,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:38,853 INFO L87 Difference]: Start difference. First operand 2376 states and 2975 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:39,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:39,008 INFO L93 Difference]: Finished difference Result 4739 states and 5928 transitions. [2021-08-25 20:13:39,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:39,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 657 [2021-08-25 20:13:39,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:39,013 INFO L225 Difference]: With dead ends: 4739 [2021-08-25 20:13:39,013 INFO L226 Difference]: Without dead ends: 2371 [2021-08-25 20:13:39,016 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:39,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2021-08-25 20:13:39,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 2371. [2021-08-25 20:13:39,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 2370 states have (on average 1.2320675105485233) internal successors, (2920), 2370 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:39,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 2920 transitions. [2021-08-25 20:13:39,069 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 2920 transitions. Word has length 657 [2021-08-25 20:13:39,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:39,070 INFO L470 AbstractCegarLoop]: Abstraction has 2371 states and 2920 transitions. [2021-08-25 20:13:39,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:39,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 2920 transitions. [2021-08-25 20:13:39,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2021-08-25 20:13:39,077 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:39,077 INFO L512 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 21, 21, 19, 19, 17, 17, 15, 15, 15, 15, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:39,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-08-25 20:13:39,078 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:39,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:39,078 INFO L82 PathProgramCache]: Analyzing trace with hash -372840571, now seen corresponding path program 1 times [2021-08-25 20:13:39,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:39,078 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787084228] [2021-08-25 20:13:39,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:39,079 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:39,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2021-08-25 20:13:39,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:39,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787084228] [2021-08-25 20:13:39,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787084228] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:39,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630147933] [2021-08-25 20:13:39,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:39,192 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:39,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:39,193 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:13:39,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-25 20:13:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:40,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 1102 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:13:40,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:41,747 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2021-08-25 20:13:41,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630147933] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:41,747 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:13:41,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-25 20:13:41,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52289604] [2021-08-25 20:13:41,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:13:41,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:41,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:13:41,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:13:41,749 INFO L87 Difference]: Start difference. First operand 2371 states and 2920 transitions. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:41,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:41,951 INFO L93 Difference]: Finished difference Result 4081 states and 5070 transitions. [2021-08-25 20:13:41,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:13:41,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 723 [2021-08-25 20:13:41,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:41,953 INFO L225 Difference]: With dead ends: 4081 [2021-08-25 20:13:41,953 INFO L226 Difference]: Without dead ends: 0 [2021-08-25 20:13:41,955 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 728 GetRequests, 725 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:41,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-25 20:13:41,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-25 20:13:41,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:41,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-25 20:13:41,956 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 723 [2021-08-25 20:13:41,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:41,956 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-25 20:13:41,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:41,957 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-25 20:13:41,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-25 20:13:41,958 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:13:41,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-08-25 20:13:42,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-08-25 20:13:42,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-25 20:13:42,169 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:42,171 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:42,365 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:42,367 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:43,111 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:43,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:43,145 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:43,179 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:43,220 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:43,237 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:43,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:43,277 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:43,297 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:43,298 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:43,331 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:43,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:43,362 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:43,394 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:43,426 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:43,444 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:43,473 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:43,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:43,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:43,539 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:43,566 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:43,589 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:43,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:44,232 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:54,565 INFO L857 garLoopResultBuilder]: For program point L531(lines 531 537) no Hoare annotation was computed. [2021-08-25 20:13:54,566 INFO L857 garLoopResultBuilder]: For program point L498(lines 498 500) no Hoare annotation was computed. [2021-08-25 20:13:54,566 INFO L857 garLoopResultBuilder]: For program point L531-1(lines 531 537) no Hoare annotation was computed. [2021-08-25 20:13:54,566 INFO L857 garLoopResultBuilder]: For program point L498-2(lines 209 543) no Hoare annotation was computed. [2021-08-25 20:13:54,566 INFO L857 garLoopResultBuilder]: For program point L202(lines 202 547) no Hoare annotation was computed. [2021-08-25 20:13:54,567 INFO L857 garLoopResultBuilder]: For program point L169(lines 169 558) no Hoare annotation was computed. [2021-08-25 20:13:54,567 INFO L857 garLoopResultBuilder]: For program point L136(lines 136 569) no Hoare annotation was computed. [2021-08-25 20:13:54,567 INFO L857 garLoopResultBuilder]: For program point L103(lines 103 580) no Hoare annotation was computed. [2021-08-25 20:13:54,567 INFO L857 garLoopResultBuilder]: For program point L434(lines 434 437) no Hoare annotation was computed. [2021-08-25 20:13:54,567 INFO L857 garLoopResultBuilder]: For program point L335(lines 335 373) no Hoare annotation was computed. [2021-08-25 20:13:54,567 INFO L853 garLoopResultBuilder]: At program point L203(lines 199 548) the Hoare annotation is: (let ((.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse2 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse4 .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse3) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3))) [2021-08-25 20:13:54,568 INFO L853 garLoopResultBuilder]: At program point L104(lines 103 580) the Hoare annotation is: false [2021-08-25 20:13:54,568 INFO L860 garLoopResultBuilder]: At program point L600(lines 99 601) the Hoare annotation is: true [2021-08-25 20:13:54,568 INFO L857 garLoopResultBuilder]: For program point L534(lines 534 536) no Hoare annotation was computed. [2021-08-25 20:13:54,568 INFO L853 garLoopResultBuilder]: At program point L402(lines 393 411) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)))) [2021-08-25 20:13:54,568 INFO L857 garLoopResultBuilder]: For program point L205(lines 205 546) no Hoare annotation was computed. [2021-08-25 20:13:54,568 INFO L857 garLoopResultBuilder]: For program point L172(lines 172 557) no Hoare annotation was computed. [2021-08-25 20:13:54,569 INFO L857 garLoopResultBuilder]: For program point L139(lines 139 568) no Hoare annotation was computed. [2021-08-25 20:13:54,569 INFO L857 garLoopResultBuilder]: For program point L106(lines 106 579) no Hoare annotation was computed. [2021-08-25 20:13:54,569 INFO L857 garLoopResultBuilder]: For program point L338(lines 338 372) no Hoare annotation was computed. [2021-08-25 20:13:54,569 INFO L857 garLoopResultBuilder]: For program point L338-1(lines 338 372) no Hoare annotation was computed. [2021-08-25 20:13:54,569 INFO L853 garLoopResultBuilder]: At program point L206(lines 205 546) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2021-08-25 20:13:54,569 INFO L853 garLoopResultBuilder]: At program point L173(lines 169 558) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse3 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)))) [2021-08-25 20:13:54,569 INFO L853 garLoopResultBuilder]: At program point L140(lines 136 569) the Hoare annotation is: (let ((.cse0 (<= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)))) [2021-08-25 20:13:54,570 INFO L857 garLoopResultBuilder]: For program point L471(lines 471 473) no Hoare annotation was computed. [2021-08-25 20:13:54,570 INFO L857 garLoopResultBuilder]: For program point L405(lines 405 407) no Hoare annotation was computed. [2021-08-25 20:13:54,570 INFO L857 garLoopResultBuilder]: For program point L339(lines 339 369) no Hoare annotation was computed. [2021-08-25 20:13:54,570 INFO L853 garLoopResultBuilder]: At program point L208(lines 207 546) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2021-08-25 20:13:54,570 INFO L857 garLoopResultBuilder]: For program point L175(lines 175 556) no Hoare annotation was computed. [2021-08-25 20:13:54,570 INFO L857 garLoopResultBuilder]: For program point L142(lines 142 567) no Hoare annotation was computed. [2021-08-25 20:13:54,570 INFO L857 garLoopResultBuilder]: For program point L109(lines 109 578) no Hoare annotation was computed. [2021-08-25 20:13:54,571 INFO L857 garLoopResultBuilder]: For program point L605(lines 605 607) no Hoare annotation was computed. [2021-08-25 20:13:54,571 INFO L857 garLoopResultBuilder]: For program point L605-2(lines 605 607) no Hoare annotation was computed. [2021-08-25 20:13:54,571 INFO L857 garLoopResultBuilder]: For program point L506(lines 506 509) no Hoare annotation was computed. [2021-08-25 20:13:54,571 INFO L857 garLoopResultBuilder]: For program point L275(lines 275 277) no Hoare annotation was computed. [2021-08-25 20:13:54,571 INFO L857 garLoopResultBuilder]: For program point L275-2(lines 209 543) no Hoare annotation was computed. [2021-08-25 20:13:54,571 INFO L857 garLoopResultBuilder]: For program point L309(lines 309 316) no Hoare annotation was computed. [2021-08-25 20:13:54,571 INFO L857 garLoopResultBuilder]: For program point L309-2(lines 309 316) no Hoare annotation was computed. [2021-08-25 20:13:54,571 INFO L857 garLoopResultBuilder]: For program point L244(lines 244 254) no Hoare annotation was computed. [2021-08-25 20:13:54,572 INFO L857 garLoopResultBuilder]: For program point L178(lines 178 555) no Hoare annotation was computed. [2021-08-25 20:13:54,572 INFO L857 garLoopResultBuilder]: For program point L145(lines 145 566) no Hoare annotation was computed. [2021-08-25 20:13:54,572 INFO L857 garLoopResultBuilder]: For program point L112(lines 112 577) no Hoare annotation was computed. [2021-08-25 20:13:54,572 INFO L857 garLoopResultBuilder]: For program point L344(lines 344 367) no Hoare annotation was computed. [2021-08-25 20:13:54,572 INFO L857 garLoopResultBuilder]: For program point L245(lines 245 248) no Hoare annotation was computed. [2021-08-25 20:13:54,572 INFO L853 garLoopResultBuilder]: At program point L212(lines 106 579) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse7 .cse8 .cse9 .cse10))) [2021-08-25 20:13:54,572 INFO L853 garLoopResultBuilder]: At program point L179(lines 175 556) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse3 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)))) [2021-08-25 20:13:54,573 INFO L853 garLoopResultBuilder]: At program point L146(lines 142 567) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)))) [2021-08-25 20:13:54,573 INFO L860 garLoopResultBuilder]: At program point L610(lines 12 612) the Hoare annotation is: true [2021-08-25 20:13:54,573 INFO L853 garLoopResultBuilder]: At program point L544(lines 100 599) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse17 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (let ((.cse18 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse23 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse26 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse19 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse21 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse9 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (not .cse0)) (.cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse28 (not .cse17)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse30 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse12 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse14 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse20 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse29 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse16 (not .cse1)) (.cse6 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse2) (and (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse1 .cse2) (and .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse5 .cse2) (and .cse7 .cse3 .cse4 .cse6) (and .cse10 .cse11 .cse8 .cse12 .cse13 .cse14) (and .cse8 .cse15 .cse16 .cse9) (and .cse1 .cse2 .cse17) (and .cse2 .cse18) (and .cse3 .cse4 .cse6 .cse14) (and .cse19 .cse5 .cse14) (and .cse15 .cse18) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse20 .cse21 .cse22) (and .cse23 .cse24 .cse19 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse11 .cse25 .cse7 .cse13 .cse26 .cse21) (and (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse1 .cse2) (and .cse8 .cse9 .cse5 .cse2) (and .cse23 .cse24 .cse19 .cse11 .cse25 .cse13 .cse26 .cse21 .cse14) (and .cse10 .cse11 .cse27 .cse7 .cse8 .cse28 .cse12 .cse13) (and .cse8 .cse9 .cse14) (and .cse19 .cse7 .cse5) (and .cse20 .cse3 .cse4 .cse29 .cse5 .cse6) (and .cse19 .cse1 .cse5 .cse2) (and .cse15 .cse16 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse21 .cse22) (and .cse1 .cse30 .cse5 .cse2) (and .cse8 .cse16 .cse9 .cse2) (and .cse11 .cse27 .cse7 .cse8 .cse30 .cse28 .cse12 .cse13) (and .cse11 .cse8 .cse30 .cse12 .cse13 .cse14) (and .cse20 .cse3 .cse4 .cse15 .cse16 .cse6) (and .cse3 .cse4 .cse16 .cse6 .cse2) (and .cse20 .cse3 .cse4 .cse29 .cse16 .cse6)))) [2021-08-25 20:13:54,573 INFO L857 garLoopResultBuilder]: For program point L445(lines 445 447) no Hoare annotation was computed. [2021-08-25 20:13:54,573 INFO L857 garLoopResultBuilder]: For program point L313(lines 313 315) no Hoare annotation was computed. [2021-08-25 20:13:54,573 INFO L857 garLoopResultBuilder]: For program point L181(lines 181 554) no Hoare annotation was computed. [2021-08-25 20:13:54,574 INFO L857 garLoopResultBuilder]: For program point L148(lines 148 565) no Hoare annotation was computed. [2021-08-25 20:13:54,574 INFO L857 garLoopResultBuilder]: For program point L115(lines 115 576) no Hoare annotation was computed. [2021-08-25 20:13:54,574 INFO L857 garLoopResultBuilder]: For program point L347(lines 347 351) no Hoare annotation was computed. [2021-08-25 20:13:54,574 INFO L857 garLoopResultBuilder]: For program point L347-2(lines 347 351) no Hoare annotation was computed. [2021-08-25 20:13:54,574 INFO L857 garLoopResultBuilder]: For program point L83(lines 83 89) no Hoare annotation was computed. [2021-08-25 20:13:54,574 INFO L857 garLoopResultBuilder]: For program point L480(lines 480 482) no Hoare annotation was computed. [2021-08-25 20:13:54,574 INFO L857 garLoopResultBuilder]: For program point L381(lines 381 413) no Hoare annotation was computed. [2021-08-25 20:13:54,574 INFO L857 garLoopResultBuilder]: For program point L514(lines 514 516) no Hoare annotation was computed. [2021-08-25 20:13:54,575 INFO L857 garLoopResultBuilder]: For program point L448(lines 448 457) no Hoare annotation was computed. [2021-08-25 20:13:54,575 INFO L857 garLoopResultBuilder]: For program point L382(lines 382 388) no Hoare annotation was computed. [2021-08-25 20:13:54,575 INFO L857 garLoopResultBuilder]: For program point L217(lines 217 219) no Hoare annotation was computed. [2021-08-25 20:13:54,575 INFO L857 garLoopResultBuilder]: For program point L184(lines 184 553) no Hoare annotation was computed. [2021-08-25 20:13:54,575 INFO L857 garLoopResultBuilder]: For program point L151(lines 151 564) no Hoare annotation was computed. [2021-08-25 20:13:54,575 INFO L857 garLoopResultBuilder]: For program point L217-2(lines 217 219) no Hoare annotation was computed. [2021-08-25 20:13:54,575 INFO L857 garLoopResultBuilder]: For program point L118(lines 118 575) no Hoare annotation was computed. [2021-08-25 20:13:54,575 INFO L857 garLoopResultBuilder]: For program point L581(lines 581 597) no Hoare annotation was computed. [2021-08-25 20:13:54,576 INFO L853 garLoopResultBuilder]: At program point L515(lines 73 611) the Hoare annotation is: false [2021-08-25 20:13:54,576 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-25 20:13:54,576 INFO L853 garLoopResultBuilder]: At program point L185(lines 181 554) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)))) [2021-08-25 20:13:54,576 INFO L853 garLoopResultBuilder]: At program point L152(lines 148 565) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)))) [2021-08-25 20:13:54,576 INFO L857 garLoopResultBuilder]: For program point L86(lines 86 88) no Hoare annotation was computed. [2021-08-25 20:13:54,576 INFO L857 garLoopResultBuilder]: For program point L86-2(lines 83 89) no Hoare annotation was computed. [2021-08-25 20:13:54,576 INFO L857 garLoopResultBuilder]: For program point L582(lines 582 596) no Hoare annotation was computed. [2021-08-25 20:13:54,577 INFO L857 garLoopResultBuilder]: For program point L483(lines 483 487) no Hoare annotation was computed. [2021-08-25 20:13:54,577 INFO L857 garLoopResultBuilder]: For program point L483-2(lines 483 487) no Hoare annotation was computed. [2021-08-25 20:13:54,577 INFO L857 garLoopResultBuilder]: For program point L583(lines 583 588) no Hoare annotation was computed. [2021-08-25 20:13:54,577 INFO L857 garLoopResultBuilder]: For program point L517(lines 517 519) no Hoare annotation was computed. [2021-08-25 20:13:54,577 INFO L857 garLoopResultBuilder]: For program point L583-2(lines 582 596) no Hoare annotation was computed. [2021-08-25 20:13:54,577 INFO L857 garLoopResultBuilder]: For program point L187(lines 187 552) no Hoare annotation was computed. [2021-08-25 20:13:54,577 INFO L857 garLoopResultBuilder]: For program point L154(lines 154 563) no Hoare annotation was computed. [2021-08-25 20:13:54,577 INFO L857 garLoopResultBuilder]: For program point L121(lines 121 574) no Hoare annotation was computed. [2021-08-25 20:13:54,578 INFO L857 garLoopResultBuilder]: For program point L452(lines 452 454) no Hoare annotation was computed. [2021-08-25 20:13:54,578 INFO L853 garLoopResultBuilder]: At program point L122(lines 118 575) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (<= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)))) [2021-08-25 20:13:54,578 INFO L857 garLoopResultBuilder]: For program point L585(lines 585 587) no Hoare annotation was computed. [2021-08-25 20:13:54,578 INFO L857 garLoopResultBuilder]: For program point L288(lines 288 294) no Hoare annotation was computed. [2021-08-25 20:13:54,578 INFO L857 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-08-25 20:13:54,578 INFO L857 garLoopResultBuilder]: For program point L355(lines 355 363) no Hoare annotation was computed. [2021-08-25 20:13:54,578 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-25 20:13:54,578 INFO L857 garLoopResultBuilder]: For program point L190(lines 190 551) no Hoare annotation was computed. [2021-08-25 20:13:54,579 INFO L857 garLoopResultBuilder]: For program point L157(lines 157 562) no Hoare annotation was computed. [2021-08-25 20:13:54,579 INFO L857 garLoopResultBuilder]: For program point L124(lines 124 573) no Hoare annotation was computed. [2021-08-25 20:13:54,579 INFO L857 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2021-08-25 20:13:54,579 INFO L857 garLoopResultBuilder]: For program point L91-1(lines 73 611) no Hoare annotation was computed. [2021-08-25 20:13:54,579 INFO L857 garLoopResultBuilder]: For program point L521(lines 521 525) no Hoare annotation was computed. [2021-08-25 20:13:54,579 INFO L857 garLoopResultBuilder]: For program point L521-2(lines 521 525) no Hoare annotation was computed. [2021-08-25 20:13:54,579 INFO L853 garLoopResultBuilder]: At program point L356(lines 332 374) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)))) [2021-08-25 20:13:54,580 INFO L853 garLoopResultBuilder]: At program point L191(lines 187 552) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse1 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse2 .cse1) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse2 .cse1 .cse3))) [2021-08-25 20:13:54,580 INFO L853 garLoopResultBuilder]: At program point L158(lines 154 563) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)))) [2021-08-25 20:13:54,580 INFO L853 garLoopResultBuilder]: At program point L125(lines 124 573) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (<= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse9))) [2021-08-25 20:13:54,580 INFO L857 garLoopResultBuilder]: For program point L92(lines 92 94) no Hoare annotation was computed. [2021-08-25 20:13:54,580 INFO L857 garLoopResultBuilder]: For program point L423(lines 423 425) no Hoare annotation was computed. [2021-08-25 20:13:54,580 INFO L853 garLoopResultBuilder]: At program point L390(lines 381 413) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)))) [2021-08-25 20:13:54,580 INFO L857 garLoopResultBuilder]: For program point L291(lines 291 293) no Hoare annotation was computed. [2021-08-25 20:13:54,581 INFO L857 garLoopResultBuilder]: For program point L291-2(lines 209 543) no Hoare annotation was computed. [2021-08-25 20:13:54,581 INFO L860 garLoopResultBuilder]: At program point L622(lines 613 624) the Hoare annotation is: true [2021-08-25 20:13:54,581 INFO L857 garLoopResultBuilder]: For program point L358(lines 358 360) no Hoare annotation was computed. [2021-08-25 20:13:54,581 INFO L857 garLoopResultBuilder]: For program point L193(lines 193 550) no Hoare annotation was computed. [2021-08-25 20:13:54,581 INFO L857 garLoopResultBuilder]: For program point L160(lines 160 561) no Hoare annotation was computed. [2021-08-25 20:13:54,581 INFO L857 garLoopResultBuilder]: For program point L127(lines 127 572) no Hoare annotation was computed. [2021-08-25 20:13:54,581 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-25 20:13:54,581 INFO L857 garLoopResultBuilder]: For program point L590(lines 590 594) no Hoare annotation was computed. [2021-08-25 20:13:54,582 INFO L857 garLoopResultBuilder]: For program point L326(lines 326 330) no Hoare annotation was computed. [2021-08-25 20:13:54,582 INFO L857 garLoopResultBuilder]: For program point L260(lines 260 262) no Hoare annotation was computed. [2021-08-25 20:13:54,582 INFO L857 garLoopResultBuilder]: For program point L326-2(lines 209 543) no Hoare annotation was computed. [2021-08-25 20:13:54,582 INFO L857 garLoopResultBuilder]: For program point L227(lines 227 238) no Hoare annotation was computed. [2021-08-25 20:13:54,582 INFO L857 garLoopResultBuilder]: For program point L227-2(lines 209 543) no Hoare annotation was computed. [2021-08-25 20:13:54,582 INFO L857 garLoopResultBuilder]: For program point L393(lines 393 411) no Hoare annotation was computed. [2021-08-25 20:13:54,582 INFO L857 garLoopResultBuilder]: For program point L493(lines 493 496) no Hoare annotation was computed. [2021-08-25 20:13:54,582 INFO L857 garLoopResultBuilder]: For program point L394(lines 394 400) no Hoare annotation was computed. [2021-08-25 20:13:54,583 INFO L857 garLoopResultBuilder]: For program point L229(lines 229 232) no Hoare annotation was computed. [2021-08-25 20:13:54,583 INFO L857 garLoopResultBuilder]: For program point L196(lines 196 549) no Hoare annotation was computed. [2021-08-25 20:13:54,583 INFO L857 garLoopResultBuilder]: For program point L163(lines 163 560) no Hoare annotation was computed. [2021-08-25 20:13:54,583 INFO L857 garLoopResultBuilder]: For program point L130(lines 130 571) no Hoare annotation was computed. [2021-08-25 20:13:54,583 INFO L853 garLoopResultBuilder]: At program point L197(lines 193 550) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse2 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2 .cse3) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse4 .cse2) (and .cse0 .cse1 .cse4 .cse2 .cse3))) [2021-08-25 20:13:54,583 INFO L853 garLoopResultBuilder]: At program point L164(lines 160 561) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3))) [2021-08-25 20:13:54,583 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-25 20:13:54,584 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 609) no Hoare annotation was computed. [2021-08-25 20:13:54,584 INFO L857 garLoopResultBuilder]: For program point L462(lines 462 464) no Hoare annotation was computed. [2021-08-25 20:13:54,584 INFO L857 garLoopResultBuilder]: For program point L298(lines 298 302) no Hoare annotation was computed. [2021-08-25 20:13:54,584 INFO L857 garLoopResultBuilder]: For program point L298-2(lines 298 302) no Hoare annotation was computed. [2021-08-25 20:13:54,584 INFO L857 garLoopResultBuilder]: For program point L199(lines 199 548) no Hoare annotation was computed. [2021-08-25 20:13:54,584 INFO L857 garLoopResultBuilder]: For program point L166(lines 166 559) no Hoare annotation was computed. [2021-08-25 20:13:54,584 INFO L857 garLoopResultBuilder]: For program point L133(lines 133 570) no Hoare annotation was computed. [2021-08-25 20:13:54,585 INFO L853 garLoopResultBuilder]: At program point L100-2(lines 100 599) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse17 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (let ((.cse18 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse23 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse26 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse19 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse21 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse9 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (not .cse0)) (.cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse28 (not .cse17)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse30 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse12 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse14 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse20 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse29 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse16 (not .cse1)) (.cse6 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse2) (and (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse1 .cse2) (and .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse5 .cse2) (and .cse7 .cse3 .cse4 .cse6) (and .cse10 .cse11 .cse8 .cse12 .cse13 .cse14) (and .cse8 .cse15 .cse16 .cse9) (and .cse1 .cse2 .cse17) (and .cse2 .cse18) (and .cse3 .cse4 .cse6 .cse14) (and .cse19 .cse5 .cse14) (and .cse15 .cse18) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse20 .cse21 .cse22) (and .cse23 .cse24 .cse19 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse11 .cse25 .cse7 .cse13 .cse26 .cse21) (and (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse1 .cse2) (and .cse8 .cse9 .cse5 .cse2) (and .cse23 .cse24 .cse19 .cse11 .cse25 .cse13 .cse26 .cse21 .cse14) (and .cse10 .cse11 .cse27 .cse7 .cse8 .cse28 .cse12 .cse13) (and .cse8 .cse9 .cse14) (and .cse19 .cse7 .cse5) (and .cse20 .cse3 .cse4 .cse29 .cse5 .cse6) (and .cse19 .cse1 .cse5 .cse2) (and .cse15 .cse16 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse21 .cse22) (and .cse1 .cse30 .cse5 .cse2) (and .cse8 .cse16 .cse9 .cse2) (and .cse11 .cse27 .cse7 .cse8 .cse30 .cse28 .cse12 .cse13) (and .cse11 .cse8 .cse30 .cse12 .cse13 .cse14) (and .cse20 .cse3 .cse4 .cse15 .cse16 .cse6) (and .cse3 .cse4 .cse16 .cse6 .cse2) (and .cse20 .cse3 .cse4 .cse29 .cse16 .cse6)))) [2021-08-25 20:13:54,585 INFO L857 garLoopResultBuilder]: For program point L431-1(lines 431 439) no Hoare annotation was computed. [2021-08-25 20:13:54,585 INFO L857 garLoopResultBuilder]: For program point L233(lines 233 236) no Hoare annotation was computed. [2021-08-25 20:13:54,585 INFO L853 garLoopResultBuilder]: At program point L167(lines 166 559) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) (not .cse0) (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse2 .cse3) (and .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3))) [2021-08-25 20:13:54,585 INFO L853 garLoopResultBuilder]: At program point L134(lines 127 572) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse10))) [2021-08-25 20:13:54,585 INFO L857 garLoopResultBuilder]: For program point L101(line 101) no Hoare annotation was computed. [2021-08-25 20:13:54,589 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:13:54,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:13:54 BoogieIcfgContainer [2021-08-25 20:13:54,618 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:13:54,618 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:13:54,618 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:13:54,618 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:13:54,619 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:13:16" (3/4) ... [2021-08-25 20:13:54,621 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-25 20:13:54,635 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-08-25 20:13:54,635 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-25 20:13:54,636 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 20:13:54,637 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 20:13:54,721 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:13:54,722 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:13:54,723 INFO L168 Benchmark]: Toolchain (without parser) took 39315.39 ms. Allocated memory was 58.7 MB in the beginning and 683.7 MB in the end (delta: 625.0 MB). Free memory was 37.3 MB in the beginning and 416.9 MB in the end (delta: -379.6 MB). Peak memory consumption was 245.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:54,723 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 58.7 MB. Free memory was 41.2 MB in the beginning and 41.1 MB in the end (delta: 43.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:13:54,724 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.21 ms. Allocated memory is still 58.7 MB. Free memory was 37.1 MB in the beginning and 38.8 MB in the end (delta: -1.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:54,724 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.28 ms. Allocated memory is still 58.7 MB. Free memory was 38.8 MB in the beginning and 36.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:54,724 INFO L168 Benchmark]: Boogie Preprocessor took 28.00 ms. Allocated memory is still 58.7 MB. Free memory was 36.0 MB in the beginning and 33.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:54,725 INFO L168 Benchmark]: RCFGBuilder took 972.56 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 33.9 MB in the beginning and 48.2 MB in the end (delta: -14.3 MB). Peak memory consumption was 20.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:54,728 INFO L168 Benchmark]: TraceAbstraction took 37737.77 ms. Allocated memory was 71.3 MB in the beginning and 683.7 MB in the end (delta: 612.4 MB). Free memory was 47.5 MB in the beginning and 429.5 MB in the end (delta: -382.0 MB). Peak memory consumption was 435.8 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:54,728 INFO L168 Benchmark]: Witness Printer took 103.72 ms. Allocated memory is still 683.7 MB. Free memory was 429.5 MB in the beginning and 416.9 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:54,729 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.23 ms. Allocated memory is still 58.7 MB. Free memory was 41.2 MB in the beginning and 41.1 MB in the end (delta: 43.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 406.21 ms. Allocated memory is still 58.7 MB. Free memory was 37.1 MB in the beginning and 38.8 MB in the end (delta: -1.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 59.28 ms. Allocated memory is still 58.7 MB. Free memory was 38.8 MB in the beginning and 36.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 28.00 ms. Allocated memory is still 58.7 MB. Free memory was 36.0 MB in the beginning and 33.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 972.56 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 33.9 MB in the beginning and 48.2 MB in the end (delta: -14.3 MB). Peak memory consumption was 20.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 37737.77 ms. Allocated memory was 71.3 MB in the beginning and 683.7 MB in the end (delta: 612.4 MB). Free memory was 47.5 MB in the beginning and 429.5 MB in the end (delta: -382.0 MB). Peak memory consumption was 435.8 MB. Max. memory is 16.1 GB. * Witness Printer took 103.72 ms. Allocated memory is still 683.7 MB. Free memory was 429.5 MB in the beginning and 416.9 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 609]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37661.5ms, OverallIterations: 39, TraceHistogramMax: 24, EmptinessCheckTime: 162.1ms, AutomataDifference: 7276.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 12403.5ms, InitialAbstractionConstructionTime: 10.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7382 SDtfs, 4553 SDslu, 3427 SDs, 0 SdLazy, 3933 SolverSat, 1076 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3597.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3121 GetRequests, 3066 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 161.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5055occurred in iteration=30, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1969.5ms AutomataMinimizationTime, 39 MinimizatonAttempts, 6779 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 260 NumberOfFragments, 2609 HoareAnnotationTreeSize, 28 FomulaSimplifications, 417097 FormulaSimplificationTreeSizeReduction, 2065.1ms HoareSimplificationTime, 28 FomulaSimplificationsInter, 120232 FormulaSimplificationTreeSizeReductionInter, 10312.2ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 316.2ms SsaConstructionTime, 1043.4ms SatisfiabilityAnalysisTime, 9007.8ms InterpolantComputationTime, 11577 NumberOfCodeBlocks, 11577 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 11530 ConstructedInterpolants, 0 QuantifiedInterpolants, 15349 SizeOfPredicates, 4 NumberOfNonLiveVariables, 5044 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 47 InterpolantComputations, 35 PerfectInterpolantSequences, 44574/44754 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && blastFlag == 1) || ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && blastFlag <= 2)) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((s__state == 8544 && s__hit == 0) && blastFlag <= 2) || ((((s__state <= 8672 && !(s__state == 8657)) && s__s3__tmp__next_state___0 <= 8576) && 8656 <= s__state) && blastFlag <= 2)) || ((s__state == 8512 && s__hit == 0) && blastFlag <= 2)) || ((blastFlag == 0 && s__state <= 8640) && 8640 <= s__state)) || (((s__state == 8592 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 2)) || (((blastFlag == 0 && s__state <= 8672) && !(s__state == 8657)) && 8656 <= s__state)) || (((((s__state == 8592 && !(s__state == 8561)) && s__state <= 8640) && 8512 <= s__state) && !(s__state == 8545)) && blastFlag == 1)) || (((s__state <= 8640 && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8640 <= s__state)) || ((s__hit == 0 && blastFlag <= 2) && 8560 == s__state)) || (blastFlag <= 2 && s__state <= 3)) || (((s__state <= 8672 && !(s__state == 8657)) && 8656 <= s__state) && blastFlag == 1)) || ((s__state <= 8576 && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 1)) || (s__s3__tmp__next_state___0 <= 8640 && s__state <= 3)) || ((((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && blastFlag == 0) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state)) || ((s__state == 8528 && s__hit == 0) && blastFlag <= 2)) || (((s__state <= 8640 && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 2)) || ((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1)) || (((((((s__state == 8592 && !(s__state == 8561)) && !(s__state == 8544)) && blastFlag == 0) && s__state <= 8640) && !(8560 == s__state)) && 8512 <= s__state) && !(s__state == 8545))) || ((s__state <= 8640 && 8640 <= s__state) && blastFlag == 1)) || ((s__state <= 8576 && blastFlag == 0) && s__s3__tmp__next_state___0 <= 8576)) || (((((blastFlag <= 3 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && 8656 <= s__state)) || (((s__state <= 8576 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 2)) || ((((s__s3__tmp__next_state___0 <= 8640 && !(s__hit == 0)) && 8640 <= s__s3__tmp__next_state___0) && 8448 <= s__state) && s__state <= 8448)) || (((s__hit == 0 && s__state == 8608) && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 2)) || (((s__state <= 8640 && !(s__hit == 0)) && 8640 <= s__state) && blastFlag <= 2)) || (((((((!(s__state == 8561) && !(s__state == 8544)) && blastFlag == 0) && s__state <= 8640) && s__state == 8608) && !(8560 == s__state)) && 8512 <= s__state) && !(s__state == 8545))) || (((((!(s__state == 8561) && s__state <= 8640) && s__state == 8608) && 8512 <= s__state) && !(s__state == 8545)) && blastFlag == 1)) || (((((blastFlag <= 3 && s__state <= 8672) && !(s__state == 8657)) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8656 <= s__state)) || ((((s__state <= 8672 && !(s__state == 8657)) && !(s__hit == 0)) && 8656 <= s__state) && blastFlag <= 2)) || (((((blastFlag <= 3 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8656)) && !(s__hit == 0)) && 8656 <= s__state) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((!(s__state == 8672) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) && 8656 <= s__state) && blastFlag <= 2) || (((!(s__state == 8672) && blastFlag == 0) && s__state <= 8672) && 8656 <= s__state)) || (((!(s__state == 8672) && s__state <= 8672) && 8656 <= s__state) && blastFlag == 1)) || (((((!(s__state == 8672) && blastFlag <= 3) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8656 <= s__state)) || ((((!(s__state == 8672) && s__state <= 8672) && !(s__hit == 0)) && 8656 <= s__state) && blastFlag <= 2) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: (((((blastFlag == 0 && s__state <= 8640) && 8640 <= s__state) || (((s__state <= 8640 && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8640 <= s__state)) || (((s__state <= 8640 && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 2)) || ((s__state <= 8640 && 8640 <= s__state) && blastFlag == 1)) || (((s__state <= 8640 && !(s__hit == 0)) && 8640 <= s__state) && blastFlag <= 2) - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: ((((((s__state <= 8576 && !(s__state == 8561)) && s__hit == 0) && !(8560 == s__state)) && 8512 <= s__state) && blastFlag <= 2) || ((((s__state <= 8576 && !(s__state == 8561)) && blastFlag == 0) && !(8560 == s__state)) && 8512 <= s__state)) || ((((s__state <= 8576 && !(s__state == 8561)) && !(8560 == s__state)) && 8512 <= s__state) && blastFlag == 1) - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: ((((((((((!(8497 == s__state) && 8480 <= s__state) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && blastFlag == 0) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) || ((((((((((!(8497 == s__state) && 8480 <= s__state) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 2)) || (((((((((!(8497 == s__state) && 8480 <= s__state) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 1) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: (((((s__state <= 8576 && !(s__state == 8544)) && 8512 <= s__state) && !(s__state == 8545)) && blastFlag == 1) || (((((s__state <= 8576 && !(s__state == 8544)) && s__hit == 0) && 8512 <= s__state) && !(s__state == 8545)) && blastFlag <= 2)) || ((((s__state <= 8576 && !(s__state == 8544)) && blastFlag == 0) && 8512 <= s__state) && !(s__state == 8545)) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((((((((!(8497 == s__state) && 8480 <= s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && blastFlag <= 2) || ((((((((((!(8497 == s__state) && 8480 <= s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__state <= 8640) && !(8560 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8545)) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state)) || (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && blastFlag <= 2) && 8448 <= s__state) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: ((((((s__state <= 8576 && !(s__state == 8561)) && s__hit == 0) && !(8560 == s__state)) && 8512 <= s__state) && blastFlag <= 2) || ((((s__state <= 8576 && !(s__state == 8561)) && blastFlag == 0) && !(8560 == s__state)) && 8512 <= s__state)) || ((((s__state <= 8576 && !(s__state == 8561)) && !(8560 == s__state)) && 8512 <= s__state) && blastFlag == 1) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((((((((s__state <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && s__hit == 0) && !(8560 == s__state)) && 8512 <= s__state) && !(s__state == 8545)) && blastFlag <= 2) || ((((((s__state <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && blastFlag == 0) && !(8560 == s__state)) && 8512 <= s__state) && !(s__state == 8545))) || ((((((s__state <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && !(8560 == s__state)) && 8512 <= s__state) && !(s__state == 8545)) && blastFlag == 1) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((((((s__hit == 0 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 2) && 8448 <= s__state) && s__state <= 8448) || ((((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((blastFlag == 0 && s__s3__tmp__next_state___0 <= 8576) && 8448 <= s__state) && s__state <= 8448)) || ((((s__s3__tmp__next_state___0 <= 8640 && !(s__hit == 0)) && 8640 <= s__s3__tmp__next_state___0) && 8448 <= s__state) && s__state <= 8448)) || (((s__s3__tmp__next_state___0 <= 8576 && 8448 <= s__state) && blastFlag == 1) && s__state <= 8448) - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ((((((((s__state <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && s__hit == 0) && !(8560 == s__state)) && 8512 <= s__state) && !(s__state == 8545)) && blastFlag <= 2) || ((((((s__state <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && blastFlag == 0) && !(8560 == s__state)) && 8512 <= s__state) && !(s__state == 8545))) || ((((((s__state <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && !(8560 == s__state)) && 8512 <= s__state) && !(s__state == 8545)) && blastFlag == 1) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((((((((8480 <= s__state && !(s__state == 8480)) && s__state <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(8560 == s__state)) && !(s__state == 8545)) && blastFlag == 1) || (((((((((8480 <= s__state && !(s__state == 8480)) && s__state <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576)) || ((((((((((8480 <= s__state && !(s__state == 8480)) && s__state <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 2) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: (((((((!(s__state == 8561) && !(s__state == 8544)) && blastFlag == 0) && s__state <= 8640) && !(8560 == s__state)) && 8512 <= s__state) && !(s__state == 8545)) || ((((((!(s__state == 8561) && !(s__state == 8544)) && s__state <= 8640) && !(8560 == s__state)) && 8512 <= s__state) && !(s__state == 8545)) && blastFlag == 1)) || ((((((((!(s__state == 8561) && !(s__state == 8544)) && s__hit == 0) && s__state <= 8640) && !(8560 == s__state)) && 8512 <= s__state) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 2) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: (((((((!(s__state == 8561) && !(s__state == 8544)) && blastFlag == 0) && s__state <= 8640) && !(8560 == s__state)) && 8512 <= s__state) && !(s__state == 8545)) || ((((((!(s__state == 8561) && !(s__state == 8544)) && s__state <= 8640) && !(8560 == s__state)) && 8512 <= s__state) && !(s__state == 8545)) && blastFlag == 1)) || ((((((((!(s__state == 8561) && !(s__state == 8544)) && s__hit == 0) && s__state <= 8640) && !(8560 == s__state)) && 8512 <= s__state) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 2) - InvariantResult [Line: 381]: Loop Invariant Derived loop invariant: ((((((s__state <= 8576 && !(s__state == 8561)) && s__hit == 0) && !(8560 == s__state)) && 8512 <= s__state) && blastFlag <= 2) || ((((s__state <= 8576 && !(s__state == 8561)) && blastFlag == 0) && !(8560 == s__state)) && 8512 <= s__state)) || ((((s__state <= 8576 && !(s__state == 8561)) && !(8560 == s__state)) && 8512 <= s__state) && blastFlag == 1) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: ((((((!(s__state == 8657) && !(s__state == 8656)) && !(12292 == s__state)) && 8656 <= s__state) && blastFlag == 1) || (((((blastFlag <= 3 && !(s__state == 8657)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && 8656 <= s__state)) || ((((blastFlag == 0 && !(s__state == 8657)) && !(s__state == 8656)) && !(12292 == s__state)) && 8656 <= s__state)) || (((((blastFlag <= 3 && !(s__state == 8657)) && !(s__state == 8656)) && !(12292 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && 8656 <= s__state) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((blastFlag == 0 && s__state == 8608) || (s__state == 8608 && blastFlag == 1)) || (((s__hit == 0 && s__state == 8608) && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 2) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((((((s__state <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && s__hit == 0) && !(8560 == s__state)) && 8512 <= s__state) && !(s__state == 8545)) && blastFlag <= 2) || ((((((s__state <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && blastFlag == 0) && !(8560 == s__state)) && 8512 <= s__state) && !(s__state == 8545))) || ((((((s__state <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && !(8560 == s__state)) && 8512 <= s__state) && !(s__state == 8545)) && blastFlag == 1) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((s__state == 8544 && s__hit == 0) && blastFlag <= 2) || ((((s__state <= 8672 && !(s__state == 8657)) && s__s3__tmp__next_state___0 <= 8576) && 8656 <= s__state) && blastFlag <= 2)) || ((s__state == 8512 && s__hit == 0) && blastFlag <= 2)) || ((blastFlag == 0 && s__state <= 8640) && 8640 <= s__state)) || (((s__state == 8592 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 2)) || (((blastFlag == 0 && s__state <= 8672) && !(s__state == 8657)) && 8656 <= s__state)) || (((((s__state == 8592 && !(s__state == 8561)) && s__state <= 8640) && 8512 <= s__state) && !(s__state == 8545)) && blastFlag == 1)) || (((s__state <= 8640 && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8640 <= s__state)) || ((s__hit == 0 && blastFlag <= 2) && 8560 == s__state)) || (blastFlag <= 2 && s__state <= 3)) || (((s__state <= 8672 && !(s__state == 8657)) && 8656 <= s__state) && blastFlag == 1)) || ((s__state <= 8576 && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 1)) || (s__s3__tmp__next_state___0 <= 8640 && s__state <= 3)) || ((((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && blastFlag == 0) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state)) || ((s__state == 8528 && s__hit == 0) && blastFlag <= 2)) || (((s__state <= 8640 && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 2)) || ((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1)) || (((((((s__state == 8592 && !(s__state == 8561)) && !(s__state == 8544)) && blastFlag == 0) && s__state <= 8640) && !(8560 == s__state)) && 8512 <= s__state) && !(s__state == 8545))) || ((s__state <= 8640 && 8640 <= s__state) && blastFlag == 1)) || ((s__state <= 8576 && blastFlag == 0) && s__s3__tmp__next_state___0 <= 8576)) || (((((blastFlag <= 3 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && 8656 <= s__state)) || (((s__state <= 8576 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 2)) || ((((s__s3__tmp__next_state___0 <= 8640 && !(s__hit == 0)) && 8640 <= s__s3__tmp__next_state___0) && 8448 <= s__state) && s__state <= 8448)) || (((s__hit == 0 && s__state == 8608) && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 2)) || (((s__state <= 8640 && !(s__hit == 0)) && 8640 <= s__state) && blastFlag <= 2)) || (((((((!(s__state == 8561) && !(s__state == 8544)) && blastFlag == 0) && s__state <= 8640) && s__state == 8608) && !(8560 == s__state)) && 8512 <= s__state) && !(s__state == 8545))) || (((((!(s__state == 8561) && s__state <= 8640) && s__state == 8608) && 8512 <= s__state) && !(s__state == 8545)) && blastFlag == 1)) || (((((blastFlag <= 3 && s__state <= 8672) && !(s__state == 8657)) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8656 <= s__state)) || ((((s__state <= 8672 && !(s__state == 8657)) && !(s__hit == 0)) && 8656 <= s__state) && blastFlag <= 2)) || (((((blastFlag <= 3 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8656)) && !(s__hit == 0)) && 8656 <= s__state) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8672) RESULT: Ultimate proved your program to be correct! [2021-08-25 20:13:54,787 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...