/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/invert_string-3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05ce600 [2022-02-24 01:12:22,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-24 01:12:22,014 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-24 01:12:22,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-24 01:12:22,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-24 01:12:22,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-24 01:12:22,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-24 01:12:22,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-24 01:12:22,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-24 01:12:22,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-24 01:12:22,064 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-24 01:12:22,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-24 01:12:22,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-24 01:12:22,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-24 01:12:22,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-24 01:12:22,070 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-24 01:12:22,071 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-24 01:12:22,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-24 01:12:22,073 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-24 01:12:22,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-24 01:12:22,077 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-24 01:12:22,078 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-24 01:12:22,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-24 01:12:22,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-24 01:12:22,084 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-24 01:12:22,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-24 01:12:22,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-24 01:12:22,086 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-24 01:12:22,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-24 01:12:22,086 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-24 01:12:22,087 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-24 01:12:22,087 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-24 01:12:22,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-24 01:12:22,089 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-24 01:12:22,090 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-24 01:12:22,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-24 01:12:22,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-24 01:12:22,090 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-24 01:12:22,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-24 01:12:22,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-24 01:12:22,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-24 01:12:22,092 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-02-24 01:12:22,100 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-24 01:12:22,100 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-24 01:12:22,102 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-24 01:12:22,102 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-24 01:12:22,102 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-24 01:12:22,102 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-24 01:12:22,102 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-24 01:12:22,102 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-24 01:12:22,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-24 01:12:22,103 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-24 01:12:22,103 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-24 01:12:22,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-24 01:12:22,103 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-24 01:12:22,104 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-24 01:12:22,104 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-24 01:12:22,104 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-24 01:12:22,104 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-24 01:12:22,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-24 01:12:22,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 01:12:22,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-24 01:12:22,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-02-24 01:12:22,104 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-24 01:12:22,104 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-02-24 01:12:22,105 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-02-24 01:12:22,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-24 01:12:22,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-24 01:12:22,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-24 01:12:22,329 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-24 01:12:22,329 INFO L275 PluginConnector]: CDTParser initialized [2022-02-24 01:12:22,330 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string-3.c [2022-02-24 01:12:22,384 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/091cf9f7a/7c2d56d7967043dfbf6a630c8918c1a1/FLAG8b86f9964 [2022-02-24 01:12:22,774 INFO L306 CDTParser]: Found 1 translation units. [2022-02-24 01:12:22,775 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c [2022-02-24 01:12:22,781 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/091cf9f7a/7c2d56d7967043dfbf6a630c8918c1a1/FLAG8b86f9964 [2022-02-24 01:12:23,194 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/091cf9f7a/7c2d56d7967043dfbf6a630c8918c1a1 [2022-02-24 01:12:23,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-24 01:12:23,217 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-24 01:12:23,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-24 01:12:23,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-24 01:12:23,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-24 01:12:23,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 01:12:23" (1/1) ... [2022-02-24 01:12:23,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bcd42a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:12:23, skipping insertion in model container [2022-02-24 01:12:23,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 01:12:23" (1/1) ... [2022-02-24 01:12:23,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-24 01:12:23,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-24 01:12:23,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c[327,340] [2022-02-24 01:12:23,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 01:12:23,412 INFO L203 MainTranslator]: Completed pre-run [2022-02-24 01:12:23,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c[327,340] [2022-02-24 01:12:23,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 01:12:23,451 INFO L208 MainTranslator]: Completed translation [2022-02-24 01:12:23,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:12:23 WrapperNode [2022-02-24 01:12:23,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-24 01:12:23,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-24 01:12:23,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-24 01:12:23,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-24 01:12:23,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:12:23" (1/1) ... [2022-02-24 01:12:23,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:12:23" (1/1) ... [2022-02-24 01:12:23,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:12:23" (1/1) ... [2022-02-24 01:12:23,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:12:23" (1/1) ... [2022-02-24 01:12:23,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:12:23" (1/1) ... [2022-02-24 01:12:23,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:12:23" (1/1) ... [2022-02-24 01:12:23,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:12:23" (1/1) ... [2022-02-24 01:12:23,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-24 01:12:23,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-24 01:12:23,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-24 01:12:23,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-24 01:12:23,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:12:23" (1/1) ... [2022-02-24 01:12:23,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 01:12:23,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-24 01:12:23,555 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-02-24 01:12:23,576 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-02-24 01:12:23,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-24 01:12:23,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-24 01:12:23,607 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-24 01:12:23,608 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-24 01:12:23,608 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-24 01:12:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-24 01:12:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-24 01:12:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-24 01:12:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-24 01:12:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-24 01:12:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-02-24 01:12:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-24 01:12:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-24 01:12:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-24 01:12:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-24 01:12:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-24 01:12:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-24 01:12:23,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-24 01:12:23,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-24 01:12:23,676 INFO L234 CfgBuilder]: Building ICFG [2022-02-24 01:12:23,677 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-24 01:12:23,771 INFO L275 CfgBuilder]: Performing block encoding [2022-02-24 01:12:23,775 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-24 01:12:23,775 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-24 01:12:23,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 01:12:23 BoogieIcfgContainer [2022-02-24 01:12:23,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-24 01:12:23,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-24 01:12:23,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-24 01:12:23,790 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-24 01:12:23,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.02 01:12:23" (1/3) ... [2022-02-24 01:12:23,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c127112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 01:12:23, skipping insertion in model container [2022-02-24 01:12:23,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:12:23" (2/3) ... [2022-02-24 01:12:23,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c127112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 01:12:23, skipping insertion in model container [2022-02-24 01:12:23,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 01:12:23" (3/3) ... [2022-02-24 01:12:23,793 INFO L111 eAbstractionObserver]: Analyzing ICFG invert_string-3.c [2022-02-24 01:12:23,796 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-02-24 01:12:23,796 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-24 01:12:23,823 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-24 01:12:23,828 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, 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, mLoopAccelerationTechnique=JORDAN [2022-02-24 01:12:23,828 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-24 01:12:23,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-24 01:12:23,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-24 01:12:23,842 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:12:23,842 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:12:23,843 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:12:23,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:12:23,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1728321422, now seen corresponding path program 1 times [2022-02-24 01:12:23,854 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:12:23,854 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2069479024] [2022-02-24 01:12:23,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:12:23,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:12:23,902 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:12:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:24,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:12:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:24,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:12:24,117 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:12:24,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2069479024] [2022-02-24 01:12:24,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2069479024] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:12:24,119 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:12:24,119 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-24 01:12:24,120 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156114963] [2022-02-24 01:12:24,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:12:24,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-24 01:12:24,124 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:12:24,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-24 01:12:24,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-24 01:12:24,146 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:12:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:12:24,310 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-02-24 01:12:24,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-24 01:12:24,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-24 01:12:24,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:12:24,317 INFO L225 Difference]: With dead ends: 48 [2022-02-24 01:12:24,317 INFO L226 Difference]: Without dead ends: 24 [2022-02-24 01:12:24,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-24 01:12:24,321 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 01:12:24,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 35 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 01:12:24,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-24 01:12:24,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-02-24 01:12:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-24 01:12:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-02-24 01:12:24,356 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2022-02-24 01:12:24,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:12:24,357 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-02-24 01:12:24,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:12:24,357 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-02-24 01:12:24,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-24 01:12:24,358 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:12:24,358 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:12:24,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-24 01:12:24,358 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:12:24,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:12:24,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1238871028, now seen corresponding path program 1 times [2022-02-24 01:12:24,359 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:12:24,360 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1825223791] [2022-02-24 01:12:24,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:12:24,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:12:24,377 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-24 01:12:24,378 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-02-24 01:12:24,378 INFO L281 tedInterpolationCore]: Could not accelerate. [2022-02-24 01:12:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:24,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:12:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:24,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:12:24,485 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:12:24,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1825223791] [2022-02-24 01:12:24,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1825223791] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:12:24,485 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:12:24,486 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 01:12:24,486 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236793560] [2022-02-24 01:12:24,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:12:24,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 01:12:24,487 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:12:24,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 01:12:24,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 01:12:24,487 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:12:24,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:12:24,539 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-02-24 01:12:24,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 01:12:24,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-24 01:12:24,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:12:24,541 INFO L225 Difference]: With dead ends: 40 [2022-02-24 01:12:24,541 INFO L226 Difference]: Without dead ends: 25 [2022-02-24 01:12:24,541 INFO L932 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-02-24 01:12:24,542 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 01:12:24,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 28 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 01:12:24,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-24 01:12:24,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-02-24 01:12:24,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-24 01:12:24,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-02-24 01:12:24,567 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2022-02-24 01:12:24,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:12:24,567 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-02-24 01:12:24,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:12:24,568 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-02-24 01:12:24,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-24 01:12:24,568 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:12:24,568 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:12:24,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-24 01:12:24,569 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:12:24,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:12:24,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1304082102, now seen corresponding path program 1 times [2022-02-24 01:12:24,569 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:12:24,570 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1858151062] [2022-02-24 01:12:24,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:12:24,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:12:24,573 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-24 01:12:24,573 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-02-24 01:12:24,573 INFO L281 tedInterpolationCore]: Could not accelerate. [2022-02-24 01:12:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:24,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:12:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:12:24,710 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:12:24,710 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1858151062] [2022-02-24 01:12:24,710 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1858151062] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:12:24,710 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:12:24,710 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 01:12:24,710 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084582158] [2022-02-24 01:12:24,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:12:24,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 01:12:24,711 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:12:24,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 01:12:24,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-24 01:12:24,712 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:12:24,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:12:24,803 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-02-24 01:12:24,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-24 01:12:24,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-24 01:12:24,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:12:24,805 INFO L225 Difference]: With dead ends: 42 [2022-02-24 01:12:24,805 INFO L226 Difference]: Without dead ends: 27 [2022-02-24 01:12:24,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-02-24 01:12:24,811 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 01:12:24,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 33 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 01:12:24,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-24 01:12:24,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-02-24 01:12:24,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-24 01:12:24,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-02-24 01:12:24,819 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2022-02-24 01:12:24,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:12:24,819 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-02-24 01:12:24,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:12:24,820 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-02-24 01:12:24,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-24 01:12:24,820 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:12:24,820 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:12:24,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-24 01:12:24,820 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:12:24,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:12:24,821 INFO L85 PathProgramCache]: Analyzing trace with hash 452585224, now seen corresponding path program 2 times [2022-02-24 01:12:24,821 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:12:24,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2077655283] [2022-02-24 01:12:24,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:12:24,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:12:24,829 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-24 01:12:24,829 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-02-24 01:12:24,829 INFO L281 tedInterpolationCore]: Could not accelerate. [2022-02-24 01:12:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:24,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:12:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:24,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:12:24,979 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:12:24,979 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2077655283] [2022-02-24 01:12:24,980 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2077655283] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:12:24,980 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:12:24,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-24 01:12:24,981 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652021422] [2022-02-24 01:12:24,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:12:24,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-24 01:12:24,982 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:12:24,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-24 01:12:24,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-24 01:12:24,983 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:12:25,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:12:25,071 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-02-24 01:12:25,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-24 01:12:25,071 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-02-24 01:12:25,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:12:25,073 INFO L225 Difference]: With dead ends: 44 [2022-02-24 01:12:25,073 INFO L226 Difference]: Without dead ends: 29 [2022-02-24 01:12:25,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-02-24 01:12:25,082 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 01:12:25,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 38 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 01:12:25,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-24 01:12:25,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-02-24 01:12:25,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-24 01:12:25,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-02-24 01:12:25,097 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 21 [2022-02-24 01:12:25,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:12:25,098 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-02-24 01:12:25,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:12:25,098 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-02-24 01:12:25,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-24 01:12:25,099 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:12:25,099 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:12:25,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-24 01:12:25,100 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:12:25,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:12:25,101 INFO L85 PathProgramCache]: Analyzing trace with hash 687738182, now seen corresponding path program 3 times [2022-02-24 01:12:25,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:12:25,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [339890299] [2022-02-24 01:12:25,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:12:25,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:12:25,110 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-24 01:12:25,111 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-02-24 01:12:25,111 INFO L281 tedInterpolationCore]: Could not accelerate. [2022-02-24 01:12:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:25,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:12:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:25,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:12:25,274 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:12:25,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [339890299] [2022-02-24 01:12:25,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [339890299] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:12:25,274 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:12:25,274 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-24 01:12:25,274 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172293860] [2022-02-24 01:12:25,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:12:25,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-24 01:12:25,275 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:12:25,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-24 01:12:25,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-24 01:12:25,277 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:12:25,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:12:25,375 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-02-24 01:12:25,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-24 01:12:25,376 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-02-24 01:12:25,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:12:25,379 INFO L225 Difference]: With dead ends: 46 [2022-02-24 01:12:25,379 INFO L226 Difference]: Without dead ends: 31 [2022-02-24 01:12:25,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-02-24 01:12:25,388 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 26 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 01:12:25,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 38 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 01:12:25,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-24 01:12:25,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-02-24 01:12:25,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-24 01:12:25,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-02-24 01:12:25,394 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2022-02-24 01:12:25,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:12:25,394 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-02-24 01:12:25,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:12:25,395 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-02-24 01:12:25,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-24 01:12:25,395 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:12:25,395 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:12:25,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-24 01:12:25,395 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:12:25,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:12:25,396 INFO L85 PathProgramCache]: Analyzing trace with hash -963535868, now seen corresponding path program 4 times [2022-02-24 01:12:25,396 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:12:25,396 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2093031466] [2022-02-24 01:12:25,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:12:25,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:12:25,413 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-24 01:12:25,413 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-02-24 01:12:25,413 INFO L281 tedInterpolationCore]: Could not accelerate. [2022-02-24 01:12:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:25,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:12:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:25,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:12:25,532 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:12:25,532 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2093031466] [2022-02-24 01:12:25,532 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2093031466] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:12:25,532 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:12:25,532 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-24 01:12:25,533 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253726806] [2022-02-24 01:12:25,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:12:25,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-24 01:12:25,533 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:12:25,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-24 01:12:25,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-02-24 01:12:25,533 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:12:25,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:12:25,672 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-02-24 01:12:25,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-24 01:12:25,672 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-24 01:12:25,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:12:25,673 INFO L225 Difference]: With dead ends: 48 [2022-02-24 01:12:25,673 INFO L226 Difference]: Without dead ends: 33 [2022-02-24 01:12:25,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-02-24 01:12:25,674 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 01:12:25,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 43 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 01:12:25,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-24 01:12:25,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-02-24 01:12:25,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-24 01:12:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-02-24 01:12:25,680 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 25 [2022-02-24 01:12:25,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:12:25,680 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-02-24 01:12:25,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:12:25,680 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-02-24 01:12:25,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-24 01:12:25,680 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:12:25,681 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:12:25,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-24 01:12:25,681 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:12:25,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:12:25,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1300001602, now seen corresponding path program 5 times [2022-02-24 01:12:25,681 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:12:25,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1806396632] [2022-02-24 01:12:25,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:12:25,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:12:25,684 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-24 01:12:25,684 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-02-24 01:12:25,684 INFO L281 tedInterpolationCore]: Could not accelerate. [2022-02-24 01:12:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:25,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:12:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:25,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:12:25,792 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:12:25,792 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1806396632] [2022-02-24 01:12:25,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1806396632] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:12:25,792 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:12:25,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 01:12:25,792 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651720665] [2022-02-24 01:12:25,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:12:25,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 01:12:25,792 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:12:25,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 01:12:25,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-24 01:12:25,793 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:12:25,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:12:25,881 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-02-24 01:12:25,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-24 01:12:25,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-02-24 01:12:25,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:12:25,882 INFO L225 Difference]: With dead ends: 46 [2022-02-24 01:12:25,882 INFO L226 Difference]: Without dead ends: 35 [2022-02-24 01:12:25,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-24 01:12:25,882 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 01:12:25,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 33 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 01:12:25,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-24 01:12:25,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-02-24 01:12:25,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-24 01:12:25,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2022-02-24 01:12:25,888 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 27 [2022-02-24 01:12:25,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:12:25,889 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2022-02-24 01:12:25,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:12:25,889 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-02-24 01:12:25,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-24 01:12:25,889 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:12:25,889 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:12:25,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-24 01:12:25,890 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:12:25,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:12:25,890 INFO L85 PathProgramCache]: Analyzing trace with hash -537357632, now seen corresponding path program 6 times [2022-02-24 01:12:25,890 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:12:25,890 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [866823834] [2022-02-24 01:12:25,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:12:25,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:12:25,892 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-24 01:12:25,893 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-02-24 01:12:25,893 INFO L281 tedInterpolationCore]: Could not accelerate. [2022-02-24 01:12:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:26,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:12:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:12:26,024 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:12:26,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [866823834] [2022-02-24 01:12:26,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [866823834] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:12:26,024 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:12:26,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-24 01:12:26,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662074037] [2022-02-24 01:12:26,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:12:26,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-24 01:12:26,025 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:12:26,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-24 01:12:26,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-24 01:12:26,025 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:12:26,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:12:26,204 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2022-02-24 01:12:26,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-24 01:12:26,205 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-02-24 01:12:26,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:12:26,205 INFO L225 Difference]: With dead ends: 48 [2022-02-24 01:12:26,205 INFO L226 Difference]: Without dead ends: 37 [2022-02-24 01:12:26,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-02-24 01:12:26,206 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 34 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 01:12:26,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 43 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 01:12:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-24 01:12:26,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-02-24 01:12:26,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-24 01:12:26,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-02-24 01:12:26,213 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 29 [2022-02-24 01:12:26,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:12:26,213 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-02-24 01:12:26,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:12:26,214 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-02-24 01:12:26,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-24 01:12:26,214 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:12:26,214 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:12:26,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-24 01:12:26,214 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:12:26,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:12:26,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1008022850, now seen corresponding path program 7 times [2022-02-24 01:12:26,215 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:12:26,215 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1413200703] [2022-02-24 01:12:26,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:12:26,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:12:26,217 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-24 01:12:26,217 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-02-24 01:12:26,217 INFO L281 tedInterpolationCore]: Could not accelerate. [2022-02-24 01:12:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:26,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:12:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:26,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:12:26,365 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:12:26,365 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1413200703] [2022-02-24 01:12:26,365 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1413200703] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:12:26,365 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:12:26,365 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-24 01:12:26,365 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49034925] [2022-02-24 01:12:26,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:12:26,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-24 01:12:26,366 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:12:26,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-24 01:12:26,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-24 01:12:26,368 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:12:26,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:12:26,608 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-02-24 01:12:26,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-24 01:12:26,608 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-02-24 01:12:26,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:12:26,609 INFO L225 Difference]: With dead ends: 50 [2022-02-24 01:12:26,609 INFO L226 Difference]: Without dead ends: 39 [2022-02-24 01:12:26,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-02-24 01:12:26,609 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 38 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 01:12:26,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 43 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 01:12:26,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-24 01:12:26,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2022-02-24 01:12:26,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-24 01:12:26,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-02-24 01:12:26,616 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 31 [2022-02-24 01:12:26,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:12:26,616 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-02-24 01:12:26,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:12:26,617 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-02-24 01:12:26,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-24 01:12:26,617 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:12:26,617 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:12:26,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-24 01:12:26,617 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:12:26,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:12:26,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1949236028, now seen corresponding path program 8 times [2022-02-24 01:12:26,618 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:12:26,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1311301260] [2022-02-24 01:12:26,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:12:26,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:12:26,622 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-24 01:12:26,623 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-02-24 01:12:26,623 INFO L281 tedInterpolationCore]: Could not accelerate. [2022-02-24 01:12:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:26,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:12:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:26,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:12:26,799 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:12:26,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1311301260] [2022-02-24 01:12:26,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1311301260] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:12:26,799 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:12:26,799 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-24 01:12:26,799 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126082543] [2022-02-24 01:12:26,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:12:26,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-24 01:12:26,799 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:12:26,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-24 01:12:26,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-02-24 01:12:26,800 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:12:27,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:12:27,108 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-02-24 01:12:27,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-24 01:12:27,109 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-02-24 01:12:27,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:12:27,110 INFO L225 Difference]: With dead ends: 63 [2022-02-24 01:12:27,111 INFO L226 Difference]: Without dead ends: 52 [2022-02-24 01:12:27,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2022-02-24 01:12:27,111 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 55 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 01:12:27,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 52 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 01:12:27,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-24 01:12:27,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2022-02-24 01:12:27,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-24 01:12:27,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2022-02-24 01:12:27,121 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 33 [2022-02-24 01:12:27,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:12:27,121 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2022-02-24 01:12:27,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:12:27,121 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-02-24 01:12:27,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-24 01:12:27,122 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:12:27,122 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:12:27,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-24 01:12:27,122 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:12:27,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:12:27,122 INFO L85 PathProgramCache]: Analyzing trace with hash 606667834, now seen corresponding path program 9 times [2022-02-24 01:12:27,122 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:12:27,122 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1651718293] [2022-02-24 01:12:27,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:12:27,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:12:27,125 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-24 01:12:27,125 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-02-24 01:12:27,125 INFO L281 tedInterpolationCore]: Could not accelerate. [2022-02-24 01:12:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:27,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:12:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:12:27,899 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:12:27,899 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1651718293] [2022-02-24 01:12:27,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1651718293] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:12:27,900 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:12:27,900 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-02-24 01:12:27,900 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999985422] [2022-02-24 01:12:27,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:12:27,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-24 01:12:27,900 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:12:27,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-24 01:12:27,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-02-24 01:12:27,901 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:12:29,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:12:29,372 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-02-24 01:12:29,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-24 01:12:29,373 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-02-24 01:12:29,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:12:29,373 INFO L225 Difference]: With dead ends: 70 [2022-02-24 01:12:29,373 INFO L226 Difference]: Without dead ends: 68 [2022-02-24 01:12:29,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=361, Invalid=1801, Unknown=0, NotChecked=0, Total=2162 [2022-02-24 01:12:29,374 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 98 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-24 01:12:29,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 60 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-24 01:12:29,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-02-24 01:12:29,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2022-02-24 01:12:29,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-24 01:12:29,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2022-02-24 01:12:29,386 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 35 [2022-02-24 01:12:29,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:12:29,386 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2022-02-24 01:12:29,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:12:29,387 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-02-24 01:12:29,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-24 01:12:29,387 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:12:29,387 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:12:29,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-24 01:12:29,387 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:12:29,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:12:29,388 INFO L85 PathProgramCache]: Analyzing trace with hash 758259348, now seen corresponding path program 1 times [2022-02-24 01:12:29,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:12:29,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [586007880] [2022-02-24 01:12:29,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:12:29,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:12:29,390 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-24 01:12:29,390 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-02-24 01:12:29,390 INFO L281 tedInterpolationCore]: Could not accelerate. [2022-02-24 01:12:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:30,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:12:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:30,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-02-24 01:12:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:12:30,437 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:12:30,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [586007880] [2022-02-24 01:12:30,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [586007880] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:12:30,437 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:12:30,437 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-02-24 01:12:30,437 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083031271] [2022-02-24 01:12:30,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:12:30,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-24 01:12:30,437 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:12:30,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-24 01:12:30,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-02-24 01:12:30,438 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-24 01:12:32,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:12:32,067 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-02-24 01:12:32,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-24 01:12:32,067 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-02-24 01:12:32,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:12:32,068 INFO L225 Difference]: With dead ends: 72 [2022-02-24 01:12:32,068 INFO L226 Difference]: Without dead ends: 70 [2022-02-24 01:12:32,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=373, Invalid=2177, Unknown=0, NotChecked=0, Total=2550 [2022-02-24 01:12:32,070 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 68 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-24 01:12:32,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 40 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-24 01:12:32,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-24 01:12:32,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2022-02-24 01:12:32,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-24 01:12:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-02-24 01:12:32,094 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 43 [2022-02-24 01:12:32,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:12:32,095 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-02-24 01:12:32,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-24 01:12:32,095 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-02-24 01:12:32,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-24 01:12:32,096 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:12:32,096 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:12:32,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-24 01:12:32,097 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:12:32,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:12:32,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1926528494, now seen corresponding path program 2 times [2022-02-24 01:12:32,097 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:12:32,097 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [522774619] [2022-02-24 01:12:32,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:12:32,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:12:32,101 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-24 01:12:32,101 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-02-24 01:12:32,101 INFO L281 tedInterpolationCore]: Could not accelerate. [2022-02-24 01:12:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:32,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:12:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:32,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-24 01:12:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:32,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:12:32,262 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:12:32,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [522774619] [2022-02-24 01:12:32,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [522774619] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:12:32,263 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:12:32,263 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-24 01:12:32,263 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968995241] [2022-02-24 01:12:32,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:12:32,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-24 01:12:32,263 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:12:32,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-24 01:12:32,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-24 01:12:32,264 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-24 01:12:32,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:12:32,537 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2022-02-24 01:12:32,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-24 01:12:32,538 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-02-24 01:12:32,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:12:32,539 INFO L225 Difference]: With dead ends: 83 [2022-02-24 01:12:32,539 INFO L226 Difference]: Without dead ends: 64 [2022-02-24 01:12:32,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-02-24 01:12:32,540 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 63 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 01:12:32,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 35 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 01:12:32,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-24 01:12:32,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2022-02-24 01:12:32,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 45 states have internal predecessors, (46), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-24 01:12:32,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2022-02-24 01:12:32,561 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 45 [2022-02-24 01:12:32,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:12:32,561 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2022-02-24 01:12:32,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-24 01:12:32,561 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2022-02-24 01:12:32,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-24 01:12:32,562 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:12:32,562 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:12:32,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-24 01:12:32,562 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:12:32,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:12:32,563 INFO L85 PathProgramCache]: Analyzing trace with hash 814759662, now seen corresponding path program 3 times [2022-02-24 01:12:32,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:12:32,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1088658434] [2022-02-24 01:12:32,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:12:32,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:12:32,565 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-24 01:12:32,566 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-02-24 01:12:32,566 INFO L281 tedInterpolationCore]: Could not accelerate. [2022-02-24 01:12:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:33,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:12:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:33,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-02-24 01:12:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:33,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-24 01:12:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:33,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:12:33,927 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:12:33,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1088658434] [2022-02-24 01:12:33,927 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1088658434] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:12:33,927 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:12:33,927 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-02-24 01:12:33,927 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045555122] [2022-02-24 01:12:33,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:12:33,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-24 01:12:33,928 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:12:33,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-24 01:12:33,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2022-02-24 01:12:33,928 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-24 01:12:35,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:12:35,212 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2022-02-24 01:12:35,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-24 01:12:35,213 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-02-24 01:12:35,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:12:35,214 INFO L225 Difference]: With dead ends: 65 [2022-02-24 01:12:35,214 INFO L226 Difference]: Without dead ends: 63 [2022-02-24 01:12:35,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=277, Invalid=1793, Unknown=0, NotChecked=0, Total=2070 [2022-02-24 01:12:35,215 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 44 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-24 01:12:35,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 37 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-24 01:12:35,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-24 01:12:35,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-02-24 01:12:35,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.04) internal successors, (52), 51 states have internal predecessors, (52), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-24 01:12:35,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2022-02-24 01:12:35,233 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 51 [2022-02-24 01:12:35,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:12:35,234 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2022-02-24 01:12:35,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-24 01:12:35,234 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2022-02-24 01:12:35,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-24 01:12:35,234 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:12:35,234 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:12:35,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-24 01:12:35,235 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:12:35,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:12:35,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1545771704, now seen corresponding path program 4 times [2022-02-24 01:12:35,235 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:12:35,235 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1112884102] [2022-02-24 01:12:35,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:12:35,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:12:35,237 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-24 01:12:35,237 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-02-24 01:12:35,238 INFO L281 tedInterpolationCore]: Could not accelerate. [2022-02-24 01:12:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:36,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:12:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:36,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-02-24 01:12:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:36,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-24 01:12:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:36,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-24 01:12:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:12:36,687 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:12:36,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1112884102] [2022-02-24 01:12:36,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1112884102] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:12:36,687 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:12:36,688 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-02-24 01:12:36,688 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98343948] [2022-02-24 01:12:36,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:12:36,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-02-24 01:12:36,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:12:36,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-02-24 01:12:36,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=758, Unknown=0, NotChecked=0, Total=930 [2022-02-24 01:12:36,689 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 31 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 29 states have internal predecessors, (43), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-24 01:12:39,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:12:39,118 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2022-02-24 01:12:39,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-02-24 01:12:39,118 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 29 states have internal predecessors, (43), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 59 [2022-02-24 01:12:39,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:12:39,119 INFO L225 Difference]: With dead ends: 87 [2022-02-24 01:12:39,119 INFO L226 Difference]: Without dead ends: 85 [2022-02-24 01:12:39,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1279 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=853, Invalid=3977, Unknown=0, NotChecked=0, Total=4830 [2022-02-24 01:12:39,121 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 129 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-24 01:12:39,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 82 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-24 01:12:39,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-02-24 01:12:39,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 70. [2022-02-24 01:12:39,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-24 01:12:39,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2022-02-24 01:12:39,151 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 59 [2022-02-24 01:12:39,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:12:39,152 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2022-02-24 01:12:39,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 29 states have internal predecessors, (43), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-24 01:12:39,152 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-02-24 01:12:39,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-24 01:12:39,153 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:12:39,153 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:12:39,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-24 01:12:39,153 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:12:39,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:12:39,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1028419166, now seen corresponding path program 5 times [2022-02-24 01:12:39,153 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:12:39,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1425749886] [2022-02-24 01:12:39,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:12:39,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:12:39,156 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-24 01:12:39,156 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-02-24 01:12:39,156 INFO L281 tedInterpolationCore]: Could not accelerate. [2022-02-24 01:12:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:40,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:12:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:40,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-02-24 01:12:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:40,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-24 01:12:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:40,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-24 01:12:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:40,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-24 01:12:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:40,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:12:40,507 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:12:40,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1425749886] [2022-02-24 01:12:40,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1425749886] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:12:40,508 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:12:40,508 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-02-24 01:12:40,508 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291065315] [2022-02-24 01:12:40,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:12:40,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-02-24 01:12:40,508 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:12:40,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-02-24 01:12:40,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=901, Unknown=0, NotChecked=0, Total=1056 [2022-02-24 01:12:40,509 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 33 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-24 01:12:44,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:12:44,111 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2022-02-24 01:12:44,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-02-24 01:12:44,111 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 67 [2022-02-24 01:12:44,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:12:44,112 INFO L225 Difference]: With dead ends: 104 [2022-02-24 01:12:44,113 INFO L226 Difference]: Without dead ends: 102 [2022-02-24 01:12:44,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1661 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1177, Invalid=5465, Unknown=0, NotChecked=0, Total=6642 [2022-02-24 01:12:44,114 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 167 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-24 01:12:44,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 71 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-24 01:12:44,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-24 01:12:44,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 78. [2022-02-24 01:12:44,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.032258064516129) internal successors, (64), 63 states have internal predecessors, (64), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-24 01:12:44,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2022-02-24 01:12:44,149 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 67 [2022-02-24 01:12:44,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:12:44,149 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2022-02-24 01:12:44,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-24 01:12:44,150 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2022-02-24 01:12:44,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-24 01:12:44,150 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:12:44,150 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:12:44,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-24 01:12:44,150 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:12:44,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:12:44,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1901280260, now seen corresponding path program 6 times [2022-02-24 01:12:44,151 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:12:44,151 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [772262633] [2022-02-24 01:12:44,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:12:44,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:12:44,153 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-24 01:12:44,153 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-02-24 01:12:44,153 INFO L281 tedInterpolationCore]: Could not accelerate. [2022-02-24 01:12:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:44,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:12:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:44,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-02-24 01:12:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:44,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-24 01:12:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:44,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-24 01:12:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:44,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-24 01:12:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:44,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-02-24 01:12:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:12:44,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:12:44,333 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:12:44,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [772262633] [2022-02-24 01:12:44,333 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [772262633] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:12:44,333 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:12:44,333 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-24 01:12:44,333 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340482367] [2022-02-24 01:12:44,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:12:44,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-24 01:12:44,334 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:12:44,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-24 01:12:44,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-24 01:12:44,334 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-24 01:12:44,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:12:44,628 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2022-02-24 01:12:44,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-24 01:12:44,629 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 75 [2022-02-24 01:12:44,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:12:44,629 INFO L225 Difference]: With dead ends: 134 [2022-02-24 01:12:44,629 INFO L226 Difference]: Without dead ends: 0 [2022-02-24 01:12:44,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-02-24 01:12:44,631 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 49 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-24 01:12:44,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 52 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-24 01:12:44,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-24 01:12:44,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-24 01:12:44,632 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-02-24 01:12:44,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-24 01:12:44,633 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2022-02-24 01:12:44,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:12:44,633 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-24 01:12:44,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-24 01:12:44,633 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-24 01:12:44,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-24 01:12:44,635 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-24 01:12:44,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-24 01:12:44,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-24 01:12:56,613 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-02-24 01:12:56,614 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-02-24 01:12:56,614 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-02-24 01:12:56,614 INFO L854 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: (let ((.cse18 (+ main_~max~0 4294967295))) (let ((.cse24 (div .cse18 4294967296))) (let ((.cse22 (* .cse24 4294967296)) (.cse11 (select |#memory_int| |main_~#str2~0.base|))) (let ((.cse19 (select .cse11 (+ (* .cse24 (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|))) (.cse6 (+ main_~i~0 .cse22)) (.cse16 (+ main_~i~0 |main_~#str1~0.offset|)) (.cse23 (select |#memory_int| |main_~#str1~0.base|))) (let ((.cse8 (= |main_~#str2~0.offset| 0)) (.cse9 (<= 5 main_~max~0)) (.cse10 (<= main_~max~0 5)) (.cse20 (= (select .cse11 3) (select .cse23 1))) (.cse14 (or (not (= .cse16 0)) (= (+ main_~max~0 4294967295 |main_~#str1~0.offset|) (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| .cse22)))) (.cse21 (= |main_~#str1~0.offset| 0)) (.cse15 (<= 4294967296 .cse6)) (.cse17 (= (select .cse23 0) .cse19))) (let ((.cse12 (+ main_~j~0 |main_~#str2~0.offset|)) (.cse3 (or (and .cse8 (<= 1 .cse16) .cse9 .cse10 .cse14 .cse21 .cse15 .cse17) (and .cse8 .cse9 .cse10 .cse20 .cse14 .cse21 .cse15 .cse17))) (.cse13 (select .cse23 .cse16)) (.cse0 (= (select .cse23 3) (select .cse11 1))) (.cse1 (= (select .cse11 2) (select .cse23 2))) (.cse2 (= |main_#t~mem11| |main_#t~mem10|)) (.cse4 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse7 (= (select .cse11 0) (select .cse23 (+ |main_~#str1~0.offset| 4))))) (or (let ((.cse5 (+ main_~max~0 4294967293))) (and .cse0 .cse1 (<= main_~j~0 2) .cse2 (<= 2 main_~j~0) .cse3 .cse4 (<= .cse5 .cse6) .cse7 (<= .cse6 .cse5))) (and .cse8 .cse9 .cse10 (= (select .cse11 .cse12) .cse13) .cse14 .cse0 .cse1 .cse2 .cse15 (= .cse16 1) .cse4 (<= .cse6 4294967297) (<= 1 main_~i~0) .cse17 (= .cse12 3) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= .cse12 1) (<= 3 main_~i~0) (<= main_~i~0 3) .cse7) (and .cse0 .cse1 .cse2 (= main_~j~0 0) (= .cse18 .cse6) .cse3 .cse4 .cse7) (and .cse8 (= .cse19 .cse13) .cse9 .cse10 .cse20 .cse0 .cse21 .cse1 .cse2 .cse15 (= main_~i~0 0) .cse4 (= .cse18 (+ main_~i~0 main_~j~0 .cse22)) .cse7)))))))) [2022-02-24 01:12:56,614 INFO L854 garLoopResultBuilder]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse17 (div (+ main_~max~0 4294967295) 4294967296))) (let ((.cse18 (* .cse17 4294967296))) (let ((.cse13 (+ main_~i~0 .cse18)) (.cse15 (select |#memory_int| |main_~#str1~0.base|)) (.cse14 (select |#memory_int| |main_~#str2~0.base|))) (let ((.cse8 (+ main_~j~0 |main_~#str2~0.offset|)) (.cse0 (= |main_~#str2~0.offset| 0)) (.cse1 (<= 5 main_~max~0)) (.cse2 (<= main_~max~0 5)) (.cse3 (or (not (= (+ main_~i~0 |main_~#str1~0.offset|) 0)) (= (+ main_~max~0 4294967295 |main_~#str1~0.offset|) (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| .cse18)))) (.cse4 (= (select .cse15 3) (select .cse14 1))) (.cse5 (= |main_~#str1~0.offset| 0)) (.cse6 (= (select .cse14 2) (select .cse15 2))) (.cse7 (<= 4294967296 .cse13)) (.cse9 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse10 (= (select .cse15 0) (select .cse14 (+ (* .cse17 (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|)))) (.cse11 (= (select .cse14 0) (select .cse15 (+ |main_~#str1~0.offset| 4))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 1 .cse8) .cse9 (<= main_~j~0 1) (<= 3 main_~i~0) .cse10 (<= main_~i~0 3) .cse11) (let ((.cse12 (+ main_~max~0 4294967293))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= main_~j~0 2) .cse7 (<= 2 main_~j~0) .cse9 .cse10 (<= .cse12 .cse13) .cse11 (<= .cse13 .cse12))) (and .cse0 .cse1 .cse2 (= (select .cse14 3) (select .cse15 1)) .cse3 .cse4 .cse5 .cse6 .cse7 (= main_~i~0 0) .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 (<= .cse13 (+ 4294967292 main_~max~0)) .cse10 (= .cse8 3) .cse11) (let ((.cse16 (+ main_~i~0 1))) (and .cse0 (<= .cse16 main_~max~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 (<= main_~max~0 .cse16)))))))) [2022-02-24 01:12:56,614 INFO L854 garLoopResultBuilder]: At program point mainEXIT(lines 13 36) the Hoare annotation is: (and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5)) [2022-02-24 01:12:56,614 INFO L854 garLoopResultBuilder]: At program point mainFINAL(lines 13 36) the Hoare annotation is: (and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5)) [2022-02-24 01:12:56,615 INFO L854 garLoopResultBuilder]: At program point L32-2(lines 32 35) the Hoare annotation is: (let ((.cse14 (select |#memory_int| |main_~#str1~0.base|)) (.cse18 (div (+ main_~max~0 4294967295) 4294967296))) (let ((.cse9 (+ main_~i~0 (* .cse18 4294967296))) (.cse6 (select .cse14 2)) (.cse16 (select .cse14 3)) (.cse17 (select |#memory_int| |main_~#str2~0.base|)) (.cse15 (+ main_~j~0 |main_~#str2~0.offset|))) (let ((.cse7 (select .cse17 .cse15)) (.cse0 (= |main_~#str2~0.offset| 0)) (.cse1 (<= 5 main_~max~0)) (.cse2 (<= main_~max~0 5)) (.cse3 (= .cse16 (select .cse17 1))) (.cse4 (= |main_~#str1~0.offset| 0)) (.cse13 (= (select .cse17 2) .cse6)) (.cse5 (<= 4294967296 .cse9)) (.cse8 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse10 (= (select .cse14 0) (select .cse17 (+ (* .cse18 (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|)))) (.cse11 (= (select .cse17 0) (select .cse14 (+ |main_~#str1~0.offset| 4))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= main_~j~0 2) .cse5 (= .cse6 .cse7) (<= 2 main_~j~0) .cse8 (<= .cse9 (+ 4294967292 main_~max~0)) (<= 1 main_~i~0) .cse10 .cse11) (let ((.cse12 (+ main_~i~0 1))) (and .cse0 (<= .cse12 main_~max~0) .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse8 .cse10 .cse11 (<= main_~max~0 .cse12))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 (= (select .cse14 1) .cse7) (<= 3 main_~j~0) .cse8 (<= .cse9 (+ 4294967291 main_~max~0)) .cse10 (<= main_~j~0 3) .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse13 (<= main_~max~0 (+ main_~i~0 3)) .cse5 .cse8 (= .cse15 1) (<= main_~i~0 2) .cse10 (= .cse16 .cse7) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 (= main_~j~0 0) .cse5 .cse8 (<= 3 main_~i~0) .cse10 (<= main_~i~0 3) .cse11))))) [2022-02-24 01:12:56,615 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 13 36) the Hoare annotation is: true [2022-02-24 01:12:56,615 INFO L854 garLoopResultBuilder]: At program point L32-3(lines 32 35) the Hoare annotation is: (let ((.cse2 (+ main_~max~0 4294967295))) (let ((.cse23 (div .cse2 4294967296))) (let ((.cse21 (* .cse23 4294967296)) (.cse11 (select |#memory_int| |main_~#str2~0.base|))) (let ((.cse18 (select .cse11 (+ (* .cse23 (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|))) (.cse3 (+ main_~i~0 .cse21)) (.cse15 (+ main_~i~0 |main_~#str1~0.offset|)) (.cse22 (select |#memory_int| |main_~#str1~0.base|))) (let ((.cse8 (= |main_~#str2~0.offset| 0)) (.cse9 (<= 5 main_~max~0)) (.cse10 (<= main_~max~0 5)) (.cse19 (= (select .cse11 3) (select .cse22 1))) (.cse13 (or (not (= .cse15 0)) (= (+ main_~max~0 4294967295 |main_~#str1~0.offset|) (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| .cse21)))) (.cse20 (= |main_~#str1~0.offset| 0)) (.cse14 (<= 4294967296 .cse3)) (.cse16 (= (select .cse22 0) .cse18))) (let ((.cse7 (+ main_~j~0 |main_~#str2~0.offset|)) (.cse12 (select .cse22 .cse15)) (.cse0 (= (select .cse22 3) (select .cse11 1))) (.cse1 (= (select .cse11 2) (select .cse22 2))) (.cse4 (or (and .cse8 (<= 1 .cse15) .cse9 .cse10 .cse13 .cse20 .cse14 .cse16) (and .cse8 .cse9 .cse10 .cse19 .cse13 .cse20 .cse14 .cse16))) (.cse5 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse6 (= (select .cse11 0) (select .cse22 (+ |main_~#str1~0.offset| 4))))) (or (and .cse0 .cse1 (= main_~j~0 0) (= .cse2 .cse3) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse4 .cse5 (= .cse7 1) (<= 3 main_~i~0) (<= main_~i~0 3) .cse6) (and .cse8 .cse9 .cse10 (= (select .cse11 .cse7) .cse12) .cse13 .cse0 .cse1 .cse14 (= .cse15 1) .cse5 (<= .cse3 4294967297) (<= 1 main_~i~0) .cse16 (= .cse7 3) .cse6) (let ((.cse17 (+ main_~max~0 4294967293))) (and .cse0 .cse1 (<= main_~j~0 2) (<= 2 main_~j~0) .cse4 .cse5 (<= .cse17 .cse3) .cse6 (<= .cse3 .cse17))) (and .cse8 (= .cse18 .cse12) .cse9 .cse10 .cse19 .cse0 .cse20 .cse1 .cse14 (= main_~i~0 0) .cse5 (= .cse2 (+ main_~i~0 main_~j~0 .cse21)) .cse6) (and .cse0 .cse1 .cse4 .cse5 (<= main_~max~0 main_~i~0) (not (<= (+ (div main_~max~0 4294967296) 1) (div main_~i~0 4294967296))) .cse6)))))))) [2022-02-24 01:12:56,615 INFO L854 garLoopResultBuilder]: At program point L32-4(lines 32 35) the Hoare annotation is: (and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5)) [2022-02-24 01:12:56,615 INFO L854 garLoopResultBuilder]: At program point L26-2(lines 26 29) the Hoare annotation is: (let ((.cse23 (+ main_~max~0 4294967295))) (let ((.cse20 (div .cse23 4294967296)) (.cse19 (select |#memory_int| |main_~#str2~0.base|))) (let ((.cse22 (select .cse19 0)) (.cse17 (* .cse20 4294967296)) (.cse6 (select .cse19 2)) (.cse21 (select |#memory_int| |main_~#str1~0.base|)) (.cse13 (select .cse19 1))) (let ((.cse12 (= |main_~#str2~0.offset| 0)) (.cse15 (select .cse19 3)) (.cse2 (= (select .cse21 3) .cse13)) (.cse16 (= .cse6 (select .cse21 2))) (.cse4 (= (+ main_~i~0 main_~j~0 .cse17) (+ main_~max~0 4294967296))) (.cse11 (= .cse22 (select .cse21 (+ |main_~#str1~0.offset| 4)))) (.cse0 (<= 5 main_~max~0)) (.cse1 (<= main_~max~0 5)) (.cse3 (= |main_~#str1~0.offset| 0)) (.cse7 (select .cse21 (+ main_~i~0 |main_~#str1~0.offset|))) (.cse10 (+ main_~i~0 .cse17)) (.cse5 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse8 (+ main_~j~0 |main_~#str2~0.offset|))) (or (let ((.cse9 (+ main_~max~0 4294967293))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= .cse6 .cse7) (= .cse8 3) (<= .cse9 .cse10) .cse11 (<= .cse10 .cse9))) (let ((.cse14 (+ main_~max~0 4294967294))) (and .cse12 .cse0 .cse1 .cse3 (= .cse13 .cse7) .cse4 (<= .cse10 .cse14) .cse5 (<= .cse14 .cse10) .cse11)) (and .cse12 (= .cse15 .cse7) .cse2 .cse3 .cse16 .cse4 .cse5 (<= .cse10 (+ 4294967292 main_~max~0)) (<= main_~max~0 (+ main_~i~0 4)) (<= 4294967297 .cse10) (<= .cse10 4294967297) .cse11) (let ((.cse18 (+ 4294967291 main_~max~0))) (and .cse12 (<= .cse17 .cse18) (= (select .cse19 (+ (* .cse20 (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|)) .cse7) (<= .cse18 .cse10) (= .cse15 (select .cse21 1)) .cse2 .cse3 .cse16 (<= .cse10 4294967296) (< 0 .cse20) .cse4 .cse5 .cse11)) (and .cse0 (= main_~j~0 1) .cse1 .cse3 (= .cse22 .cse7) (= .cse23 .cse10) .cse5 (= .cse8 1))))))) [2022-02-24 01:12:56,615 INFO L854 garLoopResultBuilder]: At program point L26-3(lines 26 29) the Hoare annotation is: (let ((.cse17 (+ main_~max~0 4294967295))) (let ((.cse16 (div .cse17 4294967296))) (let ((.cse13 (* .cse16 4294967296)) (.cse15 (select |#memory_int| |main_~#str2~0.base|)) (.cse14 (select |#memory_int| |main_~#str1~0.base|))) (let ((.cse1 (+ 4294967291 main_~max~0)) (.cse3 (= (select .cse15 3) (select .cse14 1))) (.cse4 (= (select .cse14 3) (select .cse15 1))) (.cse6 (= (select .cse15 2) (select .cse14 2))) (.cse7 (< 0 .cse16)) (.cse0 (= |main_~#str2~0.offset| 0)) (.cse5 (= |main_~#str1~0.offset| 0)) (.cse8 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse12 (+ main_~j~0 |main_~#str2~0.offset|)) (.cse2 (+ main_~i~0 .cse13)) (.cse9 (let ((.cse19 (<= (+ main_~max~0 2147483648) .cse13))) (or (and (not .cse19) (= (+ main_~i~0 main_~j~0 .cse13 1) main_~max~0)) (and .cse19 (= .cse17 (+ main_~i~0 main_~j~0 .cse13)))))) (.cse10 (= (select .cse15 0) (select .cse14 (+ |main_~#str1~0.offset| 4))))) (or (and .cse0 (<= .cse1 .cse2) .cse3 .cse4 .cse5 .cse6 (<= .cse2 4294967296) .cse7 (= main_~i~0 0) .cse8 (<= .cse2 .cse1) .cse9 .cse10) (let ((.cse11 (+ main_~max~0 4294967293))) (and .cse0 .cse4 .cse5 (<= 4294967298 .cse2) .cse8 .cse9 (<= .cse2 4294967298) (<= .cse11 .cse2) .cse10 (<= .cse2 .cse11))) (and .cse4 .cse5 .cse6 .cse8 (<= .cse2 (+ 4294967292 main_~max~0)) (<= main_~max~0 (+ main_~i~0 4)) (<= 4294967297 .cse2) (<= .cse2 4294967297) (= .cse12 3) .cse9 .cse10) (and .cse0 (<= .cse2 4294967295) (<= .cse13 .cse1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (select .cse14 0) (select .cse15 (+ (* .cse16 (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|))) .cse9 (<= (+ 4294967290 main_~max~0) .cse2) .cse10) (and .cse0 (<= 5 main_~max~0) (<= main_~max~0 5) .cse5 (= main_~j~0 0) (= .cse17 .cse2) .cse8) (let ((.cse18 (+ main_~max~0 4294967294))) (and (<= .cse2 4294967299) .cse5 (<= 4294967299 .cse2) (<= .cse2 .cse18) .cse8 (= .cse12 1) (<= .cse18 .cse2) .cse9 .cse10))))))) [2022-02-24 01:12:56,616 INFO L854 garLoopResultBuilder]: At program point L26-4(lines 26 29) the Hoare annotation is: (let ((.cse3 (+ main_~max~0 4294967295))) (let ((.cse5 (div .cse3 4294967296))) (let ((.cse4 (* .cse5 4294967296))) (let ((.cse0 (+ main_~i~0 .cse4)) (.cse1 (select |#memory_int| |main_~#str2~0.base|)) (.cse2 (select |#memory_int| |main_~#str1~0.base|))) (and (= |main_~#str2~0.offset| 0) (<= .cse0 4294967295) (<= 5 main_~max~0) (= (select .cse1 3) (select .cse2 1)) (= (select .cse2 3) (select .cse1 1)) (= |main_~#str1~0.offset| 0) (= (select .cse1 2) (select .cse2 2)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= .cse3 (+ main_~i~0 main_~j~0 .cse4)) (= (select .cse2 0) (select .cse1 (+ (* .cse5 (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|))) (<= (+ 4294967290 main_~max~0) .cse0) (= (select .cse1 0) (select .cse2 (+ |main_~#str1~0.offset| 4)))))))) [2022-02-24 01:12:56,616 INFO L854 garLoopResultBuilder]: At program point L18-2(lines 18 20) the Hoare annotation is: (let ((.cse8 (div (+ main_~max~0 4294967295) 4294967296))) (let ((.cse0 (= |main_~#str2~0.offset| 0)) (.cse1 (not (<= .cse8 0))) (.cse3 (<= 5 main_~max~0)) (.cse4 (<= main_~max~0 5)) (.cse5 (= |main_~#str1~0.offset| 0)) (.cse6 (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (let ((.cse2 (+ main_~i~0 1))) (and .cse0 .cse1 (<= .cse2 main_~max~0) .cse3 .cse4 .cse5 .cse6 (<= main_~max~0 .cse2))) (let ((.cse7 (+ main_~i~0 2))) (and .cse0 .cse5 (<= main_~max~0 .cse7) (<= .cse7 main_~max~0) .cse6 (<= 3 main_~i~0) (<= main_~i~0 3))) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (<= (* (div main_~max~0 4294967296) 4294967296) main_~i~0) (<= (+ main_~i~0 (* .cse8 4294967296)) 4294967298))))) [2022-02-24 01:12:56,616 INFO L854 garLoopResultBuilder]: At program point L18-3(lines 18 20) the Hoare annotation is: (let ((.cse5 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (.cse0 (= |main_~#str2~0.offset| 0)) (.cse1 (<= 5 main_~max~0)) (.cse2 (<= main_~max~0 5)) (.cse3 (= |main_~#str1~0.offset| 0)) (.cse4 (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 (= main_~i~0 0) .cse4) (and .cse0 .cse1 .cse3 (<= main_~max~0 (+ main_~i~0 3)) .cse4 (<= .cse5 4294967298)) (and .cse0 .cse1 .cse3 (<= main_~i~0 4) .cse4 (<= main_~max~0 (+ main_~i~0 1))) (let ((.cse6 (+ main_~i~0 2))) (and .cse0 .cse3 (<= main_~max~0 .cse6) (<= .cse6 main_~max~0) .cse4 (<= 3 main_~i~0) (<= main_~i~0 3))) (let ((.cse7 (+ main_~i~0 4))) (and .cse0 (<= .cse7 main_~max~0) (= (+ main_~i~0 |main_~#str1~0.offset|) 1) .cse4 (<= main_~max~0 .cse7) (<= .cse5 4294967297) (<= 1 main_~i~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= main_~max~0 main_~i~0) (not (<= (+ (div main_~max~0 4294967296) 1) (div main_~i~0 4294967296)))))) [2022-02-24 01:12:56,616 INFO L854 garLoopResultBuilder]: At program point L18-4(lines 18 20) the Hoare annotation is: (and (= |main_~#str2~0.offset| 0) (<= 5 main_~max~0) (<= main_~max~0 5) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~max~0 main_~i~0) (not (<= (+ (div main_~max~0 4294967296) 1) (div main_~i~0 4294967296)))) [2022-02-24 01:12:56,616 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-02-24 01:12:56,616 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-02-24 01:12:56,616 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-02-24 01:12:56,616 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-02-24 01:12:56,616 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-02-24 01:12:56,616 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-02-24 01:12:56,616 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-02-24 01:12:56,616 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-02-24 01:12:56,617 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-02-24 01:12:56,617 INFO L854 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-02-24 01:12:56,617 INFO L854 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-02-24 01:12:56,617 INFO L854 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-02-24 01:12:56,617 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-02-24 01:12:56,619 INFO L732 BasicCegarLoop]: Path program histogram: [9, 6, 1, 1] [2022-02-24 01:12:56,620 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-24 01:12:56,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.02 01:12:56 BoogieIcfgContainer [2022-02-24 01:12:56,667 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-24 01:12:56,668 INFO L158 Benchmark]: Toolchain (without parser) took 33450.53ms. Allocated memory was 189.8MB in the beginning and 715.1MB in the end (delta: 525.3MB). Free memory was 169.5MB in the beginning and 539.9MB in the end (delta: -370.4MB). Peak memory consumption was 361.3MB. Max. memory is 8.0GB. [2022-02-24 01:12:56,668 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 189.8MB. Free memory was 155.6MB in the beginning and 155.5MB in the end (delta: 115.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-24 01:12:56,668 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.40ms. Allocated memory is still 189.8MB. Free memory was 169.5MB in the beginning and 166.0MB in the end (delta: 3.4MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. [2022-02-24 01:12:56,668 INFO L158 Benchmark]: Boogie Preprocessor took 31.86ms. Allocated memory is still 189.8MB. Free memory was 166.0MB in the beginning and 164.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-24 01:12:56,668 INFO L158 Benchmark]: RCFGBuilder took 291.92ms. Allocated memory is still 189.8MB. Free memory was 164.3MB in the beginning and 153.5MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-02-24 01:12:56,669 INFO L158 Benchmark]: TraceAbstraction took 32889.33ms. Allocated memory was 189.8MB in the beginning and 715.1MB in the end (delta: 525.3MB). Free memory was 153.1MB in the beginning and 539.9MB in the end (delta: -386.8MB). Peak memory consumption was 345.5MB. Max. memory is 8.0GB. [2022-02-24 01:12:56,669 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.13ms. Allocated memory is still 189.8MB. Free memory was 155.6MB in the beginning and 155.5MB in the end (delta: 115.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 233.40ms. Allocated memory is still 189.8MB. Free memory was 169.5MB in the beginning and 166.0MB in the end (delta: 3.4MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.86ms. Allocated memory is still 189.8MB. Free memory was 166.0MB in the beginning and 164.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 291.92ms. Allocated memory is still 189.8MB. Free memory was 164.3MB in the beginning and 153.5MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 32889.33ms. Allocated memory was 189.8MB in the beginning and 715.1MB in the end (delta: 525.3MB). Free memory was 153.1MB in the beginning and 539.9MB in the end (delta: -386.8MB). Peak memory consumption was 345.5MB. 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: 7]: 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 5 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.8s, OverallIterations: 17, TraceHistogramMax: 6, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 934 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 929 mSDsluCounter, 763 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 455 mSDsCounter, 1313 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4703 IncrementalHoareTripleChecker+Invalid, 6016 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1313 mSolverCounterUnsat, 308 mSDtfsCounter, 4703 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 501 GetRequests, 91 SyntacticMatches, 4 SemanticMatches, 406 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4475 ImplicationChecksByTransitivity, 12.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=16, InterpolantAutomatonStates: 267, 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, 17 MinimizatonAttempts, 104 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 159 PreInvPairs, 219 NumberOfFragments, 4896 HoareAnnotationTreeSize, 159 FomulaSimplifications, 1229 FormulaSimplificationTreeSizeReduction, 8.2s HoareSimplificationTime, 27 FomulaSimplificationsInter, 2230892 FormulaSimplificationTreeSizeReductionInter, 3.7s 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: 32]: Loop Invariant Derived loop invariant: ((((((((((unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1] && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && j == 0) && max + 4294967295 == i + (max + 4294967295) / 4294967296 * 4294967296) && ((((((((str2 == 0 && 1 <= i + str1) && 5 <= max) && max <= 5) && (!(i + str1 == 0) || max + 4294967295 + str1 == i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296)) && str1 == 0) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]) || (((((((str2 == 0 && 5 <= max) && max <= 5) && unknown-#memory_int-unknown[str2][3] == unknown-#memory_int-unknown[str1][1]) && (!(i + str1 == 0) || max + 4294967295 + str1 == i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296)) && str1 == 0) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]))) && !(str1 == str2)) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) || (((((((unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1] && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && ((((((((str2 == 0 && 1 <= i + str1) && 5 <= max) && max <= 5) && (!(i + str1 == 0) || max + 4294967295 + str1 == i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296)) && str1 == 0) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]) || (((((((str2 == 0 && 5 <= max) && max <= 5) && unknown-#memory_int-unknown[str2][3] == unknown-#memory_int-unknown[str1][1]) && (!(i + str1 == 0) || max + 4294967295 + str1 == i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296)) && str1 == 0) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]))) && !(str1 == str2)) && j + str2 == 1) && 3 <= i) && i <= 3) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4])) || ((((((((((((((str2 == 0 && 5 <= max) && max <= 5) && unknown-#memory_int-unknown[str2][j + str2] == unknown-#memory_int-unknown[str1][i + str1]) && (!(i + str1 == 0) || max + 4294967295 + str1 == i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296)) && unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1]) && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && i + str1 == 1) && !(str1 == str2)) && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967297) && 1 <= i) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]) && j + str2 == 3) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4])) || ((((((((unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1] && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && j <= 2) && 2 <= j) && ((((((((str2 == 0 && 1 <= i + str1) && 5 <= max) && max <= 5) && (!(i + str1 == 0) || max + 4294967295 + str1 == i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296)) && str1 == 0) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]) || (((((((str2 == 0 && 5 <= max) && max <= 5) && unknown-#memory_int-unknown[str2][3] == unknown-#memory_int-unknown[str1][1]) && (!(i + str1 == 0) || max + 4294967295 + str1 == i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296)) && str1 == 0) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]))) && !(str1 == str2)) && max + 4294967293 <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && i + (max + 4294967295) / 4294967296 * 4294967296 <= max + 4294967293)) || ((((((((((((str2 == 0 && unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1] == unknown-#memory_int-unknown[str1][i + str1]) && 5 <= max) && max <= 5) && unknown-#memory_int-unknown[str2][3] == unknown-#memory_int-unknown[str1][1]) && unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1]) && str1 == 0) && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && i == 0) && !(str1 == str2)) && max + 4294967295 == i + j + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4])) || ((((((unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1] && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && ((((((((str2 == 0 && 1 <= i + str1) && 5 <= max) && max <= 5) && (!(i + str1 == 0) || max + 4294967295 + str1 == i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296)) && str1 == 0) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]) || (((((((str2 == 0 && 5 <= max) && max <= 5) && unknown-#memory_int-unknown[str2][3] == unknown-#memory_int-unknown[str1][1]) && (!(i + str1 == 0) || max + 4294967295 + str1 == i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296)) && str1 == 0) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]))) && !(str1 == str2)) && max <= i) && !(max / 4294967296 + 1 <= i / 4294967296)) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((((((((((((((((str2 == 0 && 4294967291 + max <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str2][3] == unknown-#memory_int-unknown[str1][1]) && unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1]) && str1 == 0) && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967296) && 0 < (max + 4294967295) / 4294967296) && i == 0) && !(str1 == str2)) && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967291 + max) && ((!(max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296) && i + j + (max + 4294967295) / 4294967296 * 4294967296 + 1 == max) || (max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296 && max + 4294967295 == i + j + (max + 4294967295) / 4294967296 * 4294967296))) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) || (((((((((str2 == 0 && unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1]) && str1 == 0) && 4294967298 <= i + (max + 4294967295) / 4294967296 * 4294967296) && !(str1 == str2)) && ((!(max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296) && i + j + (max + 4294967295) / 4294967296 * 4294967296 + 1 == max) || (max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296 && max + 4294967295 == i + j + (max + 4294967295) / 4294967296 * 4294967296))) && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967298) && max + 4294967293 <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && i + (max + 4294967295) / 4294967296 * 4294967296 <= max + 4294967293)) || ((((((((((unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1] && str1 == 0) && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && !(str1 == str2)) && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967292 + max) && max <= i + 4) && 4294967297 <= i + (max + 4294967295) / 4294967296 * 4294967296) && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967297) && j + str2 == 3) && ((!(max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296) && i + j + (max + 4294967295) / 4294967296 * 4294967296 + 1 == max) || (max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296 && max + 4294967295 == i + j + (max + 4294967295) / 4294967296 * 4294967296))) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4])) || ((((((((((((str2 == 0 && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967295) && (max + 4294967295) / 4294967296 * 4294967296 <= 4294967291 + max) && unknown-#memory_int-unknown[str2][3] == unknown-#memory_int-unknown[str1][1]) && unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1]) && str1 == 0) && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && 0 < (max + 4294967295) / 4294967296) && !(str1 == str2)) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]) && ((!(max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296) && i + j + (max + 4294967295) / 4294967296 * 4294967296 + 1 == max) || (max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296 && max + 4294967295 == i + j + (max + 4294967295) / 4294967296 * 4294967296))) && 4294967290 + max <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4])) || ((((((str2 == 0 && 5 <= max) && max <= 5) && str1 == 0) && j == 0) && max + 4294967295 == i + (max + 4294967295) / 4294967296 * 4294967296) && !(str1 == str2))) || ((((((((i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967299 && str1 == 0) && 4294967299 <= i + (max + 4294967295) / 4294967296 * 4294967296) && i + (max + 4294967295) / 4294967296 * 4294967296 <= max + 4294967294) && !(str1 == str2)) && j + str2 == 1) && max + 4294967294 <= i + (max + 4294967295) / 4294967296 * 4294967296) && ((!(max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296) && i + j + (max + 4294967295) / 4294967296 * 4294967296 + 1 == max) || (max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296 && max + 4294967295 == i + j + (max + 4294967295) / 4294967296 * 4294967296))) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((((((((str2 == 0 && 5 <= max) && max <= 5) && str1 == 0) && i == 0) && !(str1 == str2)) || (((((str2 == 0 && 5 <= max) && str1 == 0) && max <= i + 3) && !(str1 == str2)) && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967298)) || (((((str2 == 0 && 5 <= max) && str1 == 0) && i <= 4) && !(str1 == str2)) && max <= i + 1)) || ((((((str2 == 0 && str1 == 0) && max <= i + 2) && i + 2 <= max) && !(str1 == str2)) && 3 <= i) && i <= 3)) || ((((((str2 == 0 && i + 4 <= max) && i + str1 == 1) && !(str1 == str2)) && max <= i + 4) && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967297) && 1 <= i)) || ((((((str2 == 0 && 5 <= max) && max <= 5) && str1 == 0) && !(str1 == str2)) && max <= i) && !(max / 4294967296 + 1 <= i / 4294967296)) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: !((max + 4294967295) / 4294967296 <= 0) && max <= 5 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-02-24 01:12:56,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...