/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 00:50:06,662 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 00:50:06,664 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 00:50:06,688 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 00:50:06,688 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 00:50:06,689 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 00:50:06,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 00:50:06,692 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 00:50:06,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 00:50:06,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 00:50:06,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 00:50:06,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 00:50:06,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 00:50:06,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 00:50:06,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 00:50:06,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 00:50:06,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 00:50:06,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 00:50:06,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 00:50:06,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 00:50:06,704 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 00:50:06,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 00:50:06,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 00:50:06,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 00:50:06,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 00:50:06,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 00:50:06,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 00:50:06,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 00:50:06,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 00:50:06,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 00:50:06,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 00:50:06,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 00:50:06,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 00:50:06,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 00:50:06,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 00:50:06,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 00:50:06,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 00:50:06,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 00:50:06,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 00:50:06,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 00:50:06,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 00:50:06,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 00:50:06,734 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-07 00:50:06,742 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 00:50:06,742 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 00:50:06,745 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 00:50:06,745 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 00:50:06,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 00:50:06,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 00:50:06,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 00:50:06,745 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 00:50:06,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 00:50:06,746 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 00:50:06,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 00:50:06,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 00:50:06,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 00:50:06,746 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 00:50:06,746 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 00:50:06,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 00:50:06,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 00:50:06,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-07 00:50:06,747 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-07 00:50:06,747 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-07 00:50:06,747 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 00:50:06,747 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-07 00:50:06,747 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 00:50:06,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 00:50:07,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 00:50:07,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 00:50:07,012 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 00:50:07,015 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 00:50:07,016 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c [2022-04-07 00:50:07,074 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2501df5f1/712118c159284d3491810f00827e1acd/FLAGbee7ec9d1 [2022-04-07 00:50:07,462 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 00:50:07,462 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c [2022-04-07 00:50:07,469 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2501df5f1/712118c159284d3491810f00827e1acd/FLAGbee7ec9d1 [2022-04-07 00:50:07,845 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2501df5f1/712118c159284d3491810f00827e1acd [2022-04-07 00:50:07,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 00:50:07,849 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 00:50:07,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 00:50:07,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 00:50:07,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 00:50:07,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:50:07" (1/1) ... [2022-04-07 00:50:07,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@435e118c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:07, skipping insertion in model container [2022-04-07 00:50:07,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:50:07" (1/1) ... [2022-04-07 00:50:07,866 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 00:50:07,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 00:50:08,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c[14184,14197] [2022-04-07 00:50:08,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 00:50:08,063 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 00:50:08,082 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c[14184,14197] [2022-04-07 00:50:08,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 00:50:08,096 INFO L208 MainTranslator]: Completed translation [2022-04-07 00:50:08,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:08 WrapperNode [2022-04-07 00:50:08,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 00:50:08,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 00:50:08,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 00:50:08,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 00:50:08,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:08" (1/1) ... [2022-04-07 00:50:08,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:08" (1/1) ... [2022-04-07 00:50:08,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:08" (1/1) ... [2022-04-07 00:50:08,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:08" (1/1) ... [2022-04-07 00:50:08,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:08" (1/1) ... [2022-04-07 00:50:08,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:08" (1/1) ... [2022-04-07 00:50:08,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:08" (1/1) ... [2022-04-07 00:50:08,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 00:50:08,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 00:50:08,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 00:50:08,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 00:50:08,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:08" (1/1) ... [2022-04-07 00:50:08,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 00:50:08,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:50:08,181 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 00:50:08,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 00:50:08,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 00:50:08,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 00:50:08,221 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 00:50:08,221 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 00:50:08,222 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 00:50:08,222 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 00:50:08,222 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 00:50:08,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 00:50:08,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-07 00:50:08,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 00:50:08,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-07 00:50:08,223 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 00:50:08,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 00:50:08,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 00:50:08,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 00:50:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 00:50:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 00:50:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 00:50:08,289 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 00:50:08,291 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 00:50:08,509 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 00:50:08,515 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 00:50:08,515 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 00:50:08,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:50:08 BoogieIcfgContainer [2022-04-07 00:50:08,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 00:50:08,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 00:50:08,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 00:50:08,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 00:50:08,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 12:50:07" (1/3) ... [2022-04-07 00:50:08,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40131c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:50:08, skipping insertion in model container [2022-04-07 00:50:08,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:08" (2/3) ... [2022-04-07 00:50:08,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40131c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:50:08, skipping insertion in model container [2022-04-07 00:50:08,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:50:08" (3/3) ... [2022-04-07 00:50:08,525 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2022-04-07 00:50:08,529 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-07 00:50:08,529 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 00:50:08,563 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 00:50:08,569 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-07 00:50:08,570 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 00:50:08,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 46 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 00:50:08,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-07 00:50:08,590 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:08,590 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:08,591 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:08,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:08,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1713790110, now seen corresponding path program 1 times [2022-04-07 00:50:08,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:08,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2140259414] [2022-04-07 00:50:08,613 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:50:08,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1713790110, now seen corresponding path program 2 times [2022-04-07 00:50:08,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:08,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82581658] [2022-04-07 00:50:08,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:08,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:08,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:08,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:50:08,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:08,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82581658] [2022-04-07 00:50:08,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82581658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:08,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:08,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:08,775 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:08,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2140259414] [2022-04-07 00:50:08,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2140259414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:08,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:08,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:08,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502416274] [2022-04-07 00:50:08,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:08,780 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:08,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:08,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:08,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:08,805 INFO L87 Difference]: Start difference. First operand has 51 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 46 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:09,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:09,048 INFO L93 Difference]: Finished difference Result 136 states and 224 transitions. [2022-04-07 00:50:09,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:09,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-07 00:50:09,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:09,064 INFO L225 Difference]: With dead ends: 136 [2022-04-07 00:50:09,065 INFO L226 Difference]: Without dead ends: 83 [2022-04-07 00:50:09,067 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:50:09,070 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 187 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:09,071 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 79 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:09,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-07 00:50:09,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-07 00:50:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 79 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:09,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2022-04-07 00:50:09,111 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 9 [2022-04-07 00:50:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:09,112 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2022-04-07 00:50:09,112 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2022-04-07 00:50:09,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 00:50:09,113 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:09,113 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:09,113 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 00:50:09,113 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:09,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:09,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1144534844, now seen corresponding path program 1 times [2022-04-07 00:50:09,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:09,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [878251711] [2022-04-07 00:50:09,129 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:09,129 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:09,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1144534844, now seen corresponding path program 2 times [2022-04-07 00:50:09,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:09,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147573968] [2022-04-07 00:50:09,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:09,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:09,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:09,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:50:09,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:09,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147573968] [2022-04-07 00:50:09,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147573968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:09,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:09,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:09,186 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:09,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [878251711] [2022-04-07 00:50:09,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [878251711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:09,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:09,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:09,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880583084] [2022-04-07 00:50:09,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:09,188 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:09,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:09,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:09,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:09,189 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:09,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:09,317 INFO L93 Difference]: Finished difference Result 160 states and 250 transitions. [2022-04-07 00:50:09,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:09,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 00:50:09,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:09,320 INFO L225 Difference]: With dead ends: 160 [2022-04-07 00:50:09,320 INFO L226 Difference]: Without dead ends: 120 [2022-04-07 00:50:09,321 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:50:09,322 INFO L913 BasicCegarLoop]: 114 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:09,322 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 121 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:50:09,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-07 00:50:09,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-04-07 00:50:09,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 116 states have (on average 1.5172413793103448) internal successors, (176), 116 states have internal predecessors, (176), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 179 transitions. [2022-04-07 00:50:09,345 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 179 transitions. Word has length 14 [2022-04-07 00:50:09,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:09,346 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 179 transitions. [2022-04-07 00:50:09,346 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:09,346 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions. [2022-04-07 00:50:09,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 00:50:09,347 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:09,347 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:09,347 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 00:50:09,348 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:09,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:09,348 INFO L85 PathProgramCache]: Analyzing trace with hash -974235404, now seen corresponding path program 1 times [2022-04-07 00:50:09,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:09,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1119768411] [2022-04-07 00:50:09,352 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:09,352 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:09,352 INFO L85 PathProgramCache]: Analyzing trace with hash -974235404, now seen corresponding path program 2 times [2022-04-07 00:50:09,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:09,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89669529] [2022-04-07 00:50:09,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:09,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:09,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-07 00:50:09,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:09,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89669529] [2022-04-07 00:50:09,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89669529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:09,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:09,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:09,441 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:09,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1119768411] [2022-04-07 00:50:09,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1119768411] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:09,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:09,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:09,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440559167] [2022-04-07 00:50:09,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:09,443 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:09,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:09,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:09,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:09,445 INFO L87 Difference]: Start difference. First operand 120 states and 179 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:09,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:09,575 INFO L93 Difference]: Finished difference Result 234 states and 359 transitions. [2022-04-07 00:50:09,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:09,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-07 00:50:09,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:09,579 INFO L225 Difference]: With dead ends: 234 [2022-04-07 00:50:09,579 INFO L226 Difference]: Without dead ends: 157 [2022-04-07 00:50:09,580 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:50:09,581 INFO L913 BasicCegarLoop]: 117 mSDtfsCounter, 117 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:09,582 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 124 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:50:09,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-07 00:50:09,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-04-07 00:50:09,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 153 states have (on average 1.5098039215686274) internal successors, (231), 153 states have internal predecessors, (231), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:09,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 234 transitions. [2022-04-07 00:50:09,616 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 234 transitions. Word has length 20 [2022-04-07 00:50:09,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:09,616 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 234 transitions. [2022-04-07 00:50:09,616 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:09,617 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 234 transitions. [2022-04-07 00:50:09,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-07 00:50:09,630 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:09,630 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:09,630 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 00:50:09,630 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:09,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:09,631 INFO L85 PathProgramCache]: Analyzing trace with hash -674137767, now seen corresponding path program 1 times [2022-04-07 00:50:09,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:09,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [833251027] [2022-04-07 00:50:09,635 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:09,635 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:09,636 INFO L85 PathProgramCache]: Analyzing trace with hash -674137767, now seen corresponding path program 2 times [2022-04-07 00:50:09,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:09,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558697648] [2022-04-07 00:50:09,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:09,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:09,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:09,717 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-07 00:50:09,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:09,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558697648] [2022-04-07 00:50:09,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558697648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:09,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:09,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:09,719 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:09,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [833251027] [2022-04-07 00:50:09,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [833251027] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:09,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:09,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:09,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021337579] [2022-04-07 00:50:09,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:09,720 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:09,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:09,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:09,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:09,721 INFO L87 Difference]: Start difference. First operand 157 states and 234 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:09,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:09,829 INFO L93 Difference]: Finished difference Result 325 states and 488 transitions. [2022-04-07 00:50:09,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:09,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-07 00:50:09,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:09,831 INFO L225 Difference]: With dead ends: 325 [2022-04-07 00:50:09,832 INFO L226 Difference]: Without dead ends: 174 [2022-04-07 00:50:09,833 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:50:09,834 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 67 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:09,834 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 79 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:50:09,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-07 00:50:09,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2022-04-07 00:50:09,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 168 states have (on average 1.4702380952380953) internal successors, (247), 168 states have internal predecessors, (247), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:09,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 250 transitions. [2022-04-07 00:50:09,853 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 250 transitions. Word has length 35 [2022-04-07 00:50:09,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:09,853 INFO L478 AbstractCegarLoop]: Abstraction has 172 states and 250 transitions. [2022-04-07 00:50:09,853 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:09,853 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 250 transitions. [2022-04-07 00:50:09,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-07 00:50:09,855 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:09,859 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:09,859 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 00:50:09,859 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:09,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:09,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1014805975, now seen corresponding path program 1 times [2022-04-07 00:50:09,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:09,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1679107194] [2022-04-07 00:50:09,866 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:09,866 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:09,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1014805975, now seen corresponding path program 2 times [2022-04-07 00:50:09,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:09,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041888758] [2022-04-07 00:50:09,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:09,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:09,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:09,944 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-07 00:50:09,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:09,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041888758] [2022-04-07 00:50:09,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041888758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:09,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:09,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:09,945 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:09,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1679107194] [2022-04-07 00:50:09,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1679107194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:09,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:09,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:09,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737138441] [2022-04-07 00:50:09,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:09,947 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:09,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:09,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:09,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:09,948 INFO L87 Difference]: Start difference. First operand 172 states and 250 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:10,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:10,084 INFO L93 Difference]: Finished difference Result 382 states and 571 transitions. [2022-04-07 00:50:10,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:10,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-07 00:50:10,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:10,086 INFO L225 Difference]: With dead ends: 382 [2022-04-07 00:50:10,086 INFO L226 Difference]: Without dead ends: 216 [2022-04-07 00:50:10,089 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:50:10,091 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 83 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:10,093 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 78 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:50:10,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-04-07 00:50:10,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2022-04-07 00:50:10,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 207 states have (on average 1.3816425120772946) internal successors, (286), 207 states have internal predecessors, (286), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 289 transitions. [2022-04-07 00:50:10,139 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 289 transitions. Word has length 35 [2022-04-07 00:50:10,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:10,140 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 289 transitions. [2022-04-07 00:50:10,140 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:10,140 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 289 transitions. [2022-04-07 00:50:10,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-07 00:50:10,141 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:10,142 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:10,142 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 00:50:10,142 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:10,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:10,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1542489334, now seen corresponding path program 1 times [2022-04-07 00:50:10,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:10,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1138351488] [2022-04-07 00:50:10,152 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:10,152 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:10,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1542489334, now seen corresponding path program 2 times [2022-04-07 00:50:10,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:10,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378648214] [2022-04-07 00:50:10,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:10,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:10,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:10,221 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-07 00:50:10,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:10,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378648214] [2022-04-07 00:50:10,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378648214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:10,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:10,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:10,223 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:10,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1138351488] [2022-04-07 00:50:10,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1138351488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:10,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:10,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:10,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723005980] [2022-04-07 00:50:10,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:10,225 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:10,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:10,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:10,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:10,225 INFO L87 Difference]: Start difference. First operand 211 states and 289 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:10,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:10,333 INFO L93 Difference]: Finished difference Result 418 states and 581 transitions. [2022-04-07 00:50:10,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:10,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-07 00:50:10,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:10,337 INFO L225 Difference]: With dead ends: 418 [2022-04-07 00:50:10,337 INFO L226 Difference]: Without dead ends: 268 [2022-04-07 00:50:10,338 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:50:10,340 INFO L913 BasicCegarLoop]: 116 mSDtfsCounter, 107 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:10,341 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 123 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:50:10,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-04-07 00:50:10,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2022-04-07 00:50:10,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 262 states have (on average 1.3778625954198473) internal successors, (361), 262 states have internal predecessors, (361), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:10,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 364 transitions. [2022-04-07 00:50:10,368 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 364 transitions. Word has length 49 [2022-04-07 00:50:10,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:10,369 INFO L478 AbstractCegarLoop]: Abstraction has 266 states and 364 transitions. [2022-04-07 00:50:10,369 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:10,369 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 364 transitions. [2022-04-07 00:50:10,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-07 00:50:10,377 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:10,377 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:10,377 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-07 00:50:10,378 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:10,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:10,378 INFO L85 PathProgramCache]: Analyzing trace with hash 446239409, now seen corresponding path program 1 times [2022-04-07 00:50:10,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:10,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1376059281] [2022-04-07 00:50:10,385 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:10,385 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:10,385 INFO L85 PathProgramCache]: Analyzing trace with hash 446239409, now seen corresponding path program 2 times [2022-04-07 00:50:10,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:10,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684914251] [2022-04-07 00:50:10,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:10,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:10,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-07 00:50:10,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:10,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684914251] [2022-04-07 00:50:10,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684914251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:10,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:10,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:10,445 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:10,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1376059281] [2022-04-07 00:50:10,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1376059281] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:10,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:10,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:10,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697712950] [2022-04-07 00:50:10,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:10,446 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:10,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:10,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:10,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:10,447 INFO L87 Difference]: Start difference. First operand 266 states and 364 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:10,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:10,562 INFO L93 Difference]: Finished difference Result 524 states and 735 transitions. [2022-04-07 00:50:10,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:10,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-07 00:50:10,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:10,563 INFO L225 Difference]: With dead ends: 524 [2022-04-07 00:50:10,564 INFO L226 Difference]: Without dead ends: 186 [2022-04-07 00:50:10,564 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:50:10,565 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 85 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:10,566 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 77 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:50:10,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-07 00:50:10,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2022-04-07 00:50:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.2905027932960893) internal successors, (231), 179 states have internal predecessors, (231), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:10,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 234 transitions. [2022-04-07 00:50:10,584 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 234 transitions. Word has length 52 [2022-04-07 00:50:10,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:10,585 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 234 transitions. [2022-04-07 00:50:10,586 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 234 transitions. [2022-04-07 00:50:10,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-07 00:50:10,589 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:10,589 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:10,589 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-07 00:50:10,590 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:10,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:10,590 INFO L85 PathProgramCache]: Analyzing trace with hash -209652788, now seen corresponding path program 1 times [2022-04-07 00:50:10,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:10,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1145525230] [2022-04-07 00:50:10,603 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:10,603 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:10,603 INFO L85 PathProgramCache]: Analyzing trace with hash -209652788, now seen corresponding path program 2 times [2022-04-07 00:50:10,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:10,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147521064] [2022-04-07 00:50:10,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:10,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:10,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-07 00:50:10,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:10,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147521064] [2022-04-07 00:50:10,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147521064] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:10,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:10,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:10,676 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:10,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1145525230] [2022-04-07 00:50:10,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1145525230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:10,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:10,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:10,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989676654] [2022-04-07 00:50:10,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:10,678 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:10,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:10,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:10,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:10,679 INFO L87 Difference]: Start difference. First operand 183 states and 234 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:10,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:10,756 INFO L93 Difference]: Finished difference Result 275 states and 332 transitions. [2022-04-07 00:50:10,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:10,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-07 00:50:10,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:10,758 INFO L225 Difference]: With dead ends: 275 [2022-04-07 00:50:10,758 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 00:50:10,759 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:50:10,761 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:10,761 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 81 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:50:10,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 00:50:10,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 00:50:10,762 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) [2022-04-07 00:50:10,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 00:50:10,762 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2022-04-07 00:50:10,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:10,763 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 00:50:10,763 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:10,763 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 00:50:10,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 00:50:10,766 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 00:50:10,766 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-07 00:50:10,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 00:50:11,756 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2022-04-07 00:50:11,757 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2022-04-07 00:50:11,757 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2022-04-07 00:50:11,757 INFO L885 garLoopResultBuilder]: At program point L225(lines 20 229) the Hoare annotation is: true [2022-04-07 00:50:11,757 INFO L878 garLoopResultBuilder]: At program point L126(lines 126 130) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-07 00:50:11,757 INFO L878 garLoopResultBuilder]: At program point L60(lines 60 207) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-07 00:50:11,757 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 20 229) the Hoare annotation is: true [2022-04-07 00:50:11,758 INFO L878 garLoopResultBuilder]: At program point L184(lines 184 186) the Hoare annotation is: (let ((.cse0 (<= 8672 main_~s__state~0))) (or (and .cse0 (= main_~blastFlag~0 0)) (and .cse0 (= main_~blastFlag~0 1)) (and (= 3 main_~blastFlag~0) .cse0) (and .cse0 (= 2 main_~blastFlag~0)))) [2022-04-07 00:50:11,758 INFO L878 garLoopResultBuilder]: At program point L118(lines 118 122) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-07 00:50:11,758 INFO L878 garLoopResultBuilder]: At program point L85(lines 84 195) the Hoare annotation is: (let ((.cse0 (<= 8672 main_~s__state~0))) (or (and .cse0 (= main_~blastFlag~0 0)) (and .cse0 (= main_~blastFlag~0 1)) (and (= 3 main_~blastFlag~0) .cse0) (and .cse0 (= 2 main_~blastFlag~0)))) [2022-04-07 00:50:11,758 INFO L878 garLoopResultBuilder]: At program point L52(lines 52 211) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-07 00:50:11,758 INFO L878 garLoopResultBuilder]: At program point L77(lines 76 199) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and (= main_~blastFlag~0 1) .cse0) (and .cse0 (= 2 main_~blastFlag~0)) (and (= 3 main_~blastFlag~0) (not (= main_~s__hit~0 0)) .cse0) (and (= main_~blastFlag~0 0) .cse0))) [2022-04-07 00:50:11,758 INFO L878 garLoopResultBuilder]: At program point L44(lines 44 215) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-07 00:50:11,759 INFO L878 garLoopResultBuilder]: At program point L69(lines 68 203) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-07 00:50:11,759 INFO L878 garLoopResultBuilder]: At program point L61(lines 60 207) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-07 00:50:11,759 INFO L878 garLoopResultBuilder]: At program point L185(lines 20 229) the Hoare annotation is: false [2022-04-07 00:50:11,760 INFO L878 garLoopResultBuilder]: At program point L53(lines 52 211) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-07 00:50:11,760 INFO L878 garLoopResultBuilder]: At program point L45(lines 44 215) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-07 00:50:11,760 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 20 229) the Hoare annotation is: true [2022-04-07 00:50:11,760 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 227) the Hoare annotation is: false [2022-04-07 00:50:11,760 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 20 229) the Hoare annotation is: true [2022-04-07 00:50:11,760 INFO L878 garLoopResultBuilder]: At program point L80(lines 80 197) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-07 00:50:11,760 INFO L878 garLoopResultBuilder]: At program point L72(lines 72 201) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-07 00:50:11,761 INFO L878 garLoopResultBuilder]: At program point L163-1(lines 86 195) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and (= main_~blastFlag~0 1) .cse0) (and .cse0 (= 2 main_~blastFlag~0)) (and (= main_~blastFlag~0 0) .cse0) (and (not (= main_~s__hit~0 0)) .cse0))) [2022-04-07 00:50:11,761 INFO L878 garLoopResultBuilder]: At program point L64(lines 64 205) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-07 00:50:11,761 INFO L878 garLoopResultBuilder]: At program point L97-1(lines 86 195) the Hoare annotation is: (or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-07 00:50:11,761 INFO L878 garLoopResultBuilder]: At program point L188(lines 34 223) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-07 00:50:11,761 INFO L878 garLoopResultBuilder]: At program point L56(lines 56 209) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-07 00:50:11,761 INFO L878 garLoopResultBuilder]: At program point L147(lines 147 151) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-07 00:50:11,761 INFO L878 garLoopResultBuilder]: At program point L81(lines 80 197) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and (= main_~blastFlag~0 1) .cse0) (and .cse0 (= 2 main_~blastFlag~0)) (and (= 3 main_~blastFlag~0) (not (= main_~s__hit~0 0)) .cse0) (and (= main_~blastFlag~0 0) .cse0))) [2022-04-07 00:50:11,761 INFO L878 garLoopResultBuilder]: At program point L48(lines 48 213) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-07 00:50:11,762 INFO L878 garLoopResultBuilder]: At program point L73(lines 72 201) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-07 00:50:11,762 INFO L878 garLoopResultBuilder]: At program point L65(lines 64 205) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-07 00:50:11,762 INFO L878 garLoopResultBuilder]: At program point L57(lines 56 209) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-07 00:50:11,762 INFO L878 garLoopResultBuilder]: At program point L90-1(lines 90 92) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0)) [2022-04-07 00:50:11,763 INFO L878 garLoopResultBuilder]: At program point L181-1(lines 86 195) the Hoare annotation is: (let ((.cse0 (<= 8672 main_~s__state~0))) (or (and .cse0 (= main_~blastFlag~0 0)) (and .cse0 (= main_~blastFlag~0 1)) (and (= 3 main_~blastFlag~0) .cse0) (and .cse0 (= 2 main_~blastFlag~0)))) [2022-04-07 00:50:11,763 INFO L878 garLoopResultBuilder]: At program point L49(lines 48 213) the Hoare annotation is: (let ((.cse0 (= (+ (- 8512) main_~s__state~0) 0))) (or (and (= (+ (- 2) main_~blastFlag~0) 0) .cse0) (and (= (+ (- 1) main_~blastFlag~0) 0) .cse0) (and (= main_~blastFlag~0 0) .cse0))) [2022-04-07 00:50:11,768 INFO L878 garLoopResultBuilder]: At program point L41(lines 41 216) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-07 00:50:11,768 INFO L878 garLoopResultBuilder]: At program point L132(lines 125 134) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-07 00:50:11,768 INFO L878 garLoopResultBuilder]: At program point L124(lines 117 135) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-07 00:50:11,768 INFO L878 garLoopResultBuilder]: At program point L174-1(lines 174 176) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and (= main_~blastFlag~0 1) .cse0) (and (= main_~blastFlag~0 0) .cse0) (and (= 3 main_~blastFlag~0) .cse0))) [2022-04-07 00:50:11,768 INFO L878 garLoopResultBuilder]: At program point L42(lines 41 216) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-07 00:50:11,768 INFO L878 garLoopResultBuilder]: At program point L117(lines 117 135) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-07 00:50:11,769 INFO L878 garLoopResultBuilder]: At program point L84(lines 84 195) the Hoare annotation is: (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and (= 3 main_~blastFlag~0) (<= 8640 main_~s__state~0)) (= 2 main_~blastFlag~0)) [2022-04-07 00:50:11,770 INFO L878 garLoopResultBuilder]: At program point L76(lines 76 199) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-07 00:50:11,770 INFO L878 garLoopResultBuilder]: At program point L68(lines 68 203) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-07 00:50:11,770 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-07 00:50:11,770 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-07 00:50:11,770 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-07 00:50:11,770 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-07 00:50:11,770 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-07 00:50:11,771 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 00:50:11,771 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 00:50:11,771 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-07 00:50:11,774 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2] [2022-04-07 00:50:11,775 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 00:50:11,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 12:50:11 BoogieIcfgContainer [2022-04-07 00:50:11,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 00:50:11,792 INFO L158 Benchmark]: Toolchain (without parser) took 3943.00ms. Allocated memory was 186.6MB in the beginning and 262.1MB in the end (delta: 75.5MB). Free memory was 130.3MB in the beginning and 152.9MB in the end (delta: -22.6MB). Peak memory consumption was 121.0MB. Max. memory is 8.0GB. [2022-04-07 00:50:11,792 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 186.6MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 00:50:11,793 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.79ms. Allocated memory was 186.6MB in the beginning and 262.1MB in the end (delta: 75.5MB). Free memory was 130.1MB in the beginning and 232.8MB in the end (delta: -102.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 00:50:11,793 INFO L158 Benchmark]: Boogie Preprocessor took 25.18ms. Allocated memory is still 262.1MB. Free memory was 232.8MB in the beginning and 231.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 00:50:11,793 INFO L158 Benchmark]: RCFGBuilder took 393.34ms. Allocated memory is still 262.1MB. Free memory was 231.2MB in the beginning and 217.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-07 00:50:11,793 INFO L158 Benchmark]: TraceAbstraction took 3273.27ms. Allocated memory is still 262.1MB. Free memory was 217.2MB in the beginning and 152.9MB in the end (delta: 64.3MB). Peak memory consumption was 132.7MB. Max. memory is 8.0GB. [2022-04-07 00:50:11,794 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 186.6MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 246.79ms. Allocated memory was 186.6MB in the beginning and 262.1MB in the end (delta: 75.5MB). Free memory was 130.1MB in the beginning and 232.8MB in the end (delta: -102.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.18ms. Allocated memory is still 262.1MB. Free memory was 232.8MB in the beginning and 231.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 393.34ms. Allocated memory is still 262.1MB. Free memory was 231.2MB in the beginning and 217.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3273.27ms. Allocated memory is still 262.1MB. Free memory was 217.2MB in the beginning and 152.9MB in the end (delta: 64.3MB). Peak memory consumption was 132.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 227]: 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 4 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 840 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 840 mSDsluCounter, 762 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 560 IncrementalHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 704 mSDtfsCounter, 560 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=266occurred in iteration=6, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 51 LocationsWithAnnotation, 51 PreInvPairs, 317 NumberOfFragments, 853 HoareAnnotationTreeSize, 51 FomulaSimplifications, 508 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 51 FomulaSimplificationsInter, 1057 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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: 117]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: (((blastFlag == 1 && 8640 <= s__state) || (8640 <= s__state && 2 == blastFlag)) || ((3 == blastFlag && !(s__hit == 0)) && 8640 <= s__state)) || (blastFlag == 0 && 8640 <= s__state) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: (((blastFlag == 1 && 8640 <= s__state) || (8640 <= s__state && 2 == blastFlag)) || ((3 == blastFlag && !(s__hit == 0)) && 8640 <= s__state)) || (blastFlag == 0 && 8640 <= s__state) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((blastFlag == 0 || blastFlag == 1) || ((3 == blastFlag && !(s__hit == 0)) && 8640 <= s__state)) || (3 == blastFlag && 8672 <= s__state)) || 2 == blastFlag - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: (((8672 <= s__state && blastFlag == 0) || (8672 <= s__state && blastFlag == 1)) || (3 == blastFlag && 8672 <= s__state)) || (8672 <= s__state && 2 == blastFlag) - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: ((-2 + blastFlag == 0 && -8512 + s__state == 0) || (-1 + blastFlag == 0 && -8512 + s__state == 0)) || (blastFlag == 0 && -8512 + s__state == 0) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - ProcedureContractResult [Line: 20]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-07 00:50:11,838 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...