/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/nec40.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:42:21,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:42:21,006 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:42:21,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:42:21,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:42:21,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:42:21,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:42:21,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:42:21,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:42:21,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:42:21,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:42:21,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:42:21,067 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:42:21,069 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:42:21,070 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:42:21,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:42:21,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:42:21,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:42:21,076 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:42:21,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:42:21,082 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:42:21,083 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:42:21,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:42:21,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:42:21,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:42:21,093 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:42:21,093 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:42:21,093 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:42:21,094 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:42:21,095 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:42:21,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:42:21,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:42:21,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:42:21,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:42:21,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:42:21,099 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:42:21,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:42:21,100 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:42:21,100 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:42:21,100 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:42:21,101 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:42:21,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:42:21,104 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 05:42:21,114 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:42:21,115 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:42:21,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:42:21,117 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:42:21,117 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:42:21,117 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:42:21,117 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:42:21,117 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:42:21,118 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:42:21,118 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:42:21,119 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:42:21,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:42:21,119 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:42:21,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:42:21,119 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:42:21,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:42:21,120 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:42:21,120 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:42:21,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:42:21,120 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:42:21,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:42:21,121 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:42:21,121 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:42:21,121 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:42:21,121 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:42:21,121 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 05:42:21,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:42:21,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:42:21,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:42:21,404 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:42:21,404 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:42:21,405 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/nec40.c [2022-04-15 05:42:21,458 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/845f55b46/69ea23c20b1e46b7b9262b8a34175660/FLAG9c1f42ee3 [2022-04-15 05:42:21,835 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:42:21,835 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/nec40.c [2022-04-15 05:42:21,841 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/845f55b46/69ea23c20b1e46b7b9262b8a34175660/FLAG9c1f42ee3 [2022-04-15 05:42:22,249 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/845f55b46/69ea23c20b1e46b7b9262b8a34175660 [2022-04-15 05:42:22,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:42:22,252 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:42:22,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:42:22,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:42:22,262 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:42:22,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:42:22" (1/1) ... [2022-04-15 05:42:22,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@178ad57b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:22, skipping insertion in model container [2022-04-15 05:42:22,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:42:22" (1/1) ... [2022-04-15 05:42:22,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:42:22,279 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:42:22,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/nec40.c[317,330] [2022-04-15 05:42:22,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:42:22,466 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:42:22,480 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/nec40.c[317,330] [2022-04-15 05:42:22,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:42:22,505 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:42:22,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:22 WrapperNode [2022-04-15 05:42:22,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:42:22,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:42:22,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:42:22,508 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:42:22,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:22" (1/1) ... [2022-04-15 05:42:22,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:22" (1/1) ... [2022-04-15 05:42:22,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:22" (1/1) ... [2022-04-15 05:42:22,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:22" (1/1) ... [2022-04-15 05:42:22,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:22" (1/1) ... [2022-04-15 05:42:22,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:22" (1/1) ... [2022-04-15 05:42:22,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:22" (1/1) ... [2022-04-15 05:42:22,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:42:22,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:42:22,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:42:22,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:42:22,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:22" (1/1) ... [2022-04-15 05:42:22,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:42:22,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:22,584 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 05:42:22,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 05:42:22,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:42:22,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:42:22,633 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:42:22,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 05:42:22,633 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:42:22,633 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:42:22,633 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:42:22,633 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:42:22,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:42:22,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 05:42:22,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 05:42:22,635 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:42:22,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:42:22,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:42:22,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:42:22,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:42:22,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:42:22,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:42:22,715 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:42:22,717 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:42:22,891 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:42:22,896 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:42:22,896 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 05:42:22,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:42:22 BoogieIcfgContainer [2022-04-15 05:42:22,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:42:22,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:42:22,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:42:22,903 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:42:22,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:42:22" (1/3) ... [2022-04-15 05:42:22,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193dd21e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:42:22, skipping insertion in model container [2022-04-15 05:42:22,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:22" (2/3) ... [2022-04-15 05:42:22,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193dd21e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:42:22, skipping insertion in model container [2022-04-15 05:42:22,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:42:22" (3/3) ... [2022-04-15 05:42:22,905 INFO L111 eAbstractionObserver]: Analyzing ICFG nec40.c [2022-04-15 05:42:22,909 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:42:22,910 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:42:22,959 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:42:22,976 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 05:42:22,976 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:42:22,999 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.4) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:42:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 05:42:23,005 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:23,005 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:23,006 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:23,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:23,014 INFO L85 PathProgramCache]: Analyzing trace with hash -723254197, now seen corresponding path program 1 times [2022-04-15 05:42:23,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:23,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1940739844] [2022-04-15 05:42:23,031 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:42:23,031 INFO L85 PathProgramCache]: Analyzing trace with hash -723254197, now seen corresponding path program 2 times [2022-04-15 05:42:23,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:23,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147777277] [2022-04-15 05:42:23,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:23,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:23,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:23,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~#x~0.base, ~#x~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);~#y~0.base, ~#y~0.offset := 5, 0;call #Ultimate.allocInit(100, 5);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0;~j~0 := 0;~k~0 := 0; {26#true} is VALID [2022-04-15 05:42:23,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 05:42:23,320 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #51#return; {26#true} is VALID [2022-04-15 05:42:23,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:23,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~#x~0.base, ~#x~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);~#y~0.base, ~#y~0.offset := 5, 0;call #Ultimate.allocInit(100, 5);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0;~j~0 := 0;~k~0 := 0; {26#true} is VALID [2022-04-15 05:42:23,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 05:42:23,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #51#return; {26#true} is VALID [2022-04-15 05:42:23,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret9 := main(); {26#true} is VALID [2022-04-15 05:42:23,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~i~0 := 0; {26#true} is VALID [2022-04-15 05:42:23,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-15 05:42:23,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#false} call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); {27#false} is VALID [2022-04-15 05:42:23,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} assume ~k~0 >= 0 && ~k~0 < ~i~0;call #t~mem8 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); {27#false} is VALID [2022-04-15 05:42:23,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 != #t~mem8;havoc #t~mem8; {27#false} is VALID [2022-04-15 05:42:23,326 INFO L272 TraceCheckUtils]: 10: Hoare triple {27#false} call __VERIFIER_assert(0); {27#false} is VALID [2022-04-15 05:42:23,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-15 05:42:23,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-15 05:42:23,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-15 05:42:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:42:23,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:23,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147777277] [2022-04-15 05:42:23,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147777277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:23,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:23,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:42:23,333 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:23,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1940739844] [2022-04-15 05:42:23,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1940739844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:23,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:23,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:42:23,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879784105] [2022-04-15 05:42:23,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:23,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 05:42:23,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:23,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:23,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:23,365 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 05:42:23,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:23,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 05:42:23,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:42:23,396 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.4) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:23,494 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-15 05:42:23,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 05:42:23,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 05:42:23,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:23,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-04-15 05:42:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-04-15 05:42:23,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2022-04-15 05:42:23,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:23,596 INFO L225 Difference]: With dead ends: 38 [2022-04-15 05:42:23,596 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 05:42:23,598 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:42:23,604 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:23,605 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 28 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:42:23,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 05:42:23,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 05:42:23,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:23,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:23,636 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:23,637 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:23,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:23,643 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 05:42:23,643 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 05:42:23,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:23,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:23,645 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 05:42:23,646 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 05:42:23,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:23,654 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 05:42:23,654 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 05:42:23,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:23,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:23,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:23,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:23,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:23,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-15 05:42:23,658 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-15 05:42:23,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:23,659 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-15 05:42:23,660 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:23,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-15 05:42:23,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:23,685 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 05:42:23,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 05:42:23,685 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:23,685 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:23,686 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:42:23,686 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:23,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:23,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1522809640, now seen corresponding path program 1 times [2022-04-15 05:42:23,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:23,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1891341536] [2022-04-15 05:42:23,688 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:42:23,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1522809640, now seen corresponding path program 2 times [2022-04-15 05:42:23,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:23,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768867871] [2022-04-15 05:42:23,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:23,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:23,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:23,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {180#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~#x~0.base, ~#x~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);~#y~0.base, ~#y~0.offset := 5, 0;call #Ultimate.allocInit(100, 5);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0;~j~0 := 0;~k~0 := 0; {174#true} is VALID [2022-04-15 05:42:23,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#true} assume true; {174#true} is VALID [2022-04-15 05:42:23,819 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {174#true} {174#true} #51#return; {174#true} is VALID [2022-04-15 05:42:23,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {174#true} call ULTIMATE.init(); {180#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:23,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~#x~0.base, ~#x~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);~#y~0.base, ~#y~0.offset := 5, 0;call #Ultimate.allocInit(100, 5);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0;~j~0 := 0;~k~0 := 0; {174#true} is VALID [2022-04-15 05:42:23,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {174#true} assume true; {174#true} is VALID [2022-04-15 05:42:23,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {174#true} {174#true} #51#return; {174#true} is VALID [2022-04-15 05:42:23,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {174#true} call #t~ret9 := main(); {174#true} is VALID [2022-04-15 05:42:23,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {174#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~i~0 := 0; {179#(= ~i~0 0)} is VALID [2022-04-15 05:42:23,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {179#(= ~i~0 0)} call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); {179#(= ~i~0 0)} is VALID [2022-04-15 05:42:23,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {179#(= ~i~0 0)} assume !(0 != #t~mem5);havoc #t~mem5; {179#(= ~i~0 0)} is VALID [2022-04-15 05:42:23,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {179#(= ~i~0 0)} call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); {179#(= ~i~0 0)} is VALID [2022-04-15 05:42:23,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {179#(= ~i~0 0)} assume ~k~0 >= 0 && ~k~0 < ~i~0;call #t~mem8 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); {175#false} is VALID [2022-04-15 05:42:23,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {175#false} assume 0 != #t~mem8;havoc #t~mem8; {175#false} is VALID [2022-04-15 05:42:23,824 INFO L272 TraceCheckUtils]: 11: Hoare triple {175#false} call __VERIFIER_assert(0); {175#false} is VALID [2022-04-15 05:42:23,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {175#false} ~cond := #in~cond; {175#false} is VALID [2022-04-15 05:42:23,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {175#false} assume 0 == ~cond; {175#false} is VALID [2022-04-15 05:42:23,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {175#false} assume !false; {175#false} is VALID [2022-04-15 05:42:23,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:42:23,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:23,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768867871] [2022-04-15 05:42:23,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768867871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:23,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:23,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:42:23,826 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:23,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1891341536] [2022-04-15 05:42:23,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1891341536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:23,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:23,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:42:23,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256492294] [2022-04-15 05:42:23,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:23,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 05:42:23,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:23,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:23,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:23,842 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:42:23,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:23,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:42:23,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:42:23,844 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:23,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:23,947 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 05:42:23,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:42:23,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 05:42:23,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:23,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:23,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-15 05:42:23,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:23,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-15 05:42:23,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-04-15 05:42:23,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:23,984 INFO L225 Difference]: With dead ends: 26 [2022-04-15 05:42:23,984 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 05:42:23,985 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:42:23,987 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:23,991 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 17 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:42:23,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 05:42:24,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 05:42:24,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:24,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:24,003 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:24,003 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:24,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:24,005 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 05:42:24,005 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 05:42:24,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:24,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:24,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 05:42:24,006 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 05:42:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:24,007 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 05:42:24,007 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 05:42:24,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:24,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:24,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:24,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:24,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:24,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-15 05:42:24,009 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2022-04-15 05:42:24,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:24,009 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-15 05:42:24,010 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:24,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-15 05:42:24,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:24,028 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 05:42:24,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 05:42:24,029 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:24,029 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:24,029 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 05:42:24,029 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:24,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:24,030 INFO L85 PathProgramCache]: Analyzing trace with hash -521364141, now seen corresponding path program 1 times [2022-04-15 05:42:24,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:24,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [3492868] [2022-04-15 05:42:24,044 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:24,044 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:24,045 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:24,045 INFO L85 PathProgramCache]: Analyzing trace with hash -521364141, now seen corresponding path program 2 times [2022-04-15 05:42:24,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:24,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897259433] [2022-04-15 05:42:24,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:24,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:24,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:24,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {317#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~#x~0.base, ~#x~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);~#y~0.base, ~#y~0.offset := 5, 0;call #Ultimate.allocInit(100, 5);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0;~j~0 := 0;~k~0 := 0; {314#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} is VALID [2022-04-15 05:42:24,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} assume true; {314#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} is VALID [2022-04-15 05:42:24,213 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {314#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} {309#true} #51#return; {314#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} is VALID [2022-04-15 05:42:24,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {309#true} call ULTIMATE.init(); {317#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:24,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {317#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~#x~0.base, ~#x~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);~#y~0.base, ~#y~0.offset := 5, 0;call #Ultimate.allocInit(100, 5);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0;~j~0 := 0;~k~0 := 0; {314#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} is VALID [2022-04-15 05:42:24,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} assume true; {314#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} is VALID [2022-04-15 05:42:24,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} {309#true} #51#return; {314#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} is VALID [2022-04-15 05:42:24,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {314#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} call #t~ret9 := main(); {314#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} is VALID [2022-04-15 05:42:24,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {314#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~i~0 := 0; {315#(and (= (select (select |#memory_int| |~#x~0.base|) (+ ~i~0 |~#x~0.offset|)) 0) (not (= |~#x~0.base| |~#y~0.base|)))} is VALID [2022-04-15 05:42:24,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {315#(and (= (select (select |#memory_int| |~#x~0.base|) (+ ~i~0 |~#x~0.offset|)) 0) (not (= |~#x~0.base| |~#y~0.base|)))} call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); {316#(and (= (select (select |#memory_int| |~#x~0.base|) (+ ~i~0 |~#x~0.offset|)) 0) (not (= |~#x~0.base| |~#y~0.base|)) (= |main_#t~mem5| 0))} is VALID [2022-04-15 05:42:24,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {316#(and (= (select (select |#memory_int| |~#x~0.base|) (+ ~i~0 |~#x~0.offset|)) 0) (not (= |~#x~0.base| |~#y~0.base|)) (= |main_#t~mem5| 0))} assume !!(0 != #t~mem5);havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1);call write~int(#t~mem6, ~#y~0.base, ~#y~0.offset + ~i~0, 1);havoc #t~mem6;#t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {310#false} is VALID [2022-04-15 05:42:24,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {310#false} call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); {310#false} is VALID [2022-04-15 05:42:24,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {310#false} assume !(0 != #t~mem5);havoc #t~mem5; {310#false} is VALID [2022-04-15 05:42:24,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {310#false} call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); {310#false} is VALID [2022-04-15 05:42:24,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {310#false} assume ~k~0 >= 0 && ~k~0 < ~i~0;call #t~mem8 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); {310#false} is VALID [2022-04-15 05:42:24,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {310#false} assume 0 != #t~mem8;havoc #t~mem8; {310#false} is VALID [2022-04-15 05:42:24,226 INFO L272 TraceCheckUtils]: 13: Hoare triple {310#false} call __VERIFIER_assert(0); {310#false} is VALID [2022-04-15 05:42:24,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {310#false} ~cond := #in~cond; {310#false} is VALID [2022-04-15 05:42:24,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {310#false} assume 0 == ~cond; {310#false} is VALID [2022-04-15 05:42:24,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {310#false} assume !false; {310#false} is VALID [2022-04-15 05:42:24,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:42:24,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:24,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897259433] [2022-04-15 05:42:24,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897259433] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:24,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:24,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:42:24,228 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:24,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [3492868] [2022-04-15 05:42:24,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [3492868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:24,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:24,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:42:24,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26111754] [2022-04-15 05:42:24,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:24,229 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 05:42:24,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:24,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:24,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:24,251 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:42:24,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:24,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:42:24,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 05:42:24,252 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:24,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:24,353 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 05:42:24,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 05:42:24,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 05:42:24,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-15 05:42:24,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:24,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-15 05:42:24,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2022-04-15 05:42:24,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:24,376 INFO L225 Difference]: With dead ends: 18 [2022-04-15 05:42:24,376 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 05:42:24,377 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-15 05:42:24,379 INFO L913 BasicCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:24,385 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 10 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:42:24,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 05:42:24,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 05:42:24,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:24,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 05:42:24,387 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 05:42:24,387 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 05:42:24,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:24,387 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 05:42:24,387 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 05:42:24,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:24,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:24,388 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-04-15 05:42:24,388 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-04-15 05:42:24,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:24,388 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 05:42:24,388 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 05:42:24,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:24,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:24,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:24,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:24,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 05:42:24,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 05:42:24,389 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-04-15 05:42:24,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:24,392 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 05:42:24,393 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:24,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 05:42:24,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:24,394 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 05:42:24,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:24,397 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 05:42:24,398 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 05:42:24,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 05:42:24,590 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 05:42:24,590 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 05:42:24,590 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 05:42:24,590 INFO L878 garLoopResultBuilder]: At program point L27(lines 27 28) the Hoare annotation is: (or (= |~#x~0.base| |~#y~0.base|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (not (= |old(~i~0)| 0))) [2022-04-15 05:42:24,591 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 16 31) the Hoare annotation is: true [2022-04-15 05:42:24,591 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 16 31) the Hoare annotation is: true [2022-04-15 05:42:24,591 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 16 31) the Hoare annotation is: (or (= |~#x~0.base| |~#y~0.base|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (not (= |old(~i~0)| 0)) (and (= ~i~0 0) (= |#memory_int| |old(#memory_int)|) (= ~k~0 |old(~k~0)|))) [2022-04-15 05:42:24,591 INFO L878 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (or (= |~#x~0.base| |~#y~0.base|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (not (= |old(~i~0)| 0))) [2022-04-15 05:42:24,591 INFO L878 garLoopResultBuilder]: At program point L26(lines 26 28) the Hoare annotation is: (or (= ~i~0 0) (= |~#x~0.base| |~#y~0.base|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (not (= |old(~i~0)| 0))) [2022-04-15 05:42:24,592 INFO L885 garLoopResultBuilder]: At program point L26-1(lines 26 28) the Hoare annotation is: true [2022-04-15 05:42:24,592 INFO L878 garLoopResultBuilder]: At program point L20-1(lines 20 23) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (= |~#x~0.base| |~#y~0.base|) (and (= .cse0 (select |#memory_int| |~#x~0.base|)) (= ~i~0 0) (= |main_#t~mem5| 0)) (not (= .cse0 (select |old(#memory_int)| |~#x~0.base|))) (not (= |old(~i~0)| 0)))) [2022-04-15 05:42:24,593 INFO L878 garLoopResultBuilder]: At program point L20-3(lines 20 23) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (= .cse0 (select |#memory_int| |~#x~0.base|)) (= ~i~0 0)) (= |~#x~0.base| |~#y~0.base|) (not (= .cse0 (select |old(#memory_int)| |~#x~0.base|))) (not (= |old(~i~0)| 0)))) [2022-04-15 05:42:24,593 INFO L878 garLoopResultBuilder]: At program point L20-4(lines 20 23) the Hoare annotation is: (or (= ~i~0 0) (= |~#x~0.base| |~#y~0.base|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (not (= |old(~i~0)| 0))) [2022-04-15 05:42:24,593 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)) (= ~i~0 0)) [2022-04-15 05:42:24,593 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 05:42:24,593 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)) (= ~i~0 0)) [2022-04-15 05:42:24,593 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 05:42:24,594 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)) (= ~i~0 0)) [2022-04-15 05:42:24,605 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 05:42:24,605 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 05:42:24,605 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-15 05:42:24,621 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: true [2022-04-15 05:42:24,622 INFO L885 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: true [2022-04-15 05:42:24,622 INFO L885 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: true [2022-04-15 05:42:24,622 INFO L885 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2022-04-15 05:42:24,622 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: true [2022-04-15 05:42:24,625 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-15 05:42:24,641 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 05:42:24,652 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 05:42:24,656 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 05:42:24,662 INFO L163 areAnnotationChecker]: CFG has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 05:42:24,666 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:262) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) 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.InvariantResult.getLongDescription(InvariantResult.java:65) 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.createInvariantResults(TraceAbstractionStarter.java:444) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) 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-04-15 05:42:24,672 INFO L158 Benchmark]: Toolchain (without parser) took 2419.85ms. Allocated memory was 174.1MB in the beginning and 210.8MB in the end (delta: 36.7MB). Free memory was 122.2MB in the beginning and 186.5MB in the end (delta: -64.3MB). Peak memory consumption was 94.5MB. Max. memory is 8.0GB. [2022-04-15 05:42:24,672 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 174.1MB. Free memory was 139.0MB in the beginning and 138.9MB in the end (delta: 69.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 05:42:24,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.35ms. Allocated memory was 174.1MB in the beginning and 210.8MB in the end (delta: 36.7MB). Free memory was 122.0MB in the beginning and 187.9MB in the end (delta: -65.9MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-04-15 05:42:24,672 INFO L158 Benchmark]: Boogie Preprocessor took 45.55ms. Allocated memory is still 210.8MB. Free memory was 187.9MB in the beginning and 185.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 05:42:24,673 INFO L158 Benchmark]: RCFGBuilder took 344.19ms. Allocated memory is still 210.8MB. Free memory was 185.8MB in the beginning and 173.8MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 05:42:24,673 INFO L158 Benchmark]: TraceAbstraction took 1771.52ms. Allocated memory is still 210.8MB. Free memory was 173.2MB in the beginning and 186.5MB in the end (delta: -13.2MB). Peak memory consumption was 107.3MB. Max. memory is 8.0GB. [2022-04-15 05:42:24,675 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 174.1MB. Free memory was 139.0MB in the beginning and 138.9MB in the end (delta: 69.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 252.35ms. Allocated memory was 174.1MB in the beginning and 210.8MB in the end (delta: 36.7MB). Free memory was 122.0MB in the beginning and 187.9MB in the end (delta: -65.9MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.55ms. Allocated memory is still 210.8MB. Free memory was 187.9MB in the beginning and 185.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 344.19ms. Allocated memory is still 210.8MB. Free memory was 185.8MB in the beginning and 173.8MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1771.52ms. Allocated memory is still 210.8MB. Free memory was 173.2MB in the beginning and 186.5MB in the end (delta: -13.2MB). Peak memory consumption was 107.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 55 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 41 mSDtfsCounter, 44 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 14, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 35 PreInvPairs, 48 NumberOfFragments, 229 HoareAnnotationTreeSize, 35 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 21 FormulaSimplificationTreeSizeReductionInter, 0.1s 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 - 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:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 05:42:24,714 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...