/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/for_bounded_loop1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:55:59,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:55:59,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:55:59,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:55:59,371 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:55:59,372 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:55:59,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:55:59,374 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:55:59,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:55:59,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:55:59,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:55:59,377 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:55:59,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:55:59,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:55:59,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:55:59,379 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:55:59,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:55:59,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:55:59,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:55:59,382 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:55:59,383 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:55:59,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:55:59,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:55:59,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:55:59,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:55:59,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:55:59,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:55:59,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:55:59,391 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:55:59,391 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:55:59,392 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:55:59,392 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:55:59,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:55:59,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:55:59,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:55:59,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:55:59,394 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:55:59,394 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:55:59,395 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:55:59,395 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:55:59,395 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:55:59,398 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:55:59,399 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 15:55:59,412 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:55:59,412 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:55:59,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:55:59,413 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:55:59,413 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:55:59,413 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:55:59,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:55:59,414 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:55:59,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:55:59,414 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:55:59,414 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:55:59,414 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:55:59,415 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:55:59,415 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:55:59,415 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:55:59,415 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:55:59,415 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 15:55:59,415 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:55:59,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:55:59,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:55:59,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:55:59,417 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 15:55:59,417 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:55:59,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:55:59,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:55:59,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:55:59,645 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:55:59,645 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:55:59,646 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/for_bounded_loop1.c [2022-04-27 15:55:59,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d89ccba9/8d2ad729d270447e879d953d2aadbb69/FLAG9f0f4b5c4 [2022-04-27 15:56:00,042 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:56:00,043 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/for_bounded_loop1.c [2022-04-27 15:56:00,046 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d89ccba9/8d2ad729d270447e879d953d2aadbb69/FLAG9f0f4b5c4 [2022-04-27 15:56:00,055 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d89ccba9/8d2ad729d270447e879d953d2aadbb69 [2022-04-27 15:56:00,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:56:00,057 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 15:56:00,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:56:00,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:56:00,061 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:56:00,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:56:00" (1/1) ... [2022-04-27 15:56:00,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eae9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:00, skipping insertion in model container [2022-04-27 15:56:00,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:56:00" (1/1) ... [2022-04-27 15:56:00,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:56:00,074 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:56:00,200 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/for_bounded_loop1.c[416,429] [2022-04-27 15:56:00,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:56:00,216 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:56:00,225 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/for_bounded_loop1.c[416,429] [2022-04-27 15:56:00,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:56:00,236 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:56:00,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:00 WrapperNode [2022-04-27 15:56:00,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:56:00,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:56:00,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:56:00,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:56:00,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:00" (1/1) ... [2022-04-27 15:56:00,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:00" (1/1) ... [2022-04-27 15:56:00,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:00" (1/1) ... [2022-04-27 15:56:00,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:00" (1/1) ... [2022-04-27 15:56:00,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:00" (1/1) ... [2022-04-27 15:56:00,267 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:00" (1/1) ... [2022-04-27 15:56:00,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:00" (1/1) ... [2022-04-27 15:56:00,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:56:00,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:56:00,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:56:00,274 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:56:00,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:00" (1/1) ... [2022-04-27 15:56:00,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:56:00,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:00,309 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:56:00,340 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:56:00,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:56:00,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:56:00,353 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:56:00,353 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 15:56:00,353 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 15:56:00,353 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:56:00,354 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:56:00,354 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:56:00,354 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:56:00,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:56:00,354 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 15:56:00,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 15:56:00,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:56:00,354 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:56:00,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:56:00,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:56:00,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:56:00,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:56:00,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:56:00,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:56:00,428 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:56:00,429 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:56:00,595 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:56:00,600 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:56:00,601 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:56:00,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:00 BoogieIcfgContainer [2022-04-27 15:56:00,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:56:00,603 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 15:56:00,603 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 15:56:00,604 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 15:56:00,606 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:00" (1/1) ... [2022-04-27 15:56:00,608 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 15:56:00,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:56:00 BasicIcfg [2022-04-27 15:56:00,642 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 15:56:00,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:56:00,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:56:00,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:56:00,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:56:00" (1/4) ... [2022-04-27 15:56:00,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@751820d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:56:00, skipping insertion in model container [2022-04-27 15:56:00,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:00" (2/4) ... [2022-04-27 15:56:00,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@751820d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:56:00, skipping insertion in model container [2022-04-27 15:56:00,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:00" (3/4) ... [2022-04-27 15:56:00,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@751820d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:56:00, skipping insertion in model container [2022-04-27 15:56:00,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:56:00" (4/4) ... [2022-04-27 15:56:00,647 INFO L111 eAbstractionObserver]: Analyzing ICFG for_bounded_loop1.cJordan [2022-04-27 15:56:00,660 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:56:00,661 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:56:00,704 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:56:00,718 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@2d0bffb9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@16456cb3 [2022-04-27 15:56:00,718 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:56:00,726 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 16 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 15:56:00,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 15:56:00,732 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:00,732 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:00,732 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:00,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:00,738 INFO L85 PathProgramCache]: Analyzing trace with hash -932305726, now seen corresponding path program 1 times [2022-04-27 15:56:00,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:00,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713565841] [2022-04-27 15:56:00,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:00,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:00,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:00,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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) (= (select |v_#length_1| 2) 20) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {27#true} is VALID [2022-04-27 15:56:00,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 15:56:00,913 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 15:56:00,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:56:00,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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) (= (select |v_#length_1| 2) 20) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {27#true} is VALID [2022-04-27 15:56:00,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 15:56:00,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 15:56:00,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 15:56:00,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} [67] mainENTRY-->L21: Formula: (and (= v_main_~i~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~y~0_1 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~i~0, main_~y~0, main_~n~0] {27#true} is VALID [2022-04-27 15:56:00,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} [70] L21-->L22-2: Formula: (and (< 0 v_main_~n~0_3) (= v_main_~i~0_2 0)) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_~i~0] {27#true} is VALID [2022-04-27 15:56:00,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} [72] L22-2-->L22-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-27 15:56:00,917 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#false} [75] L22-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {28#false} is VALID [2022-04-27 15:56:00,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} [77] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {28#false} is VALID [2022-04-27 15:56:00,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} [79] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-27 15:56:00,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} [83] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-27 15:56:00,918 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:56:00,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:00,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713565841] [2022-04-27 15:56:00,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713565841] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:00,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:00,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 15:56:00,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386121554] [2022-04-27 15:56:00,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:00,924 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:56:00,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:00,927 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:56:00,951 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:56:00,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 15:56:00,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:00,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 15:56:00,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 15:56:00,967 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 16 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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:56:01,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:01,055 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-27 15:56:01,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 15:56:01,055 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:56:01,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:01,057 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:56:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-04-27 15:56:01,065 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:56:01,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-04-27 15:56:01,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 30 transitions. [2022-04-27 15:56:01,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:01,112 INFO L225 Difference]: With dead ends: 24 [2022-04-27 15:56:01,112 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 15:56:01,114 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:56:01,116 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:01,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:56:01,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 15:56:01,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-27 15:56:01,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:01,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 15:56:01,140 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 15:56:01,141 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 15:56:01,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:01,147 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-27 15:56:01,148 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 15:56:01,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:01,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:01,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-27 15:56:01,150 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-27 15:56:01,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:01,153 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-27 15:56:01,153 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 15:56:01,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:01,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:01,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:01,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:01,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 15:56:01,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-27 15:56:01,157 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2022-04-27 15:56:01,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:01,158 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-27 15:56:01,158 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:56:01,159 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 15:56:01,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 15:56:01,160 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:01,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:01,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:56:01,161 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:01,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:01,162 INFO L85 PathProgramCache]: Analyzing trace with hash -931382205, now seen corresponding path program 1 times [2022-04-27 15:56:01,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:01,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708742210] [2022-04-27 15:56:01,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:01,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:01,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:01,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {125#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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) (= (select |v_#length_1| 2) 20) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {119#true} is VALID [2022-04-27 15:56:01,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {119#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {119#true} is VALID [2022-04-27 15:56:01,260 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {119#true} {119#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {119#true} is VALID [2022-04-27 15:56:01,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {119#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {125#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:56:01,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {125#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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) (= (select |v_#length_1| 2) 20) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {119#true} is VALID [2022-04-27 15:56:01,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {119#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {119#true} is VALID [2022-04-27 15:56:01,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119#true} {119#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {119#true} is VALID [2022-04-27 15:56:01,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {119#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {119#true} is VALID [2022-04-27 15:56:01,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {119#true} [67] mainENTRY-->L21: Formula: (and (= v_main_~i~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~y~0_1 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~i~0, main_~y~0, main_~n~0] {119#true} is VALID [2022-04-27 15:56:01,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {119#true} [70] L21-->L22-2: Formula: (and (< 0 v_main_~n~0_3) (= v_main_~i~0_2 0)) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_~i~0] {124#(and (<= 1 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-27 15:56:01,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {124#(and (<= 1 main_~n~0) (= main_~i~0 0))} [73] L22-2-->L22-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {120#false} is VALID [2022-04-27 15:56:01,263 INFO L272 TraceCheckUtils]: 8: Hoare triple {120#false} [75] L22-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {120#false} is VALID [2022-04-27 15:56:01,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {120#false} [77] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {120#false} is VALID [2022-04-27 15:56:01,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {120#false} [79] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {120#false} is VALID [2022-04-27 15:56:01,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {120#false} [83] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#false} is VALID [2022-04-27 15:56:01,266 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:56:01,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:01,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708742210] [2022-04-27 15:56:01,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708742210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:01,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:01,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:56:01,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61014072] [2022-04-27 15:56:01,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:01,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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:56:01,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:01,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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:56:01,281 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:56:01,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:56:01,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:01,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:56:01,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:56:01,287 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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:56:01,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:01,431 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-27 15:56:01,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:56:01,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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:56:01,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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:56:01,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-27 15:56:01,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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:56:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-27 15:56:01,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2022-04-27 15:56:01,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:01,477 INFO L225 Difference]: With dead ends: 26 [2022-04-27 15:56:01,478 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 15:56:01,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:56:01,480 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:01,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 25 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:56:01,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 15:56:01,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-04-27 15:56:01,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:01,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 15:56:01,487 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 15:56:01,487 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 15:56:01,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:01,490 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-27 15:56:01,490 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-27 15:56:01,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:01,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:01,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-27 15:56:01,491 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-27 15:56:01,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:01,495 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-27 15:56:01,496 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-27 15:56:01,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:01,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:01,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:01,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:01,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 15:56:01,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-27 15:56:01,499 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2022-04-27 15:56:01,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:01,499 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-27 15:56:01,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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:56:01,500 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-27 15:56:01,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 15:56:01,501 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:01,501 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:01,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:56:01,501 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:01,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:01,502 INFO L85 PathProgramCache]: Analyzing trace with hash -930428893, now seen corresponding path program 1 times [2022-04-27 15:56:01,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:01,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418095932] [2022-04-27 15:56:01,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:01,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:01,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:01,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {238#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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) (= (select |v_#length_1| 2) 20) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {229#true} is VALID [2022-04-27 15:56:01,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#true} is VALID [2022-04-27 15:56:01,631 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {229#true} {229#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#true} is VALID [2022-04-27 15:56:01,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {229#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {238#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:56:01,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {238#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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) (= (select |v_#length_1| 2) 20) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {229#true} is VALID [2022-04-27 15:56:01,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#true} is VALID [2022-04-27 15:56:01,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229#true} {229#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#true} is VALID [2022-04-27 15:56:01,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {229#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#true} is VALID [2022-04-27 15:56:01,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {229#true} [67] mainENTRY-->L21: Formula: (and (= v_main_~i~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~y~0_1 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~i~0, main_~y~0, main_~n~0] {234#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 15:56:01,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {234#(and (= main_~x~0 0) (= main_~y~0 0))} [70] L21-->L22-2: Formula: (and (< 0 v_main_~n~0_3) (= v_main_~i~0_2 0)) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_~i~0] {234#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 15:56:01,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {234#(and (= main_~x~0 0) (= main_~y~0 0))} [74] L22-2-->L25: Formula: (and (< v_main_~i~0_4 v_main_~n~0_5) (= (+ v_main_~x~0_4 (* (- 1) v_main_~y~0_2)) v_main_~x~0_3)) InVars {main_~i~0=v_main_~i~0_4, main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_5, main_~x~0=v_main_~x~0_4} OutVars{main_~i~0=v_main_~i~0_4, main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_5, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0] {235#(and (<= main_~x~0 0) (< 0 (+ main_~x~0 1)))} is VALID [2022-04-27 15:56:01,637 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#(and (<= main_~x~0 0) (< 0 (+ main_~x~0 1)))} [76] L25-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~x~0_9 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {236#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 15:56:01,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {236#(not (= |__VERIFIER_assert_#in~cond| 0))} [77] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {237#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 15:56:01,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {237#(not (= __VERIFIER_assert_~cond 0))} [79] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {230#false} is VALID [2022-04-27 15:56:01,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {230#false} [83] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {230#false} is VALID [2022-04-27 15:56:01,639 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:56:01,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:01,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418095932] [2022-04-27 15:56:01,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418095932] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:01,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:01,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 15:56:01,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683970185] [2022-04-27 15:56:01,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:01,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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:56:01,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:01,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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:56:01,655 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:56:01,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 15:56:01,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:01,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 15:56:01,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 15:56:01,660 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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:56:01,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:01,887 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-27 15:56:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 15:56:01,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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:56:01,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:01,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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:56:01,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-27 15:56:01,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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:56:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-27 15:56:01,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2022-04-27 15:56:01,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:01,920 INFO L225 Difference]: With dead ends: 28 [2022-04-27 15:56:01,920 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 15:56:01,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-27 15:56:01,926 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:01,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 33 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:56:01,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 15:56:01,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-04-27 15:56:01,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:01,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 15:56:01,933 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 15:56:01,933 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 15:56:01,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:01,936 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-27 15:56:01,936 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-27 15:56:01,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:01,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:01,937 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-04-27 15:56:01,937 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-04-27 15:56:01,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:01,938 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-27 15:56:01,939 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-27 15:56:01,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:01,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:01,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:01,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:01,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 15:56:01,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-27 15:56:01,943 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 12 [2022-04-27 15:56:01,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:01,943 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-27 15:56:01,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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:56:01,944 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-27 15:56:01,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 15:56:01,944 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:01,944 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:01,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:56:01,945 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:01,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:01,945 INFO L85 PathProgramCache]: Analyzing trace with hash 231391925, now seen corresponding path program 1 times [2022-04-27 15:56:01,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:01,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053715854] [2022-04-27 15:56:01,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:01,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:02,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:02,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {375#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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) (= (select |v_#length_1| 2) 20) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {361#true} is VALID [2022-04-27 15:56:02,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {361#true} is VALID [2022-04-27 15:56:02,096 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {361#true} {361#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {361#true} is VALID [2022-04-27 15:56:02,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-27 15:56:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:02,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {361#true} [77] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {361#true} is VALID [2022-04-27 15:56:02,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#true} [80] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {361#true} is VALID [2022-04-27 15:56:02,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#true} [85] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {361#true} is VALID [2022-04-27 15:56:02,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {361#true} {367#(= main_~x~0 0)} [90] __VERIFIER_assertEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~x~0_9 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {367#(= main_~x~0 0)} is VALID [2022-04-27 15:56:02,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {361#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {375#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:56:02,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {375#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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) (= (select |v_#length_1| 2) 20) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {361#true} is VALID [2022-04-27 15:56:02,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {361#true} is VALID [2022-04-27 15:56:02,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {361#true} {361#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {361#true} is VALID [2022-04-27 15:56:02,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {361#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {361#true} is VALID [2022-04-27 15:56:02,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {361#true} [67] mainENTRY-->L21: Formula: (and (= v_main_~i~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~y~0_1 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~i~0, main_~y~0, main_~n~0] {366#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 15:56:02,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {366#(and (= main_~x~0 0) (= main_~y~0 0))} [70] L21-->L22-2: Formula: (and (< 0 v_main_~n~0_3) (= v_main_~i~0_2 0)) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_~i~0] {366#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 15:56:02,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {366#(and (= main_~x~0 0) (= main_~y~0 0))} [74] L22-2-->L25: Formula: (and (< v_main_~i~0_4 v_main_~n~0_5) (= (+ v_main_~x~0_4 (* (- 1) v_main_~y~0_2)) v_main_~x~0_3)) InVars {main_~i~0=v_main_~i~0_4, main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_5, main_~x~0=v_main_~x~0_4} OutVars{main_~i~0=v_main_~i~0_4, main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_5, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0] {367#(= main_~x~0 0)} is VALID [2022-04-27 15:56:02,118 INFO L272 TraceCheckUtils]: 8: Hoare triple {367#(= main_~x~0 0)} [76] L25-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~x~0_9 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {361#true} is VALID [2022-04-27 15:56:02,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {361#true} [77] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {361#true} is VALID [2022-04-27 15:56:02,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {361#true} [80] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {361#true} is VALID [2022-04-27 15:56:02,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {361#true} [85] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {361#true} is VALID [2022-04-27 15:56:02,120 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {361#true} {367#(= main_~x~0 0)} [90] __VERIFIER_assertEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~x~0_9 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {367#(= main_~x~0 0)} is VALID [2022-04-27 15:56:02,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {367#(= main_~x~0 0)} [78] L25-1-->L27: Formula: (and (= v_main_~y~0_3 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_#t~nondet6, main_~y~0] {367#(= main_~x~0 0)} is VALID [2022-04-27 15:56:02,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {367#(= main_~x~0 0)} [82] L27-->L29: Formula: (and (not (= v_main_~y~0_5 0)) (= v_main_~x~0_6 (+ v_main_~x~0_7 v_main_~y~0_5))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_5} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0] {372#(or (<= 1 main_~x~0) (<= (+ main_~x~0 1) 0))} is VALID [2022-04-27 15:56:02,121 INFO L272 TraceCheckUtils]: 15: Hoare triple {372#(or (<= 1 main_~x~0) (<= (+ main_~x~0 1) 0))} [86] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= v_main_~x~0_10 0)) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {373#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 15:56:02,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {373#(not (= |__VERIFIER_assert_#in~cond| 0))} [77] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {374#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 15:56:02,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {374#(not (= __VERIFIER_assert_~cond 0))} [79] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {362#false} is VALID [2022-04-27 15:56:02,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {362#false} [83] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {362#false} is VALID [2022-04-27 15:56:02,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:56:02,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:02,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053715854] [2022-04-27 15:56:02,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053715854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:02,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:02,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 15:56:02,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416754557] [2022-04-27 15:56:02,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:02,124 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-27 15:56:02,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:02,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:56:02,138 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:56:02,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 15:56:02,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:02,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 15:56:02,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 15:56:02,139 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:56:02,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:02,558 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-27 15:56:02,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 15:56:02,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-27 15:56:02,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:56:02,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-27 15:56:02,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:56:02,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-27 15:56:02,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 37 transitions. [2022-04-27 15:56:02,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:02,603 INFO L225 Difference]: With dead ends: 36 [2022-04-27 15:56:02,603 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 15:56:02,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-27 15:56:02,604 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:02,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 43 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:56:02,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 15:56:02,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2022-04-27 15:56:02,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:02,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 15:56:02,607 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 15:56:02,608 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 15:56:02,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:02,609 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-27 15:56:02,609 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-27 15:56:02,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:02,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:02,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-04-27 15:56:02,610 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-04-27 15:56:02,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:02,612 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-27 15:56:02,612 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-27 15:56:02,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:02,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:02,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:02,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:02,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 15:56:02,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-27 15:56:02,618 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 19 [2022-04-27 15:56:02,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:02,618 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-27 15:56:02,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:56:02,619 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-27 15:56:02,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 15:56:02,619 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:02,619 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:02,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:56:02,619 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:02,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:02,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1683544803, now seen corresponding path program 1 times [2022-04-27 15:56:02,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:02,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994240855] [2022-04-27 15:56:02,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:02,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:56:02,634 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 15:56:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:56:02,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 15:56:02,664 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 15:56:02,665 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:56:02,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 15:56:02,668 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-27 15:56:02,671 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:56:02,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:56:02 BasicIcfg [2022-04-27 15:56:02,695 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:56:02,696 INFO L158 Benchmark]: Toolchain (without parser) took 2638.20ms. Allocated memory was 200.3MB in the beginning and 245.4MB in the end (delta: 45.1MB). Free memory was 150.7MB in the beginning and 187.8MB in the end (delta: -37.1MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. [2022-04-27 15:56:02,696 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory is still 167.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:56:02,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.72ms. Allocated memory is still 200.3MB. Free memory was 150.5MB in the beginning and 175.9MB in the end (delta: -25.4MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-04-27 15:56:02,696 INFO L158 Benchmark]: Boogie Preprocessor took 35.94ms. Allocated memory is still 200.3MB. Free memory was 175.9MB in the beginning and 174.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 15:56:02,696 INFO L158 Benchmark]: RCFGBuilder took 327.85ms. Allocated memory is still 200.3MB. Free memory was 174.3MB in the beginning and 163.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 15:56:02,697 INFO L158 Benchmark]: IcfgTransformer took 39.14ms. Allocated memory is still 200.3MB. Free memory was 163.3MB in the beginning and 161.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 15:56:02,697 INFO L158 Benchmark]: TraceAbstraction took 2051.95ms. Allocated memory was 200.3MB in the beginning and 245.4MB in the end (delta: 45.1MB). Free memory was 161.2MB in the beginning and 187.8MB in the end (delta: -26.5MB). Peak memory consumption was 20.1MB. Max. memory is 8.0GB. [2022-04-27 15:56:02,698 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.10ms. Allocated memory is still 200.3MB. Free memory is still 167.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 178.72ms. Allocated memory is still 200.3MB. Free memory was 150.5MB in the beginning and 175.9MB in the end (delta: -25.4MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.94ms. Allocated memory is still 200.3MB. Free memory was 175.9MB in the beginning and 174.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 327.85ms. Allocated memory is still 200.3MB. Free memory was 174.3MB in the beginning and 163.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 39.14ms. Allocated memory is still 200.3MB. Free memory was 163.3MB in the beginning and 161.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2051.95ms. Allocated memory was 200.3MB in the beginning and 245.4MB in the end (delta: 45.1MB). Free memory was 161.2MB in the beginning and 187.8MB in the end (delta: -26.5MB). Peak memory consumption was 20.1MB. 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 - CounterExampleResult [Line: 11]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int i=0, x=0, y=0; [L20] int n=__VERIFIER_nondet_int(); [L21] COND FALSE !(!(n>0)) [L22] i=0 VAL [i=0, n=1, x=0, y=0] [L22] COND TRUE i