/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops/sum01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:57:22,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:57:22,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:57:22,198 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:57:22,199 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:57:22,200 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:57:22,205 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:57:22,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:57:22,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:57:22,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:57:22,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:57:22,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:57:22,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:57:22,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:57:22,220 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:57:22,221 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:57:22,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:57:22,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:57:22,226 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:57:22,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:57:22,233 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:57:22,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:57:22,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:57:22,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:57:22,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:57:22,243 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:57:22,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:57:22,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:57:22,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:57:22,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:57:22,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:57:22,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:57:22,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:57:22,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:57:22,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:57:22,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:57:22,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:57:22,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:57:22,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:57:22,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:57:22,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:57:22,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:57:22,252 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 15:57:22,265 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:57:22,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:57:22,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:57:22,266 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:57:22,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:57:22,267 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:57:22,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:57:22,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:57:22,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:57:22,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:57:22,268 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:57:22,268 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:57:22,268 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:57:22,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:57:22,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:57:22,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:57:22,268 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 15:57:22,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:57:22,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:57:22,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:57:22,269 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:57:22,270 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 15:57:22,270 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-27 15:57:22,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:57:22,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:57:22,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:57:22,506 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:57:22,507 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:57:22,508 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01-2.i [2022-04-27 15:57:22,567 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7214de22a/6f925e7a358f4c049263d07a20586ed3/FLAG7f9bb6ff1 [2022-04-27 15:57:22,969 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:57:22,970 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-2.i [2022-04-27 15:57:22,975 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7214de22a/6f925e7a358f4c049263d07a20586ed3/FLAG7f9bb6ff1 [2022-04-27 15:57:23,408 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7214de22a/6f925e7a358f4c049263d07a20586ed3 [2022-04-27 15:57:23,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:57:23,412 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 15:57:23,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:57:23,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:57:23,427 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:57:23,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:57:23" (1/1) ... [2022-04-27 15:57:23,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e63f69d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:23, skipping insertion in model container [2022-04-27 15:57:23,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:57:23" (1/1) ... [2022-04-27 15:57:23,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:57:23,476 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:57:23,835 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/sum01-2.i[849,862] [2022-04-27 15:57:23,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:57:23,894 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:57:23,905 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/sum01-2.i[849,862] [2022-04-27 15:57:23,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:57:23,944 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:57:23,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:23 WrapperNode [2022-04-27 15:57:23,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:57:23,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:57:23,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:57:23,955 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:57:23,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:23" (1/1) ... [2022-04-27 15:57:23,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:23" (1/1) ... [2022-04-27 15:57:23,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:23" (1/1) ... [2022-04-27 15:57:23,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:23" (1/1) ... [2022-04-27 15:57:23,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:23" (1/1) ... [2022-04-27 15:57:23,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:23" (1/1) ... [2022-04-27 15:57:24,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:23" (1/1) ... [2022-04-27 15:57:24,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:57:24,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:57:24,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:57:24,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:57:24,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:23" (1/1) ... [2022-04-27 15:57:24,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:57:24,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:57:24,073 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-27 15:57:24,133 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-27 15:57:24,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:57:24,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:57:24,180 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:57:24,180 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 15:57:24,180 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:57:24,180 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:57:24,180 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:57:24,180 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 15:57:24,180 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 15:57:24,180 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:57:24,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:57:24,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 15:57:24,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:57:24,181 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:57:24,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:57:24,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:57:24,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:57:24,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:57:24,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:57:24,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:57:24,266 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:57:24,280 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:57:24,488 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:57:24,493 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:57:24,493 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:57:24,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:57:24 BoogieIcfgContainer [2022-04-27 15:57:24,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:57:24,495 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 15:57:24,495 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 15:57:24,512 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 15:57:24,515 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:57:24" (1/1) ... [2022-04-27 15:57:24,517 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 15:57:24,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:57:24 BasicIcfg [2022-04-27 15:57:24,538 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 15:57:24,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:57:24,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:57:24,542 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:57:24,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:57:23" (1/4) ... [2022-04-27 15:57:24,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a88235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:57:24, skipping insertion in model container [2022-04-27 15:57:24,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:23" (2/4) ... [2022-04-27 15:57:24,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a88235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:57:24, skipping insertion in model container [2022-04-27 15:57:24,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:57:24" (3/4) ... [2022-04-27 15:57:24,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a88235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:57:24, skipping insertion in model container [2022-04-27 15:57:24,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:57:24" (4/4) ... [2022-04-27 15:57:24,544 INFO L111 eAbstractionObserver]: Analyzing ICFG sum01-2.iJordan [2022-04-27 15:57:24,560 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:57:24,560 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:57:24,606 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:57:24,615 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, 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@220560d5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@36dbdec6 [2022-04-27 15:57:24,615 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:57:24,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 15:57:24,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 15:57:24,630 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:57:24,630 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:57:24,631 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:57:24,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:57:24,636 INFO L85 PathProgramCache]: Analyzing trace with hash 797277979, now seen corresponding path program 1 times [2022-04-27 15:57:24,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:57:24,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516989123] [2022-04-27 15:57:24,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:57:24,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:57:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:24,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:57:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:24,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [51] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-27 15:57:24,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [54] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 15:57:24,840 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 15:57:24,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [49] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:57:24,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [51] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-27 15:57:24,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [54] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 15:57:24,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 15:57:24,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [50] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 15:57:24,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [53] mainENTRY-->L24: Formula: (and (= v_main_~sn~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_3, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {23#true} is VALID [2022-04-27 15:57:24,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [56] L24-->L25-3: Formula: (and (< v_main_~n~0_6 1000) (<= 0 (+ v_main_~n~0_6 1000)) (= v_main_~i~0_6 1)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[main_~i~0] {23#true} is VALID [2022-04-27 15:57:24,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#true} [58] L25-3-->L25-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 15:57:24,849 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} [61] L25-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_7 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {24#false} is VALID [2022-04-27 15:57:24,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [63] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {24#false} is VALID [2022-04-27 15:57:24,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [64] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 15:57:24,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} [66] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 15:57:24,851 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-27 15:57:24,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:57:24,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516989123] [2022-04-27 15:57:24,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516989123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:57:24,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:57:24,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 15:57:24,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700406766] [2022-04-27 15:57:24,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:57:24,861 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 15:57:24,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:57:24,865 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:24,886 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-27 15:57:24,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 15:57:24,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:57:24,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 15:57:24,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 15:57:24,910 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:24,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:24,975 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-27 15:57:24,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 15:57:24,976 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 15:57:24,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:57:24,977 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-27 15:57:24,990 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:24,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-27 15:57:24,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-04-27 15:57:25,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:57:25,049 INFO L225 Difference]: With dead ends: 20 [2022-04-27 15:57:25,049 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 15:57:25,051 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-27 15:57:25,053 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:57:25,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:57:25,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 15:57:25,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 15:57:25,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:57:25,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:25,085 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:25,086 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:25,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:25,092 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 15:57:25,092 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 15:57:25,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:57:25,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:57:25,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 15:57:25,093 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 15:57:25,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:25,096 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 15:57:25,101 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 15:57:25,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:57:25,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:57:25,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:57:25,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:57:25,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:25,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 15:57:25,104 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-27 15:57:25,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:57:25,105 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 15:57:25,105 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:25,105 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 15:57:25,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 15:57:25,106 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:57:25,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:57:25,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:57:25,106 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:57:25,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:57:25,107 INFO L85 PathProgramCache]: Analyzing trace with hash 798201500, now seen corresponding path program 1 times [2022-04-27 15:57:25,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:57:25,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082257243] [2022-04-27 15:57:25,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:57:25,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:57:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:25,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:57:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:25,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {101#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [51] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {93#true} is VALID [2022-04-27 15:57:25,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {93#true} [54] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-04-27 15:57:25,228 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {93#true} {93#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-04-27 15:57:25,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {93#true} [49] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {101#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:57:25,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {101#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [51] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {93#true} is VALID [2022-04-27 15:57:25,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {93#true} [54] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-04-27 15:57:25,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93#true} {93#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-04-27 15:57:25,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {93#true} [50] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-04-27 15:57:25,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {93#true} [53] mainENTRY-->L24: Formula: (and (= v_main_~sn~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_3, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {98#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 15:57:25,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {98#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [56] L24-->L25-3: Formula: (and (< v_main_~n~0_6 1000) (<= 0 (+ v_main_~n~0_6 1000)) (= v_main_~i~0_6 1)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[main_~i~0] {98#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 15:57:25,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {98#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [59] L25-3-->L25-4: Formula: (not (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {98#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 15:57:25,234 INFO L272 TraceCheckUtils]: 8: Hoare triple {98#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [61] L25-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_7 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {99#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 15:57:25,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {99#(not (= |__VERIFIER_assert_#in~cond| 0))} [63] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {100#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 15:57:25,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {100#(not (= __VERIFIER_assert_~cond 0))} [64] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {94#false} is VALID [2022-04-27 15:57:25,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {94#false} [66] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94#false} is VALID [2022-04-27 15:57:25,236 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-27 15:57:25,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:57:25,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082257243] [2022-04-27 15:57:25,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082257243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:57:25,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:57:25,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 15:57:25,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229489447] [2022-04-27 15:57:25,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:57:25,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 15:57:25,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:57:25,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:25,252 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-27 15:57:25,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 15:57:25,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:57:25,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 15:57:25,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:57:25,253 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:25,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:25,383 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 15:57:25,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 15:57:25,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 15:57:25,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:57:25,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:25,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2022-04-27 15:57:25,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:25,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2022-04-27 15:57:25,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 19 transitions. [2022-04-27 15:57:25,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:57:25,422 INFO L225 Difference]: With dead ends: 18 [2022-04-27 15:57:25,422 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 15:57:25,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 15:57:25,423 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:57:25,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 27 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:57:25,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 15:57:25,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 15:57:25,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:57:25,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:25,427 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:25,427 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:25,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:25,429 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 15:57:25,429 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 15:57:25,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:57:25,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:57:25,430 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 15:57:25,430 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 15:57:25,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:25,432 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 15:57:25,432 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 15:57:25,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:57:25,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:57:25,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:57:25,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:57:25,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-27 15:57:25,434 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-27 15:57:25,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:57:25,435 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-27 15:57:25,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:25,435 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 15:57:25,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 15:57:25,436 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:57:25,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:57:25,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:57:25,436 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:57:25,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:57:25,437 INFO L85 PathProgramCache]: Analyzing trace with hash -815155942, now seen corresponding path program 1 times [2022-04-27 15:57:25,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:57:25,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185053271] [2022-04-27 15:57:25,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:57:25,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:57:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:25,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:57:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:25,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [51] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {173#true} is VALID [2022-04-27 15:57:25,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#true} [54] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 15:57:25,667 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {173#true} {173#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 15:57:25,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {173#true} [49] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:57:25,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [51] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {173#true} is VALID [2022-04-27 15:57:25,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#true} [54] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 15:57:25,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173#true} {173#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 15:57:25,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {173#true} [50] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 15:57:25,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {173#true} [53] mainENTRY-->L24: Formula: (and (= v_main_~sn~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_3, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {178#(= main_~sn~0 0)} is VALID [2022-04-27 15:57:25,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {178#(= main_~sn~0 0)} [56] L24-->L25-3: Formula: (and (< v_main_~n~0_6 1000) (<= 0 (+ v_main_~n~0_6 1000)) (= v_main_~i~0_6 1)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[main_~i~0] {179#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 15:57:25,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {179#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [60] L25-3-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (<= v_main_~i~0_2 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~sn~0] {180#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} is VALID [2022-04-27 15:57:25,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {180#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} [62] L25-2-->L25-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {181#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-27 15:57:25,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {181#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} [59] L25-3-->L25-4: Formula: (not (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {182#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 15:57:25,674 INFO L272 TraceCheckUtils]: 10: Hoare triple {182#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} [61] L25-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_7 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {183#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 15:57:25,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {183#(not (= |__VERIFIER_assert_#in~cond| 0))} [63] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {184#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 15:57:25,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {184#(not (= __VERIFIER_assert_~cond 0))} [64] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-27 15:57:25,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {174#false} [66] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-27 15:57:25,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:57:25,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:57:25,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185053271] [2022-04-27 15:57:25,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185053271] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 15:57:25,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82812695] [2022-04-27 15:57:25,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:57:25,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:57:25,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:57:25,679 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 15:57:25,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 15:57:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:25,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 15:57:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:25,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 15:57:26,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {173#true} [49] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 15:57:26,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#true} [51] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {173#true} is VALID [2022-04-27 15:57:26,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#true} [54] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 15:57:26,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173#true} {173#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 15:57:26,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {173#true} [50] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 15:57:26,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {173#true} [53] mainENTRY-->L24: Formula: (and (= v_main_~sn~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_3, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {178#(= main_~sn~0 0)} is VALID [2022-04-27 15:57:26,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {178#(= main_~sn~0 0)} [56] L24-->L25-3: Formula: (and (< v_main_~n~0_6 1000) (<= 0 (+ v_main_~n~0_6 1000)) (= v_main_~i~0_6 1)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[main_~i~0] {179#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 15:57:26,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {179#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [60] L25-3-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (<= v_main_~i~0_2 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~sn~0] {210#(and (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-27 15:57:26,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {210#(and (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 2) main_~sn~0) 0))} [62] L25-2-->L25-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {214#(and (<= 1 main_~n~0) (<= main_~i~0 2) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-27 15:57:26,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {214#(and (<= 1 main_~n~0) (<= main_~i~0 2) (= (+ (- 2) main_~sn~0) 0))} [59] L25-3-->L25-4: Formula: (not (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {218#(and (<= 1 main_~n~0) (< main_~n~0 2) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-27 15:57:26,086 INFO L272 TraceCheckUtils]: 10: Hoare triple {218#(and (<= 1 main_~n~0) (< main_~n~0 2) (= (+ (- 2) main_~sn~0) 0))} [61] L25-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_7 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {222#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 15:57:26,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {222#(<= 1 |__VERIFIER_assert_#in~cond|)} [63] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {226#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 15:57:26,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {226#(<= 1 __VERIFIER_assert_~cond)} [64] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-27 15:57:26,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {174#false} [66] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-27 15:57:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:57:26,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 15:57:26,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {174#false} [66] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-27 15:57:26,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {226#(<= 1 __VERIFIER_assert_~cond)} [64] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-27 15:57:26,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {222#(<= 1 |__VERIFIER_assert_#in~cond|)} [63] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {226#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 15:57:26,396 INFO L272 TraceCheckUtils]: 10: Hoare triple {242#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [61] L25-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_7 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {222#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 15:57:26,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [59] L25-3-->L25-4: Formula: (not (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {242#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 15:57:26,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [62] L25-2-->L25-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {246#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 15:57:26,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {254#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} [60] L25-3-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (<= v_main_~i~0_2 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~sn~0] {250#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 15:57:26,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {258#(or (and (<= 2 (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 1)) (= (+ 2 main_~sn~0) 0))} [56] L24-->L25-3: Formula: (and (< v_main_~n~0_6 1000) (<= 0 (+ v_main_~n~0_6 1000)) (= v_main_~i~0_6 1)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[main_~i~0] {254#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 15:57:26,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {173#true} [53] mainENTRY-->L24: Formula: (and (= v_main_~sn~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_3, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {258#(or (and (<= 2 (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 1)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 15:57:26,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {173#true} [50] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 15:57:26,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173#true} {173#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 15:57:26,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#true} [54] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 15:57:26,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#true} [51] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {173#true} is VALID [2022-04-27 15:57:26,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {173#true} [49] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 15:57:26,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:57:26,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82812695] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 15:57:26,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 15:57:26,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-04-27 15:57:26,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562230109] [2022-04-27 15:57:26,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 15:57:26,404 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 15:57:26,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:57:26,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:26,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:57:26,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 15:57:26,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:57:26,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 15:57:26,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-04-27 15:57:26,431 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:26,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:26,890 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-27 15:57:26,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 15:57:26,890 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 15:57:26,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:57:26,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:26,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2022-04-27 15:57:26,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:26,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2022-04-27 15:57:26,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 25 transitions. [2022-04-27 15:57:26,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:57:26,919 INFO L225 Difference]: With dead ends: 23 [2022-04-27 15:57:26,920 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 15:57:26,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2022-04-27 15:57:26,921 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 20 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:57:26,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 47 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:57:26,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 15:57:26,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-27 15:57:26,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:57:26,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:26,924 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:26,925 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:26,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:26,926 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-27 15:57:26,926 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-27 15:57:26,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:57:26,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:57:26,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-27 15:57:26,927 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-27 15:57:26,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:26,928 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-27 15:57:26,929 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-27 15:57:26,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:57:26,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:57:26,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:57:26,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:57:26,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:26,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-27 15:57:26,930 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 14 [2022-04-27 15:57:26,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:57:26,931 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-27 15:57:26,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:26,931 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-27 15:57:26,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 15:57:26,931 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:57:26,932 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:57:26,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 15:57:27,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:57:27,146 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:57:27,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:57:27,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1152965526, now seen corresponding path program 2 times [2022-04-27 15:57:27,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:57:27,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460071031] [2022-04-27 15:57:27,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:57:27,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:57:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:27,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:57:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:27,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {394#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [51] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {379#true} is VALID [2022-04-27 15:57:27,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#true} [54] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-27 15:57:27,398 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {379#true} {379#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-27 15:57:27,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {379#true} [49] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:57:27,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [51] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {379#true} is VALID [2022-04-27 15:57:27,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#true} [54] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-27 15:57:27,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-27 15:57:27,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {379#true} [50] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-27 15:57:27,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {379#true} [53] mainENTRY-->L24: Formula: (and (= v_main_~sn~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_3, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {384#(= main_~sn~0 0)} is VALID [2022-04-27 15:57:27,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {384#(= main_~sn~0 0)} [56] L24-->L25-3: Formula: (and (< v_main_~n~0_6 1000) (<= 0 (+ v_main_~n~0_6 1000)) (= v_main_~i~0_6 1)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[main_~i~0] {385#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 15:57:27,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {385#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [60] L25-3-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (<= v_main_~i~0_2 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~sn~0] {386#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-27 15:57:27,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {386#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} [62] L25-2-->L25-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {387#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-27 15:57:27,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {387#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} [60] L25-3-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (<= v_main_~i~0_2 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~sn~0] {388#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} is VALID [2022-04-27 15:57:27,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {388#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} [62] L25-2-->L25-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {387#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-27 15:57:27,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {387#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} [60] L25-3-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (<= v_main_~i~0_2 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~sn~0] {389#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-27 15:57:27,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {389#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} [62] L25-2-->L25-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {390#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-27 15:57:27,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {390#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} [59] L25-3-->L25-4: Formula: (not (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {391#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 15:57:27,408 INFO L272 TraceCheckUtils]: 14: Hoare triple {391#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} [61] L25-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_7 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {392#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 15:57:27,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {392#(not (= |__VERIFIER_assert_#in~cond| 0))} [63] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {393#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 15:57:27,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {393#(not (= __VERIFIER_assert_~cond 0))} [64] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {380#false} is VALID [2022-04-27 15:57:27,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {380#false} [66] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {380#false} is VALID [2022-04-27 15:57:27,409 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 15:57:27,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:57:27,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460071031] [2022-04-27 15:57:27,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460071031] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 15:57:27,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213904796] [2022-04-27 15:57:27,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 15:57:27,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:57:27,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:57:27,411 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 15:57:27,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 15:57:27,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 15:57:27,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 15:57:27,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 15:57:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:27,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 15:57:28,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {379#true} [49] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-27 15:57:28,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#true} [51] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {379#true} is VALID [2022-04-27 15:57:28,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#true} [54] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-27 15:57:28,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-27 15:57:28,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {379#true} [50] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-27 15:57:28,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {379#true} [53] mainENTRY-->L24: Formula: (and (= v_main_~sn~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_3, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {384#(= main_~sn~0 0)} is VALID [2022-04-27 15:57:28,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {384#(= main_~sn~0 0)} [56] L24-->L25-3: Formula: (and (< v_main_~n~0_6 1000) (<= 0 (+ v_main_~n~0_6 1000)) (= v_main_~i~0_6 1)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[main_~i~0] {385#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 15:57:28,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {385#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [60] L25-3-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (<= v_main_~i~0_2 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~sn~0] {386#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-27 15:57:28,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {386#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} [62] L25-2-->L25-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {422#(and (= (+ (- 2) main_~i~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-27 15:57:28,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {422#(and (= (+ (- 2) main_~i~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} [60] L25-3-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (<= v_main_~i~0_2 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~sn~0] {426#(and (= (+ (- 2) main_~i~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-27 15:57:28,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {426#(and (= (+ (- 2) main_~i~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} [62] L25-2-->L25-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {430#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= (+ main_~i~0 (- 3)) 0))} is VALID [2022-04-27 15:57:28,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {430#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= (+ main_~i~0 (- 3)) 0))} [60] L25-3-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (<= v_main_~i~0_2 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~sn~0] {434#(and (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (= (+ main_~i~0 (- 3)) 0) (<= main_~sn~0 6))} is VALID [2022-04-27 15:57:28,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#(and (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (= (+ main_~i~0 (- 3)) 0) (<= main_~sn~0 6))} [62] L25-2-->L25-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {438#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (<= main_~sn~0 6) (<= main_~i~0 4))} is VALID [2022-04-27 15:57:28,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {438#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (<= main_~sn~0 6) (<= main_~i~0 4))} [59] L25-3-->L25-4: Formula: (not (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {442#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (< main_~n~0 4) (<= main_~sn~0 6))} is VALID [2022-04-27 15:57:28,023 INFO L272 TraceCheckUtils]: 14: Hoare triple {442#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (< main_~n~0 4) (<= main_~sn~0 6))} [61] L25-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_7 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {446#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 15:57:28,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {446#(<= 1 |__VERIFIER_assert_#in~cond|)} [63] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {450#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 15:57:28,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {450#(<= 1 __VERIFIER_assert_~cond)} [64] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {380#false} is VALID [2022-04-27 15:57:28,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {380#false} [66] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {380#false} is VALID [2022-04-27 15:57:28,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:57:28,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 15:57:28,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {380#false} [66] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {380#false} is VALID [2022-04-27 15:57:28,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {450#(<= 1 __VERIFIER_assert_~cond)} [64] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {380#false} is VALID [2022-04-27 15:57:28,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {446#(<= 1 |__VERIFIER_assert_#in~cond|)} [63] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {450#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 15:57:28,575 INFO L272 TraceCheckUtils]: 14: Hoare triple {466#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [61] L25-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_7 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {446#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 15:57:28,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {470#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [59] L25-3-->L25-4: Formula: (not (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {466#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 15:57:28,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {474#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [62] L25-2-->L25-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {470#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 15:57:28,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {478#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} [60] L25-3-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (<= v_main_~i~0_2 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~sn~0] {474#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 15:57:28,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {482#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} [62] L25-2-->L25-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {478#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 15:57:28,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {486#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} [60] L25-3-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (<= v_main_~i~0_2 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~sn~0] {482#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 15:57:28,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {490#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} [62] L25-2-->L25-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {486#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-27 15:57:28,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {494#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} [60] L25-3-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (<= v_main_~i~0_2 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_2, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~sn~0] {490#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-27 15:57:28,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {498#(or (= (+ 6 main_~sn~0) 0) (and (<= 4 (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2))) (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) 3)))} [56] L24-->L25-3: Formula: (and (< v_main_~n~0_6 1000) (<= 0 (+ v_main_~n~0_6 1000)) (= v_main_~i~0_6 1)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[main_~i~0] {494#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} is VALID [2022-04-27 15:57:28,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {379#true} [53] mainENTRY-->L24: Formula: (and (= v_main_~sn~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_3, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {498#(or (= (+ 6 main_~sn~0) 0) (and (<= 4 (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2))) (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) 3)))} is VALID [2022-04-27 15:57:28,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {379#true} [50] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-27 15:57:28,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-27 15:57:28,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#true} [54] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-27 15:57:28,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#true} [51] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {379#true} is VALID [2022-04-27 15:57:28,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {379#true} [49] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-27 15:57:28,588 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:57:28,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213904796] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 15:57:28,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 15:57:28,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2022-04-27 15:57:28,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120126813] [2022-04-27 15:57:28,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 15:57:28,589 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 15:57:28,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:57:28,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:28,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:57:28,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-27 15:57:28,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:57:28,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-27 15:57:28,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2022-04-27 15:57:28,635 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:29,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:29,447 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-27 15:57:29,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 15:57:29,447 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 15:57:29,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:57:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2022-04-27 15:57:29,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:29,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2022-04-27 15:57:29,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 22 transitions. [2022-04-27 15:57:29,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:57:29,471 INFO L225 Difference]: With dead ends: 20 [2022-04-27 15:57:29,471 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 15:57:29,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=275, Invalid=1617, Unknown=0, NotChecked=0, Total=1892 [2022-04-27 15:57:29,473 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 24 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:57:29,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 65 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 15:57:29,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 15:57:29,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 15:57:29,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:57:29,474 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-27 15:57:29,474 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-27 15:57:29,475 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-27 15:57:29,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:29,475 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:57:29,475 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:57:29,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:57:29,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:57:29,475 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-27 15:57:29,475 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-27 15:57:29,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:29,476 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:57:29,476 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:57:29,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:57:29,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:57:29,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:57:29,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:57:29,476 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-27 15:57:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 15:57:29,476 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-04-27 15:57:29,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:57:29,476 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 15:57:29,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:57:29,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:57:29,479 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:57:29,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 15:57:29,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 15:57:29,706 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-27 15:57:29,707 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:57:29,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:57:29 BasicIcfg [2022-04-27 15:57:29,711 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:57:29,712 INFO L158 Benchmark]: Toolchain (without parser) took 6299.41ms. Allocated memory was 191.9MB in the beginning and 289.4MB in the end (delta: 97.5MB). Free memory was 140.2MB in the beginning and 110.1MB in the end (delta: 30.2MB). Peak memory consumption was 129.3MB. Max. memory is 8.0GB. [2022-04-27 15:57:29,712 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 191.9MB. Free memory was 156.6MB in the beginning and 156.5MB in the end (delta: 71.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:57:29,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 529.89ms. Allocated memory is still 191.9MB. Free memory was 140.0MB in the beginning and 168.2MB in the end (delta: -28.2MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-04-27 15:57:29,713 INFO L158 Benchmark]: Boogie Preprocessor took 65.22ms. Allocated memory is still 191.9MB. Free memory was 168.2MB in the beginning and 166.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 15:57:29,713 INFO L158 Benchmark]: RCFGBuilder took 482.85ms. Allocated memory is still 191.9MB. Free memory was 166.6MB in the beginning and 155.7MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 15:57:29,713 INFO L158 Benchmark]: IcfgTransformer took 43.57ms. Allocated memory is still 191.9MB. Free memory was 155.7MB in the beginning and 154.4MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 15:57:29,713 INFO L158 Benchmark]: TraceAbstraction took 5170.93ms. Allocated memory was 191.9MB in the beginning and 289.4MB in the end (delta: 97.5MB). Free memory was 154.0MB in the beginning and 110.1MB in the end (delta: 43.9MB). Peak memory consumption was 141.2MB. Max. memory is 8.0GB. [2022-04-27 15:57:29,717 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.12ms. Allocated memory is still 191.9MB. Free memory was 156.6MB in the beginning and 156.5MB in the end (delta: 71.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 529.89ms. Allocated memory is still 191.9MB. Free memory was 140.0MB in the beginning and 168.2MB in the end (delta: -28.2MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 65.22ms. Allocated memory is still 191.9MB. Free memory was 168.2MB in the beginning and 166.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 482.85ms. Allocated memory is still 191.9MB. Free memory was 166.6MB in the beginning and 155.7MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 43.57ms. Allocated memory is still 191.9MB. Free memory was 155.7MB in the beginning and 154.4MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 5170.93ms. Allocated memory was 191.9MB in the beginning and 289.4MB in the end (delta: 97.5MB). Free memory was 154.0MB in the beginning and 110.1MB in the end (delta: 43.9MB). Peak memory consumption was 141.2MB. 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: 17]: 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, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 162 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 271 IncrementalHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 48 mSDtfsCounter, 271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 780 SizeOfPredicates, 6 NumberOfNonLiveVariables, 130 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 1/30 InterpolantCoveringCapability, 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 RESULT: Ultimate proved your program to be correct! [2022-04-27 15:57:29,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...