/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/verifythis/lcp.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-5d317bd [2022-03-19 03:07:20,981 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-19 03:07:20,982 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-19 03:07:21,019 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-19 03:07:21,019 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-19 03:07:21,024 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-19 03:07:21,027 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-19 03:07:21,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-19 03:07:21,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-19 03:07:21,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-19 03:07:21,032 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-19 03:07:21,033 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-19 03:07:21,033 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-19 03:07:21,034 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-19 03:07:21,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-19 03:07:21,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-19 03:07:21,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-19 03:07:21,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-19 03:07:21,037 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-19 03:07:21,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-19 03:07:21,041 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-19 03:07:21,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-19 03:07:21,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-19 03:07:21,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-19 03:07:21,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-19 03:07:21,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-19 03:07:21,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-19 03:07:21,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-19 03:07:21,059 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-19 03:07:21,060 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-19 03:07:21,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-19 03:07:21,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-19 03:07:21,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-19 03:07:21,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-19 03:07:21,061 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-19 03:07:21,062 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-19 03:07:21,062 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-19 03:07:21,063 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-19 03:07:21,063 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-19 03:07:21,063 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-19 03:07:21,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-19 03:07:21,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-19 03:07:21,064 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-03-19 03:07:21,073 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-19 03:07:21,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-19 03:07:21,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-19 03:07:21,076 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-19 03:07:21,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-19 03:07:21,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-19 03:07:21,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-19 03:07:21,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-19 03:07:21,076 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-19 03:07:21,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-19 03:07:21,077 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-19 03:07:21,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-19 03:07:21,077 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-19 03:07:21,077 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-19 03:07:21,077 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-19 03:07:21,077 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-19 03:07:21,077 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-19 03:07:21,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-19 03:07:21,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 03:07:21,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-19 03:07:21,078 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-19 03:07:21,078 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-19 03:07:21,078 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-19 03:07:21,078 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-19 03:07:21,078 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-03-19 03:07:21,078 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-03-19 03:07:21,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-19 03:07:21,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-19 03:07:21,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-19 03:07:21,278 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-19 03:07:21,284 INFO L275 PluginConnector]: CDTParser initialized [2022-03-19 03:07:21,286 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/lcp.c [2022-03-19 03:07:21,360 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ab648a80/10fa67a2e25344e2ba7c99df3b50130b/FLAGf1230d0a7 [2022-03-19 03:07:21,774 INFO L306 CDTParser]: Found 1 translation units. [2022-03-19 03:07:21,775 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/lcp.c [2022-03-19 03:07:21,782 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ab648a80/10fa67a2e25344e2ba7c99df3b50130b/FLAGf1230d0a7 [2022-03-19 03:07:21,805 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ab648a80/10fa67a2e25344e2ba7c99df3b50130b [2022-03-19 03:07:21,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-19 03:07:21,808 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-19 03:07:21,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-19 03:07:21,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-19 03:07:21,814 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-19 03:07:21,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 03:07:21" (1/1) ... [2022-03-19 03:07:21,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1db6664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:07:21, skipping insertion in model container [2022-03-19 03:07:21,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 03:07:21" (1/1) ... [2022-03-19 03:07:21,820 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-19 03:07:21,832 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-19 03:07:22,036 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/lcp.c[515,528] [2022-03-19 03:07:22,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 03:07:22,060 INFO L203 MainTranslator]: Completed pre-run [2022-03-19 03:07:22,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/lcp.c[515,528] [2022-03-19 03:07:22,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 03:07:22,088 INFO L208 MainTranslator]: Completed translation [2022-03-19 03:07:22,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:07:22 WrapperNode [2022-03-19 03:07:22,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-19 03:07:22,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-19 03:07:22,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-19 03:07:22,090 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-19 03:07:22,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:07:22" (1/1) ... [2022-03-19 03:07:22,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:07:22" (1/1) ... [2022-03-19 03:07:22,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:07:22" (1/1) ... [2022-03-19 03:07:22,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:07:22" (1/1) ... [2022-03-19 03:07:22,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:07:22" (1/1) ... [2022-03-19 03:07:22,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:07:22" (1/1) ... [2022-03-19 03:07:22,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:07:22" (1/1) ... [2022-03-19 03:07:22,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-19 03:07:22,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-19 03:07:22,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-19 03:07:22,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-19 03:07:22,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:07:22" (1/1) ... [2022-03-19 03:07:22,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 03:07:22,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 03:07:22,156 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-03-19 03:07:22,164 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-03-19 03:07:22,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-19 03:07:22,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-19 03:07:22,183 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-19 03:07:22,183 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-19 03:07:22,183 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-19 03:07:22,183 INFO L138 BoogieDeclarations]: Found implementation of procedure lcp [2022-03-19 03:07:22,183 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2022-03-19 03:07:22,183 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-19 03:07:22,183 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-03-19 03:07:22,183 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-03-19 03:07:22,183 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-03-19 03:07:22,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-19 03:07:22,184 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-19 03:07:22,184 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-19 03:07:22,184 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-19 03:07:22,184 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-19 03:07:22,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-19 03:07:22,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-19 03:07:22,184 INFO L130 BoogieDeclarations]: Found specification of procedure lcp [2022-03-19 03:07:22,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-19 03:07:22,184 INFO L130 BoogieDeclarations]: Found specification of procedure check [2022-03-19 03:07:22,184 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-19 03:07:22,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-19 03:07:22,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-03-19 03:07:22,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-19 03:07:22,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-19 03:07:22,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-19 03:07:22,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-19 03:07:22,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-19 03:07:22,255 INFO L234 CfgBuilder]: Building ICFG [2022-03-19 03:07:22,256 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-19 03:07:22,475 INFO L275 CfgBuilder]: Performing block encoding [2022-03-19 03:07:22,479 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-19 03:07:22,479 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-19 03:07:22,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 03:07:22 BoogieIcfgContainer [2022-03-19 03:07:22,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-19 03:07:22,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-19 03:07:22,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-19 03:07:22,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-19 03:07:22,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 03:07:21" (1/3) ... [2022-03-19 03:07:22,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0160fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 03:07:22, skipping insertion in model container [2022-03-19 03:07:22,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:07:22" (2/3) ... [2022-03-19 03:07:22,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0160fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 03:07:22, skipping insertion in model container [2022-03-19 03:07:22,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 03:07:22" (3/3) ... [2022-03-19 03:07:22,492 INFO L111 eAbstractionObserver]: Analyzing ICFG lcp.c [2022-03-19 03:07:22,496 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-19 03:07:22,496 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-19 03:07:22,538 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-19 03:07:22,544 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-19 03:07:22,544 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-19 03:07:22,560 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-03-19 03:07:22,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-19 03:07:22,569 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 03:07:22,570 INFO L500 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 03:07:22,570 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 03:07:22,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 03:07:22,575 INFO L85 PathProgramCache]: Analyzing trace with hash -675162514, now seen corresponding path program 1 times [2022-03-19 03:07:22,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 03:07:22,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2009506893] [2022-03-19 03:07:22,589 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 03:07:22,590 INFO L85 PathProgramCache]: Analyzing trace with hash -675162514, now seen corresponding path program 2 times [2022-03-19 03:07:22,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 03:07:22,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715590281] [2022-03-19 03:07:22,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 03:07:22,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 03:07:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:22,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 03:07:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:22,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 03:07:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:22,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 03:07:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:22,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-19 03:07:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:22,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-03-19 03:07:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:22,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-03-19 03:07:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:22,831 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-19 03:07:22,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 03:07:22,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715590281] [2022-03-19 03:07:22,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715590281] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:07:22,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 03:07:22,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 03:07:22,834 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 03:07:22,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2009506893] [2022-03-19 03:07:22,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2009506893] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:07:22,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 03:07:22,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 03:07:22,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689492268] [2022-03-19 03:07:22,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 03:07:22,838 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 03:07:22,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 03:07:22,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 03:07:22,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 03:07:22,863 INFO L87 Difference]: Start difference. First operand has 49 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-03-19 03:07:22,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 03:07:22,997 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2022-03-19 03:07:22,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-19 03:07:23,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-03-19 03:07:23,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 03:07:23,005 INFO L225 Difference]: With dead ends: 91 [2022-03-19 03:07:23,006 INFO L226 Difference]: Without dead ends: 41 [2022-03-19 03:07:23,008 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-03-19 03:07:23,010 INFO L912 BasicCegarLoop]: 41 mSDtfsCounter, 56 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 03:07:23,012 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 43 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 03:07:23,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-19 03:07:23,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-03-19 03:07:23,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-03-19 03:07:23,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-03-19 03:07:23,049 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 41 [2022-03-19 03:07:23,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 03:07:23,050 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-03-19 03:07:23,050 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-03-19 03:07:23,050 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-03-19 03:07:23,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-19 03:07:23,053 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 03:07:23,054 INFO L500 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 03:07:23,054 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-19 03:07:23,056 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 03:07:23,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 03:07:23,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1025657093, now seen corresponding path program 1 times [2022-03-19 03:07:23,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 03:07:23,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1527616196] [2022-03-19 03:07:23,058 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 03:07:23,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1025657093, now seen corresponding path program 2 times [2022-03-19 03:07:23,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 03:07:23,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339147078] [2022-03-19 03:07:23,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 03:07:23,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 03:07:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:23,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 03:07:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:23,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 03:07:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:23,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 03:07:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:23,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-19 03:07:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:23,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-03-19 03:07:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:23,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-03-19 03:07:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:23,319 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-19 03:07:23,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 03:07:23,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339147078] [2022-03-19 03:07:23,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339147078] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:07:23,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 03:07:23,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-19 03:07:23,320 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 03:07:23,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1527616196] [2022-03-19 03:07:23,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1527616196] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:07:23,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 03:07:23,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-19 03:07:23,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404564177] [2022-03-19 03:07:23,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 03:07:23,322 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-19 03:07:23,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 03:07:23,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-19 03:07:23,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-03-19 03:07:23,323 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-03-19 03:07:23,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 03:07:23,587 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2022-03-19 03:07:23,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-19 03:07:23,588 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-03-19 03:07:23,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 03:07:23,590 INFO L225 Difference]: With dead ends: 64 [2022-03-19 03:07:23,590 INFO L226 Difference]: Without dead ends: 42 [2022-03-19 03:07:23,592 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-03-19 03:07:23,593 INFO L912 BasicCegarLoop]: 31 mSDtfsCounter, 65 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 03:07:23,598 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 43 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 03:07:23,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-03-19 03:07:23,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-03-19 03:07:23,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-03-19 03:07:23,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-03-19 03:07:23,612 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 43 [2022-03-19 03:07:23,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 03:07:23,614 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-03-19 03:07:23,614 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-03-19 03:07:23,614 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-03-19 03:07:23,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-19 03:07:23,616 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 03:07:23,617 INFO L500 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 03:07:23,617 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-19 03:07:23,617 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 03:07:23,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 03:07:23,617 INFO L85 PathProgramCache]: Analyzing trace with hash -968487613, now seen corresponding path program 1 times [2022-03-19 03:07:23,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 03:07:23,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1890237277] [2022-03-19 03:07:23,618 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 03:07:23,618 INFO L85 PathProgramCache]: Analyzing trace with hash -968487613, now seen corresponding path program 2 times [2022-03-19 03:07:23,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 03:07:23,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586798925] [2022-03-19 03:07:23,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 03:07:23,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 03:07:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:23,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 03:07:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:23,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 03:07:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:23,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 03:07:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:23,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-19 03:07:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:23,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-03-19 03:07:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:23,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-03-19 03:07:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:23,824 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-19 03:07:23,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 03:07:23,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586798925] [2022-03-19 03:07:23,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586798925] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:07:23,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 03:07:23,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-19 03:07:23,825 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 03:07:23,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1890237277] [2022-03-19 03:07:23,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1890237277] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:07:23,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 03:07:23,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-19 03:07:23,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870948800] [2022-03-19 03:07:23,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 03:07:23,826 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-19 03:07:23,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 03:07:23,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-19 03:07:23,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-03-19 03:07:23,826 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-03-19 03:07:24,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 03:07:24,138 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2022-03-19 03:07:24,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-19 03:07:24,138 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-03-19 03:07:24,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 03:07:24,139 INFO L225 Difference]: With dead ends: 48 [2022-03-19 03:07:24,139 INFO L226 Difference]: Without dead ends: 44 [2022-03-19 03:07:24,140 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2022-03-19 03:07:24,140 INFO L912 BasicCegarLoop]: 30 mSDtfsCounter, 69 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 03:07:24,141 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 46 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 03:07:24,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-03-19 03:07:24,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-03-19 03:07:24,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-03-19 03:07:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-03-19 03:07:24,148 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 43 [2022-03-19 03:07:24,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 03:07:24,148 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-03-19 03:07:24,148 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-03-19 03:07:24,148 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-03-19 03:07:24,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-19 03:07:24,149 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 03:07:24,149 INFO L500 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 03:07:24,149 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-19 03:07:24,149 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 03:07:24,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 03:07:24,150 INFO L85 PathProgramCache]: Analyzing trace with hash -582845443, now seen corresponding path program 1 times [2022-03-19 03:07:24,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 03:07:24,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1993323259] [2022-03-19 03:07:24,150 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 03:07:24,150 INFO L85 PathProgramCache]: Analyzing trace with hash -582845443, now seen corresponding path program 2 times [2022-03-19 03:07:24,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 03:07:24,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409214569] [2022-03-19 03:07:24,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 03:07:24,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 03:07:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:24,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 03:07:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:24,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 03:07:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:24,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 03:07:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:24,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-19 03:07:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:24,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-03-19 03:07:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:24,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-03-19 03:07:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:24,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-03-19 03:07:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:24,375 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-19 03:07:24,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 03:07:24,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409214569] [2022-03-19 03:07:24,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409214569] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:07:24,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 03:07:24,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-19 03:07:24,377 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 03:07:24,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1993323259] [2022-03-19 03:07:24,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1993323259] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:07:24,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 03:07:24,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-19 03:07:24,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668732085] [2022-03-19 03:07:24,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 03:07:24,378 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-19 03:07:24,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 03:07:24,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-19 03:07:24,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-03-19 03:07:24,379 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-19 03:07:24,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 03:07:24,729 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-03-19 03:07:24,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-19 03:07:24,729 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2022-03-19 03:07:24,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 03:07:24,732 INFO L225 Difference]: With dead ends: 64 [2022-03-19 03:07:24,733 INFO L226 Difference]: Without dead ends: 48 [2022-03-19 03:07:24,733 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2022-03-19 03:07:24,734 INFO L912 BasicCegarLoop]: 30 mSDtfsCounter, 72 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 03:07:24,735 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 46 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 03:07:24,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-19 03:07:24,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-03-19 03:07:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-03-19 03:07:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-03-19 03:07:24,748 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 50 [2022-03-19 03:07:24,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 03:07:24,749 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-03-19 03:07:24,750 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-19 03:07:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-03-19 03:07:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-03-19 03:07:24,750 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 03:07:24,751 INFO L500 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 03:07:24,751 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-19 03:07:24,751 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 03:07:24,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 03:07:24,751 INFO L85 PathProgramCache]: Analyzing trace with hash 611931899, now seen corresponding path program 1 times [2022-03-19 03:07:24,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 03:07:24,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2146507766] [2022-03-19 03:07:24,752 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 03:07:24,752 INFO L85 PathProgramCache]: Analyzing trace with hash 611931899, now seen corresponding path program 2 times [2022-03-19 03:07:24,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 03:07:24,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129405652] [2022-03-19 03:07:24,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 03:07:24,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 03:07:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:24,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 03:07:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:24,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 03:07:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:24,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 03:07:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:24,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-19 03:07:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:24,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-03-19 03:07:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:24,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-03-19 03:07:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:24,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-03-19 03:07:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:07:24,986 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-19 03:07:24,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 03:07:24,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129405652] [2022-03-19 03:07:24,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129405652] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 03:07:24,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915451931] [2022-03-19 03:07:24,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 03:07:24,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 03:07:24,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 03:07:25,000 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 03:07:25,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-19 03:07:25,077 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 03:07:25,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 03:07:25,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-19 03:07:25,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 03:07:25,452 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-19 03:07:25,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 03:07:25,745 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-19 03:07:25,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915451931] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 03:07:25,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 03:07:25,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 14 [2022-03-19 03:07:25,746 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 03:07:25,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2146507766] [2022-03-19 03:07:25,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2146507766] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:07:25,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 03:07:25,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-19 03:07:25,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400363413] [2022-03-19 03:07:25,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 03:07:25,747 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-19 03:07:25,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 03:07:25,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-19 03:07:25,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-03-19 03:07:25,748 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-19 03:07:26,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 03:07:26,013 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-03-19 03:07:26,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-19 03:07:26,014 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2022-03-19 03:07:26,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 03:07:26,015 INFO L225 Difference]: With dead ends: 49 [2022-03-19 03:07:26,015 INFO L226 Difference]: Without dead ends: 0 [2022-03-19 03:07:26,015 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-03-19 03:07:26,017 INFO L912 BasicCegarLoop]: 27 mSDtfsCounter, 55 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 03:07:26,019 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 41 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 03:07:26,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-19 03:07:26,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-19 03:07:26,020 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-03-19 03:07:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-19 03:07:26,021 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2022-03-19 03:07:26,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 03:07:26,021 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-19 03:07:26,021 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-19 03:07:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-19 03:07:26,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-19 03:07:26,025 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-19 03:07:26,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-19 03:07:26,247 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 03:07:26,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-19 03:07:26,927 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2022-03-19 03:07:26,927 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2022-03-19 03:07:26,927 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 11) no Hoare annotation was computed. [2022-03-19 03:07:26,927 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2022-03-19 03:07:26,927 INFO L885 garLoopResultBuilder]: At program point L6(line 6) the Hoare annotation is: true [2022-03-19 03:07:26,927 INFO L885 garLoopResultBuilder]: At program point L6-2(lines 5 7) the Hoare annotation is: true [2022-03-19 03:07:26,927 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 5 7) the Hoare annotation is: true [2022-03-19 03:07:26,927 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 35 49) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-03-19 03:07:26,928 INFO L878 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (or (<= main_~n~0 (+ main_~l~1 main_~y~0)) (<= main_~n~0 (+ main_~l~1 main_~x~0))) (= .cse0 (select |#memory_int| |main_#t~malloc15.base|)))) [2022-03-19 03:07:26,928 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 35 49) the Hoare annotation is: true [2022-03-19 03:07:26,928 INFO L878 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (or (<= main_~n~0 (+ |main_#t~ret18| main_~x~0)) (<= main_~n~0 (+ |main_#t~ret18| main_~y~0))) (= .cse0 (select |#memory_int| |main_#t~malloc15.base|)))) [2022-03-19 03:07:26,928 INFO L885 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: true [2022-03-19 03:07:26,928 INFO L878 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc15.base|)))) [2022-03-19 03:07:26,928 INFO L878 garLoopResultBuilder]: At program point L43-1(line 43) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc15.base|)))) [2022-03-19 03:07:26,928 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 35 49) the Hoare annotation is: true [2022-03-19 03:07:26,928 INFO L878 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-03-19 03:07:26,928 INFO L878 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-03-19 03:07:26,928 INFO L878 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|)) [2022-03-19 03:07:26,928 INFO L878 garLoopResultBuilder]: At program point L38-1(line 38) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-03-19 03:07:26,928 INFO L878 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (or (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))) (and (not (<= |check_#in~n| (+ |check_#in~x| |check_#in~l|))) (not (<= |check_#in~n| (+ |check_#in~y| |check_#in~l|))))) [2022-03-19 03:07:26,928 INFO L885 garLoopResultBuilder]: At program point checkENTRY(lines 24 33) the Hoare annotation is: true [2022-03-19 03:07:26,929 INFO L878 garLoopResultBuilder]: At program point L31(lines 31 32) the Hoare annotation is: (let ((.cse0 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 (and (not (<= |check_#in~n| (+ |check_#in~x| |check_#in~l|))) (not (<= |check_#in~n| (+ |check_#in~y| |check_#in~l|)))) (let ((.cse1 (select |#memory_int| check_~a.base)) (.cse2 (* check_~i~0 4))) (and (or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x))) (= (select .cse1 (+ .cse2 (* 4 check_~x) check_~a.offset)) 0) (= (select .cse1 (+ .cse2 (* 4 check_~y) check_~a.offset)) 0)))) (or .cse0 (and (not (<= |check_#in~n| |check_#in~y|)) (not (<= |check_#in~n| |check_#in~x|))) (= check_~l 0) (not (= |check_#in~l| 0))))) [2022-03-19 03:07:26,929 INFO L885 garLoopResultBuilder]: At program point L32-1(line 32) the Hoare annotation is: true [2022-03-19 03:07:26,929 INFO L885 garLoopResultBuilder]: At program point L31-2(lines 24 33) the Hoare annotation is: true [2022-03-19 03:07:26,929 INFO L878 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 (and (not (<= |check_#in~n| (+ |check_#in~x| |check_#in~l|))) (not (<= |check_#in~n| (+ |check_#in~y| |check_#in~l|)))) (let ((.cse1 (select |#memory_int| check_~a.base)) (.cse2 (* check_~i~0 4))) (and (or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x))) (= |check_#t~mem11| |check_#t~mem10|) (= (select .cse1 (+ .cse2 (* 4 check_~x) check_~a.offset)) 0) (= (select .cse1 (+ .cse2 (* 4 check_~y) check_~a.offset)) 0)))) (or .cse0 (and (not (<= |check_#in~n| |check_#in~y|)) (not (<= |check_#in~n| |check_#in~x|))) (= check_~l 0) (not (= |check_#in~l| 0))))) [2022-03-19 03:07:26,929 INFO L878 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 (and (not (<= |check_#in~n| (+ |check_#in~x| |check_#in~l|))) (not (<= |check_#in~n| (+ |check_#in~y| |check_#in~l|)))) (let ((.cse1 (select |#memory_int| check_~a.base)) (.cse2 (* check_~i~0 4))) (and (or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x))) (= (select .cse1 (+ .cse2 (* 4 check_~x) check_~a.offset)) 0) (= (select .cse1 (+ .cse2 (* 4 check_~y) check_~a.offset)) 0)))) (or .cse0 (and (not (<= |check_#in~n| |check_#in~y|)) (not (<= |check_#in~n| |check_#in~x|))) (= check_~l 0) (not (= |check_#in~l| 0))))) [2022-03-19 03:07:26,929 INFO L878 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: (let ((.cse0 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 (and (not (<= |check_#in~n| (+ |check_#in~x| |check_#in~l|))) (not (<= |check_#in~n| (+ |check_#in~y| |check_#in~l|)))) (let ((.cse1 (select |#memory_int| check_~a.base)) (.cse2 (* check_~i~0 4))) (and (or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x))) (= |check_#t~mem11| |check_#t~mem10|) (= (select .cse1 (+ .cse2 (* 4 check_~x) check_~a.offset)) 0) (= (select .cse1 (+ .cse2 (* 4 check_~y) check_~a.offset)) 0)))) (or .cse0 (and (not (<= |check_#in~n| |check_#in~y|)) (not (<= |check_#in~n| |check_#in~x|))) (= check_~l 0) (not (= |check_#in~l| 0))))) [2022-03-19 03:07:26,929 INFO L878 garLoopResultBuilder]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse0 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 (and (not (<= |check_#in~n| (+ |check_#in~x| |check_#in~l|))) (not (<= |check_#in~n| (+ |check_#in~y| |check_#in~l|)))) (let ((.cse1 (select |#memory_int| check_~a.base)) (.cse2 (* check_~i~0 4))) (and (or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x))) (= (select .cse1 (+ .cse2 (* 4 check_~x) check_~a.offset)) 0) (= (select .cse1 (+ .cse2 (* 4 check_~y) check_~a.offset)) 0)))) (or .cse0 (and (not (<= |check_#in~n| |check_#in~y|)) (not (<= |check_#in~n| |check_#in~x|))) (= check_~l 0) (not (= |check_#in~l| 0))))) [2022-03-19 03:07:26,929 INFO L885 garLoopResultBuilder]: At program point checkEXIT(lines 24 33) the Hoare annotation is: true [2022-03-19 03:07:26,929 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-03-19 03:07:26,929 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-19 03:07:26,929 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-03-19 03:07:26,929 INFO L878 garLoopResultBuilder]: At program point L18-1(line 18) the Hoare annotation is: (let ((.cse0 (= |lcp_#in~x| lcp_~x)) (.cse1 (= |lcp_#in~y| lcp_~y)) (.cse2 (= |lcp_#in~n| lcp_~n)) (.cse3 (= |lcp_#in~a.base| lcp_~a.base))) (or (and .cse0 .cse1 .cse2 .cse3 (or (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))) (and |lcp_#t~short7| .cse0 .cse1 .cse2 .cse3))) [2022-03-19 03:07:26,930 INFO L878 garLoopResultBuilder]: At program point lcpFINAL(lines 16 22) the Hoare annotation is: (let ((.cse0 (= |lcp_#in~a.base| lcp_~a.base))) (or (and .cse0 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |lcp_#in~a.base|)))) (and (= |lcp_#in~x| lcp_~x) (= |lcp_#in~y| lcp_~y) (= |lcp_#in~n| lcp_~n) (or (<= |lcp_#in~n| (+ |lcp_#in~x| |lcp_#res|)) (<= |lcp_#in~n| (+ |lcp_#in~y| |lcp_#res|))) .cse0 (or (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))))) [2022-03-19 03:07:26,930 INFO L878 garLoopResultBuilder]: At program point L18-3(lines 18 20) the Hoare annotation is: (let ((.cse0 (= |lcp_#in~x| lcp_~x)) (.cse1 (= |lcp_#in~y| lcp_~y)) (.cse2 (= |lcp_#in~n| lcp_~n)) (.cse3 (= |lcp_#in~a.base| lcp_~a.base))) (or (and (or |lcp_#t~short7| (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |lcp_#in~a.base|)))) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (or (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))))) [2022-03-19 03:07:26,930 INFO L878 garLoopResultBuilder]: At program point L18-5(lines 18 20) the Hoare annotation is: (and (= |lcp_#in~x| lcp_~x) (= |lcp_#in~y| lcp_~y) (= |lcp_#in~n| lcp_~n) (= |lcp_#in~a.base| lcp_~a.base)) [2022-03-19 03:07:26,930 INFO L878 garLoopResultBuilder]: At program point L18-6(lines 18 20) the Hoare annotation is: (let ((.cse0 (= |lcp_#in~a.base| lcp_~a.base))) (or (and .cse0 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |lcp_#in~a.base|)))) (and (= |lcp_#in~x| lcp_~x) (= |lcp_#in~y| lcp_~y) (= |lcp_#in~n| lcp_~n) .cse0 (or (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))))) [2022-03-19 03:07:26,930 INFO L878 garLoopResultBuilder]: At program point lcpEXIT(lines 16 22) the Hoare annotation is: (let ((.cse0 (= |lcp_#in~a.base| lcp_~a.base))) (or (and .cse0 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |lcp_#in~a.base|)))) (and (= |lcp_#in~x| lcp_~x) (= |lcp_#in~y| lcp_~y) (= |lcp_#in~n| lcp_~n) (or (<= |lcp_#in~n| (+ |lcp_#in~x| |lcp_#res|)) (<= |lcp_#in~n| (+ |lcp_#in~y| |lcp_#res|))) .cse0 (or (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))))) [2022-03-19 03:07:26,930 INFO L885 garLoopResultBuilder]: At program point lcpENTRY(lines 16 22) the Hoare annotation is: true [2022-03-19 03:07:26,930 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-03-19 03:07:26,930 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-19 03:07:26,930 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-19 03:07:26,930 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-03-19 03:07:26,930 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 12 14) the Hoare annotation is: true [2022-03-19 03:07:26,930 INFO L878 garLoopResultBuilder]: At program point L13(line 13) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-03-19 03:07:26,930 INFO L878 garLoopResultBuilder]: At program point L13-1(line 13) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-03-19 03:07:26,931 INFO L878 garLoopResultBuilder]: At program point L13-3(lines 12 14) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-03-19 03:07:26,931 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 12 14) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-03-19 03:07:26,931 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-03-19 03:07:26,931 INFO L878 garLoopResultBuilder]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-03-19 03:07:26,931 INFO L878 garLoopResultBuilder]: At program point #Ultimate.meminitEXIT(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2022-03-19 03:07:26,931 INFO L878 garLoopResultBuilder]: At program point #Ultimate.meminitFINAL(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2022-03-19 03:07:26,933 INFO L718 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2] [2022-03-19 03:07:26,934 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-19 03:07:26,961 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:259) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.getLongDescription(ProcedureContractResult.java:74) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createProcedureContractResults(TraceAbstractionStarter.java:499) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-03-19 03:07:26,964 INFO L158 Benchmark]: Toolchain (without parser) took 5155.25ms. Allocated memory was 224.4MB in the beginning and 386.9MB in the end (delta: 162.5MB). Free memory was 169.2MB in the beginning and 175.7MB in the end (delta: -6.6MB). Peak memory consumption was 157.5MB. Max. memory is 8.0GB. [2022-03-19 03:07:26,964 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 224.4MB. Free memory was 185.5MB in the beginning and 185.4MB in the end (delta: 126.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-19 03:07:26,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.87ms. Allocated memory was 224.4MB in the beginning and 386.9MB in the end (delta: 162.5MB). Free memory was 169.0MB in the beginning and 357.5MB in the end (delta: -188.5MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2022-03-19 03:07:26,964 INFO L158 Benchmark]: Boogie Preprocessor took 27.10ms. Allocated memory is still 386.9MB. Free memory was 357.5MB in the beginning and 355.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-19 03:07:26,964 INFO L158 Benchmark]: RCFGBuilder took 363.62ms. Allocated memory is still 386.9MB. Free memory was 355.9MB in the beginning and 340.7MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-03-19 03:07:26,965 INFO L158 Benchmark]: TraceAbstraction took 4481.00ms. Allocated memory is still 386.9MB. Free memory was 340.2MB in the beginning and 175.7MB in the end (delta: 164.4MB). Peak memory consumption was 166.0MB. Max. memory is 8.0GB. [2022-03-19 03:07:26,966 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.17ms. Allocated memory is still 224.4MB. Free memory was 185.5MB in the beginning and 185.4MB in the end (delta: 126.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 278.87ms. Allocated memory was 224.4MB in the beginning and 386.9MB in the end (delta: 162.5MB). Free memory was 169.0MB in the beginning and 357.5MB in the end (delta: -188.5MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.10ms. Allocated memory is still 386.9MB. Free memory was 357.5MB in the beginning and 355.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 363.62ms. Allocated memory is still 386.9MB. Free memory was 355.9MB in the beginning and 340.7MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 4481.00ms. Allocated memory is still 386.9MB. Free memory was 340.2MB in the beginning and 175.7MB in the end (delta: 164.4MB). Peak memory consumption was 166.0MB. 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: 13]: 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 9 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 325 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 317 mSDsluCounter, 219 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 180 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1343 IncrementalHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 180 mSolverCounterUnsat, 159 mSDtfsCounter, 1343 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 249 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 49 LocationsWithAnnotation, 155 PreInvPairs, 223 NumberOfFragments, 849 HoareAnnotationTreeSize, 155 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 49 FomulaSimplificationsInter, 842 FormulaSimplificationTreeSizeReductionInter, 0.6s 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: 18]: Loop Invariant Derived loop invariant: ((\old(x) == x && \old(y) == y) && \old(n) == n) && a == a - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:259) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-19 03:07:27,010 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...