/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/n.c40.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:41:58,970 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:41:58,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:41:59,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:41:59,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:41:59,046 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:41:59,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:41:59,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:41:59,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:41:59,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:41:59,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:41:59,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:41:59,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:41:59,063 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:41:59,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:41:59,067 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:41:59,068 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:41:59,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:41:59,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:41:59,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:41:59,079 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:41:59,080 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:41:59,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:41:59,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:41:59,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:41:59,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:41:59,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:41:59,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:41:59,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:41:59,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:41:59,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:41:59,094 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:41:59,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:41:59,095 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:41:59,096 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:41:59,096 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:41:59,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:41:59,097 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:41:59,097 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:41:59,097 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:41:59,098 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:41:59,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:41:59,100 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 02:41:59,111 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:41:59,112 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:41:59,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:41:59,113 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 02:41:59,113 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:41:59,113 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 02:41:59,113 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:41:59,113 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:41:59,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:41:59,114 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:41:59,115 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 02:41:59,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:41:59,115 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:41:59,115 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:41:59,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:41:59,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:41:59,115 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 02:41:59,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:41:59,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:41:59,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:41:59,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 02:41:59,116 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 02:41:59,116 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 02:41:59,116 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:41:59,116 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 02:41:59,117 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-28 02:41:59,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:41:59,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:41:59,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:41:59,363 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:41:59,364 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:41:59,365 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/n.c40.c [2022-04-28 02:41:59,435 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e50a3076/d6c3243f3f07444fb36a10af843cbedc/FLAG78fcf4afb [2022-04-28 02:41:59,763 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:41:59,764 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/n.c40.c [2022-04-28 02:41:59,769 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e50a3076/d6c3243f3f07444fb36a10af843cbedc/FLAG78fcf4afb [2022-04-28 02:42:00,169 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e50a3076/d6c3243f3f07444fb36a10af843cbedc [2022-04-28 02:42:00,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:42:00,173 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 02:42:00,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:42:00,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:42:00,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:42:00,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:42:00" (1/1) ... [2022-04-28 02:42:00,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6385b181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:00, skipping insertion in model container [2022-04-28 02:42:00,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:42:00" (1/1) ... [2022-04-28 02:42:00,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:42:00,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:42:00,392 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/n.c40.c[498,511] [2022-04-28 02:42:00,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:42:00,418 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:42:00,445 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/n.c40.c[498,511] [2022-04-28 02:42:00,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:42:00,459 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:42:00,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:00 WrapperNode [2022-04-28 02:42:00,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:42:00,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:42:00,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:42:00,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:42:00,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:00" (1/1) ... [2022-04-28 02:42:00,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:00" (1/1) ... [2022-04-28 02:42:00,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:00" (1/1) ... [2022-04-28 02:42:00,481 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:00" (1/1) ... [2022-04-28 02:42:00,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:00" (1/1) ... [2022-04-28 02:42:00,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:00" (1/1) ... [2022-04-28 02:42:00,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:00" (1/1) ... [2022-04-28 02:42:00,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:42:00,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:42:00,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:42:00,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:42:00,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:00" (1/1) ... [2022-04-28 02:42:00,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:42:00,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:00,540 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-28 02:42:00,551 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-28 02:42:00,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:42:00,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:42:00,581 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:42:00,581 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:42:00,581 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:42:00,581 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:42:00,581 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:42:00,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:42:00,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 02:42:00,581 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:42:00,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:42:00,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:42:00,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:42:00,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:42:00,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:42:00,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:42:00,662 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:42:00,663 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:42:00,820 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:42:00,828 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:42:00,829 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 02:42:00,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:42:00 BoogieIcfgContainer [2022-04-28 02:42:00,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:42:00,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:42:00,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:42:00,837 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:42:00,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:42:00" (1/3) ... [2022-04-28 02:42:00,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27241ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:42:00, skipping insertion in model container [2022-04-28 02:42:00,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:00" (2/3) ... [2022-04-28 02:42:00,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27241ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:42:00, skipping insertion in model container [2022-04-28 02:42:00,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:42:00" (3/3) ... [2022-04-28 02:42:00,840 INFO L111 eAbstractionObserver]: Analyzing ICFG n.c40.c [2022-04-28 02:42:00,854 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:42:00,854 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:42:00,894 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:42:00,900 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@68cbdff3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5cc40532 [2022-04-28 02:42:00,900 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:42:00,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:42:00,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 02:42:00,920 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:00,920 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:00,921 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:00,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:00,928 INFO L85 PathProgramCache]: Analyzing trace with hash 486483065, now seen corresponding path program 1 times [2022-04-28 02:42:00,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:00,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [363407917] [2022-04-28 02:42:00,952 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:42:00,953 INFO L85 PathProgramCache]: Analyzing trace with hash 486483065, now seen corresponding path program 2 times [2022-04-28 02:42:00,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:00,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006174966] [2022-04-28 02:42:00,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:00,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:01,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:01,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(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; {21#true} is VALID [2022-04-28 02:42:01,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 02:42:01,235 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #40#return; {21#true} is VALID [2022-04-28 02:42:01,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {26#(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-28 02:42:01,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(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; {21#true} is VALID [2022-04-28 02:42:01,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 02:42:01,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #40#return; {21#true} is VALID [2022-04-28 02:42:01,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret9 := main(); {21#true} is VALID [2022-04-28 02:42:01,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~i~0 := 0; {21#true} is VALID [2022-04-28 02:42:01,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-28 02:42:01,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {22#false} call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); {22#false} is VALID [2022-04-28 02:42:01,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} assume ~k~0 >= 0 && ~k~0 < ~i~0;call #t~mem8 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); {22#false} is VALID [2022-04-28 02:42:01,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == #t~mem8;havoc #t~mem8; {22#false} is VALID [2022-04-28 02:42:01,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-28 02:42:01,243 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-28 02:42:01,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:01,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006174966] [2022-04-28 02:42:01,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006174966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:01,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:01,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:42:01,250 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:01,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [363407917] [2022-04-28 02:42:01,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [363407917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:01,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:01,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:42:01,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402752943] [2022-04-28 02:42:01,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:01,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 02:42:01,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:01,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:01,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:01,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 02:42:01,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:01,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 02:42:01,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 02:42:01,317 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:01,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:01,439 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-28 02:42:01,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 02:42:01,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 02:42:01,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:01,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:01,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-28 02:42:01,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:01,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-28 02:42:01,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-28 02:42:01,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:01,517 INFO L225 Difference]: With dead ends: 28 [2022-04-28 02:42:01,518 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 02:42:01,522 INFO L412 NwaCegarLoop]: 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-28 02:42:01,526 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:01,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:42:01,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 02:42:01,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-28 02:42:01,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:01,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:01,563 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:01,564 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:01,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:01,570 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 02:42:01,570 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 02:42:01,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:01,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:01,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 02:42:01,571 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 02:42:01,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:01,574 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 02:42:01,575 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 02:42:01,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:01,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:01,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:01,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:01,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:01,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-28 02:42:01,579 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-28 02:42:01,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:01,580 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-28 02:42:01,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:01,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-28 02:42:01,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:01,604 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 02:42:01,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 02:42:01,605 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:01,607 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:01,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:42:01,613 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:01,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:01,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1990035655, now seen corresponding path program 1 times [2022-04-28 02:42:01,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:01,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1975899090] [2022-04-28 02:42:01,619 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:42:01,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1990035655, now seen corresponding path program 2 times [2022-04-28 02:42:01,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:01,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895851093] [2022-04-28 02:42:01,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:01,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:01,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:01,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {143#(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; {137#true} is VALID [2022-04-28 02:42:01,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {137#true} assume true; {137#true} is VALID [2022-04-28 02:42:01,741 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {137#true} {137#true} #40#return; {137#true} is VALID [2022-04-28 02:42:01,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {137#true} call ULTIMATE.init(); {143#(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-28 02:42:01,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {143#(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; {137#true} is VALID [2022-04-28 02:42:01,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {137#true} assume true; {137#true} is VALID [2022-04-28 02:42:01,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {137#true} {137#true} #40#return; {137#true} is VALID [2022-04-28 02:42:01,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {137#true} call #t~ret9 := main(); {137#true} is VALID [2022-04-28 02:42:01,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {137#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~i~0 := 0; {142#(= ~i~0 0)} is VALID [2022-04-28 02:42:01,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {142#(= ~i~0 0)} call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); {142#(= ~i~0 0)} is VALID [2022-04-28 02:42:01,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {142#(= ~i~0 0)} assume !(0 != #t~mem5);havoc #t~mem5; {142#(= ~i~0 0)} is VALID [2022-04-28 02:42:01,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {142#(= ~i~0 0)} call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); {142#(= ~i~0 0)} is VALID [2022-04-28 02:42:01,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {142#(= ~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); {138#false} is VALID [2022-04-28 02:42:01,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {138#false} assume 0 == #t~mem8;havoc #t~mem8; {138#false} is VALID [2022-04-28 02:42:01,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {138#false} assume !false; {138#false} is VALID [2022-04-28 02:42:01,747 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-28 02:42:01,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:01,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895851093] [2022-04-28 02:42:01,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895851093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:01,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:01,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:42:01,748 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:01,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1975899090] [2022-04-28 02:42:01,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1975899090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:01,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:01,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:42:01,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922954190] [2022-04-28 02:42:01,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:01,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 02:42:01,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:01,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:01,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:01,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:42:01,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:01,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:42:01,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:42:01,768 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:01,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:01,853 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 02:42:01,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:42:01,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 02:42:01,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-04-28 02:42:01,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-04-28 02:42:01,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2022-04-28 02:42:01,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:01,878 INFO L225 Difference]: With dead ends: 20 [2022-04-28 02:42:01,878 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 02:42:01,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:42:01,880 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:01,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 14 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:42:01,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 02:42:01,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 02:42:01,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:01,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:01,885 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:01,885 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:01,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:01,886 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 02:42:01,887 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 02:42:01,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:01,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:01,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 02:42:01,887 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 02:42:01,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:01,889 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 02:42:01,889 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 02:42:01,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:01,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:01,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:01,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:01,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 02:42:01,891 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-28 02:42:01,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:01,895 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 02:42:01,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:01,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 02:42:01,912 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-28 02:42:01,913 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 02:42:01,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 02:42:01,913 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:01,913 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:01,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 02:42:01,914 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:01,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:01,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1622298932, now seen corresponding path program 1 times [2022-04-28 02:42:01,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:01,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [502370343] [2022-04-28 02:42:01,930 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:42:01,931 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:42:01,931 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:42:01,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1622298932, now seen corresponding path program 2 times [2022-04-28 02:42:01,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:01,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156397739] [2022-04-28 02:42:01,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:01,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:02,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:02,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#(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; {257#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (= 5 |~#y~0.base|) (= |~#x~0.base| 4))} is VALID [2022-04-28 02:42:02,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (= 5 |~#y~0.base|) (= |~#x~0.base| 4))} assume true; {257#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (= 5 |~#y~0.base|) (= |~#x~0.base| 4))} is VALID [2022-04-28 02:42:02,203 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {257#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (= 5 |~#y~0.base|) (= |~#x~0.base| 4))} {248#true} #40#return; {253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)) (not (= |~#x~0.base| 5)))} is VALID [2022-04-28 02:42:02,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {248#true} call ULTIMATE.init(); {256#(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-28 02:42:02,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#(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; {257#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (= 5 |~#y~0.base|) (= |~#x~0.base| 4))} is VALID [2022-04-28 02:42:02,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {257#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (= 5 |~#y~0.base|) (= |~#x~0.base| 4))} assume true; {257#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (= 5 |~#y~0.base|) (= |~#x~0.base| 4))} is VALID [2022-04-28 02:42:02,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {257#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (= 5 |~#y~0.base|) (= |~#x~0.base| 4))} {248#true} #40#return; {253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)) (not (= |~#x~0.base| 5)))} is VALID [2022-04-28 02:42:02,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)) (not (= |~#x~0.base| 5)))} call #t~ret9 := main(); {253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)) (not (= |~#x~0.base| 5)))} is VALID [2022-04-28 02:42:02,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)) (not (= |~#x~0.base| 5)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~i~0 := 0; {254#(and (= (select (select |#memory_int| |~#x~0.base|) (+ ~i~0 |~#x~0.offset|)) 0) (not (= |~#x~0.base| |~#y~0.base|)) (not (= |~#x~0.base| 5)))} is VALID [2022-04-28 02:42:02,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {254#(and (= (select (select |#memory_int| |~#x~0.base|) (+ ~i~0 |~#x~0.offset|)) 0) (not (= |~#x~0.base| |~#y~0.base|)) (not (= |~#x~0.base| 5)))} call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); {255#(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) (not (= |~#x~0.base| 5)))} is VALID [2022-04-28 02:42:02,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {255#(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) (not (= |~#x~0.base| 5)))} 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; {249#false} is VALID [2022-04-28 02:42:02,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {249#false} call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); {249#false} is VALID [2022-04-28 02:42:02,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {249#false} assume !(0 != #t~mem5);havoc #t~mem5; {249#false} is VALID [2022-04-28 02:42:02,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {249#false} call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); {249#false} is VALID [2022-04-28 02:42:02,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {249#false} assume ~k~0 >= 0 && ~k~0 < ~i~0;call #t~mem8 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); {249#false} is VALID [2022-04-28 02:42:02,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {249#false} assume 0 == #t~mem8;havoc #t~mem8; {249#false} is VALID [2022-04-28 02:42:02,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {249#false} assume !false; {249#false} is VALID [2022-04-28 02:42:02,218 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-28 02:42:02,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:02,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156397739] [2022-04-28 02:42:02,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156397739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:02,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:02,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:42:02,219 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:02,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [502370343] [2022-04-28 02:42:02,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [502370343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:02,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:02,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:42:02,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197851527] [2022-04-28 02:42:02,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:02,220 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 02:42:02,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:02,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:02,235 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-28 02:42:02,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 02:42:02,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:02,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 02:42:02,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-28 02:42:02,236 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:02,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:02,334 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 02:42:02,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 02:42:02,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 02:42:02,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:02,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:02,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2022-04-28 02:42:02,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:02,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2022-04-28 02:42:02,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 15 transitions. [2022-04-28 02:42:02,355 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-28 02:42:02,356 INFO L225 Difference]: With dead ends: 15 [2022-04-28 02:42:02,356 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 02:42:02,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 02:42:02,360 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:02,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 10 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:42:02,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 02:42:02,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 02:42:02,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:02,368 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-28 02:42:02,368 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-28 02:42:02,368 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-28 02:42:02,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:02,368 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 02:42:02,369 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:42:02,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:02,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:02,369 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-28 02:42:02,369 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-28 02:42:02,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:02,369 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 02:42:02,370 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:42:02,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:02,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:02,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:02,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:02,370 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-28 02:42:02,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 02:42:02,370 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-28 02:42:02,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:02,371 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 02:42:02,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:02,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 02:42:02,371 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-28 02:42:02,371 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:42:02,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:02,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 02:42:02,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 02:42:02,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 02:42:02,578 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 02:42:02,578 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 02:42:02,578 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 02:42:02,578 INFO L895 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|)) (= 5 |~#y~0.base|) (= ~i~0 0) (= |~#x~0.base| 4)) [2022-04-28 02:42:02,579 INFO L895 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-28 02:42:02,579 INFO L895 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|)) (= 5 |~#y~0.base|) (= ~i~0 0) (= |~#x~0.base| 4)) [2022-04-28 02:42:02,579 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 02:42:02,579 INFO L895 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|)) (= 5 |~#y~0.base|) (= ~i~0 0) (= |~#x~0.base| 4)) [2022-04-28 02:42:02,579 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 02:42:02,579 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 02:42:02,579 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 10 25) the Hoare annotation is: true [2022-04-28 02:42:02,579 INFO L895 garLoopResultBuilder]: At program point L21(lines 21 22) the Hoare annotation is: (or (not (= |~#x~0.base| 4)) (not (= 5 |~#y~0.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (not (= |old(~i~0)| 0))) [2022-04-28 02:42:02,580 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 10 25) the Hoare annotation is: true [2022-04-28 02:42:02,580 INFO L895 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 22) the Hoare annotation is: (or (not (= |~#x~0.base| 4)) (not (= 5 |~#y~0.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (not (= |old(~i~0)| 0))) [2022-04-28 02:42:02,580 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 10 25) the Hoare annotation is: (or (not (= |~#x~0.base| 4)) (not (= 5 |~#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-28 02:42:02,580 INFO L895 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: (or (not (= |~#x~0.base| 4)) (not (= 5 |~#y~0.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (not (= |old(~i~0)| 0))) [2022-04-28 02:42:02,580 INFO L895 garLoopResultBuilder]: At program point L20(lines 20 22) the Hoare annotation is: (or (not (= |~#x~0.base| 4)) (= ~i~0 0) (not (= 5 |~#y~0.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (not (= |old(~i~0)| 0))) [2022-04-28 02:42:02,580 INFO L902 garLoopResultBuilder]: At program point L20-1(lines 20 22) the Hoare annotation is: true [2022-04-28 02:42:02,580 INFO L895 garLoopResultBuilder]: At program point L14-1(lines 14 17) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (= |~#x~0.base| 4)) (not (= 5 |~#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-28 02:42:02,581 INFO L895 garLoopResultBuilder]: At program point L14-3(lines 14 17) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (= |~#x~0.base| 4)) (and (= .cse0 (select |#memory_int| |~#x~0.base|)) (= ~i~0 0)) (not (= 5 |~#y~0.base|)) (not (= .cse0 (select |old(#memory_int)| |~#x~0.base|))) (not (= |old(~i~0)| 0)))) [2022-04-28 02:42:02,581 INFO L895 garLoopResultBuilder]: At program point L14-4(lines 14 17) the Hoare annotation is: (or (not (= |~#x~0.base| 4)) (= ~i~0 0) (not (= 5 |~#y~0.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (not (= |old(~i~0)| 0))) [2022-04-28 02:42:02,584 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-28 02:42:02,586 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 02:42:02,589 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 02:42:02,593 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 02:42:02,600 INFO L163 areAnnotationChecker]: CFG has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 02:42:02,604 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:449) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) 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-28 02:42:02,607 INFO L158 Benchmark]: Toolchain (without parser) took 2434.05ms. Allocated memory was 179.3MB in the beginning and 235.9MB in the end (delta: 56.6MB). Free memory was 124.3MB in the beginning and 88.4MB in the end (delta: 36.0MB). Peak memory consumption was 92.1MB. Max. memory is 8.0GB. [2022-04-28 02:42:02,607 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 179.3MB. Free memory is still 140.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:42:02,607 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.72ms. Allocated memory was 179.3MB in the beginning and 235.9MB in the end (delta: 56.6MB). Free memory was 124.1MB in the beginning and 207.4MB in the end (delta: -83.3MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. [2022-04-28 02:42:02,608 INFO L158 Benchmark]: Boogie Preprocessor took 47.59ms. Allocated memory is still 235.9MB. Free memory was 207.4MB in the beginning and 205.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 02:42:02,608 INFO L158 Benchmark]: RCFGBuilder took 319.61ms. Allocated memory is still 235.9MB. Free memory was 205.3MB in the beginning and 193.2MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 02:42:02,608 INFO L158 Benchmark]: TraceAbstraction took 1773.35ms. Allocated memory is still 235.9MB. Free memory was 192.7MB in the beginning and 88.4MB in the end (delta: 104.3MB). Peak memory consumption was 103.8MB. Max. memory is 8.0GB. [2022-04-28 02:42:02,609 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.19ms. Allocated memory is still 179.3MB. Free memory is still 140.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 284.72ms. Allocated memory was 179.3MB in the beginning and 235.9MB in the end (delta: 56.6MB). Free memory was 124.1MB in the beginning and 207.4MB in the end (delta: -83.3MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.59ms. Allocated memory is still 235.9MB. Free memory was 207.4MB in the beginning and 205.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 319.61ms. Allocated memory is still 235.9MB. Free memory was 205.3MB in the beginning and 193.2MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1773.35ms. Allocated memory is still 235.9MB. Free memory was 192.7MB in the beginning and 88.4MB in the end (delta: 104.3MB). Peak memory consumption was 103.8MB. 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: 22]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 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, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 32 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred 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.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 18 PreInvPairs, 27 NumberOfFragments, 284 HoareAnnotationTreeSize, 18 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 27 FormulaSimplificationTreeSizeReductionInter, 0.2s 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-28 02:42:02,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...