/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_infinite_loop_2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 16:41:43,711 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 16:41:43,712 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 16:41:43,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 16:41:43,740 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 16:41:43,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 16:41:43,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 16:41:43,749 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 16:41:43,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 16:41:43,750 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 16:41:43,751 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 16:41:43,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 16:41:43,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 16:41:43,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 16:41:43,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 16:41:43,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 16:41:43,754 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 16:41:43,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 16:41:43,756 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 16:41:43,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 16:41:43,758 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 16:41:43,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 16:41:43,766 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 16:41:43,767 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 16:41:43,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 16:41:43,774 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 16:41:43,775 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 16:41:43,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 16:41:43,775 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 16:41:43,775 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 16:41:43,776 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 16:41:43,776 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 16:41:43,777 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 16:41:43,777 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 16:41:43,778 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 16:41:43,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 16:41:43,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 16:41:43,779 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 16:41:43,779 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 16:41:43,779 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 16:41:43,780 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 16:41:43,785 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 16:41:43,786 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 16:41:43,795 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 16:41:43,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 16:41:43,796 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 16:41:43,796 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 16:41:43,797 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 16:41:43,797 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 16:41:43,797 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 16:41:43,797 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 16:41:43,797 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 16:41:43,798 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 16:41:43,798 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 16:41:43,798 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 16:41:43,798 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 16:41:43,798 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 16:41:43,798 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 16:41:43,798 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 16:41:43,798 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 16:41:43,798 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 16:41:43,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:41:43,799 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 16:41:43,799 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 16:41:43,799 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 16:41:43,799 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-07 16:41:44,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 16:41:44,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 16:41:44,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 16:41:44,068 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 16:41:44,068 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 16:41:44,069 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/for_infinite_loop_2.c [2022-04-07 16:41:44,110 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a399d0a4d/e7e6122bf95440508140a762fecca501/FLAG33a5b66d7 [2022-04-07 16:41:44,471 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 16:41:44,471 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/for_infinite_loop_2.c [2022-04-07 16:41:44,475 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a399d0a4d/e7e6122bf95440508140a762fecca501/FLAG33a5b66d7 [2022-04-07 16:41:44,487 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a399d0a4d/e7e6122bf95440508140a762fecca501 [2022-04-07 16:41:44,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 16:41:44,490 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 16:41:44,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 16:41:44,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 16:41:44,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 16:41:44,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:41:44" (1/1) ... [2022-04-07 16:41:44,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3af429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:44, skipping insertion in model container [2022-04-07 16:41:44,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:41:44" (1/1) ... [2022-04-07 16:41:44,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 16:41:44,512 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 16:41:44,699 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_infinite_loop_2.c[418,431] [2022-04-07 16:41:44,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:41:44,723 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 16:41:44,732 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_infinite_loop_2.c[418,431] [2022-04-07 16:41:44,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:41:44,748 INFO L208 MainTranslator]: Completed translation [2022-04-07 16:41:44,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:44 WrapperNode [2022-04-07 16:41:44,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 16:41:44,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 16:41:44,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 16:41:44,750 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 16:41:44,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:44" (1/1) ... [2022-04-07 16:41:44,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:44" (1/1) ... [2022-04-07 16:41:44,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:44" (1/1) ... [2022-04-07 16:41:44,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:44" (1/1) ... [2022-04-07 16:41:44,772 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:44" (1/1) ... [2022-04-07 16:41:44,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:44" (1/1) ... [2022-04-07 16:41:44,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:44" (1/1) ... [2022-04-07 16:41:44,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 16:41:44,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 16:41:44,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 16:41:44,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 16:41:44,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:44" (1/1) ... [2022-04-07 16:41:44,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:41:44,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:41:44,822 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-07 16:41:44,853 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-07 16:41:44,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 16:41:44,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 16:41:44,869 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 16:41:44,869 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 16:41:44,869 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 16:41:44,869 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 16:41:44,869 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 16:41:44,869 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 16:41:44,869 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 16:41:44,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 16:41:44,869 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 16:41:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 16:41:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 16:41:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 16:41:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 16:41:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 16:41:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 16:41:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 16:41:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 16:41:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 16:41:44,940 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 16:41:44,942 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 16:41:45,059 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 16:41:45,064 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 16:41:45,064 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 16:41:45,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:41:45 BoogieIcfgContainer [2022-04-07 16:41:45,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 16:41:45,074 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 16:41:45,085 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 16:41:45,088 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 16:41:45,090 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:41:45" (1/1) ... [2022-04-07 16:41:45,092 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 16:41:45,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 04:41:45 BasicIcfg [2022-04-07 16:41:45,115 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 16:41:45,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 16:41:45,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 16:41:45,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 16:41:45,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 04:41:44" (1/4) ... [2022-04-07 16:41:45,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d847b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:41:45, skipping insertion in model container [2022-04-07 16:41:45,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:44" (2/4) ... [2022-04-07 16:41:45,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d847b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:41:45, skipping insertion in model container [2022-04-07 16:41:45,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:41:45" (3/4) ... [2022-04-07 16:41:45,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d847b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 04:41:45, skipping insertion in model container [2022-04-07 16:41:45,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 04:41:45" (4/4) ... [2022-04-07 16:41:45,135 INFO L111 eAbstractionObserver]: Analyzing ICFG for_infinite_loop_2.cJordan [2022-04-07 16:41:45,147 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 16:41:45,147 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 16:41:45,190 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 16:41:45,194 INFO L340 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 [2022-04-07 16:41:45,194 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 16:41:45,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 16:41:45,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 16:41:45,210 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:41:45,211 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:41:45,211 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:41:45,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:41:45,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1508123324, now seen corresponding path program 1 times [2022-04-07 16:41:45,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:41:45,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624948393] [2022-04-07 16:41:45,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:41:45,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:41:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:45,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:41:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:45,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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) (= (select |v_#length_1| 2) 22))) 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] {24#true} is VALID [2022-04-07 16:41:45,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-07 16:41:45,332 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-07 16:41:45,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:41:45,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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) (= (select |v_#length_1| 2) 22))) 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] {24#true} is VALID [2022-04-07 16:41:45,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-07 16:41:45,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-07 16:41:45,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-07 16:41:45,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [59] mainENTRY-->L22: Formula: (and (= v_main_~i~0_3 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_3, 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] {24#true} is VALID [2022-04-07 16:41:45,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [62] L22-->L23-2: Formula: (and (< 0 v_main_~n~0_3) (= v_main_~i~0_4 0)) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_~i~0] {24#true} is VALID [2022-04-07 16:41:45,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#true} [64] L23-2-->L23-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-07 16:41:45,353 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} [67] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= v_main_~x~0_5 0)) 1 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {25#false} is VALID [2022-04-07 16:41:45,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} [69] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {25#false} is VALID [2022-04-07 16:41:45,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [71] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-07 16:41:45,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} [73] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-07 16:41:45,354 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-07 16:41:45,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:41:45,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624948393] [2022-04-07 16:41:45,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624948393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:41:45,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:41:45,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 16:41:45,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692478947] [2022-04-07 16:41:45,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:41:45,360 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-07 16:41:45,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:41:45,363 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-07 16:41:45,382 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-07 16:41:45,382 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 16:41:45,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:41:45,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 16:41:45,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 16:41:45,402 INFO L87 Difference]: Start difference. First operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) 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-07 16:41:45,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:45,456 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-07 16:41:45,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 16:41:45,457 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-07 16:41:45,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:41:45,458 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-07 16:41:45,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-07 16:41:45,468 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-07 16:41:45,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-07 16:41:45,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-04-07 16:41:45,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:41:45,509 INFO L225 Difference]: With dead ends: 20 [2022-04-07 16:41:45,509 INFO L226 Difference]: Without dead ends: 16 [2022-04-07 16:41:45,511 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 16:41:45,514 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 16:41:45,516 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 16:41:45,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-07 16:41:45,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-07 16:41:45,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:41:45,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 16:41:45,535 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 16:41:45,536 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 16:41:45,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:45,537 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-07 16:41:45,537 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-07 16:41:45,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:41:45,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:41:45,538 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 16 states. [2022-04-07 16:41:45,538 INFO L87 Difference]: Start difference. First operand has 16 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 16 states. [2022-04-07 16:41:45,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:45,542 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-07 16:41:45,542 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-07 16:41:45,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:41:45,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:41:45,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:41:45,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:41:45,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 16:41:45,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-07 16:41:45,546 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2022-04-07 16:41:45,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:41:45,547 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-07 16:41:45,547 INFO L479 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-07 16:41:45,548 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-07 16:41:45,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 16:41:45,549 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:41:45,549 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:41:45,550 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 16:41:45,550 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:41:45,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:41:45,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1510000157, now seen corresponding path program 1 times [2022-04-07 16:41:45,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:41:45,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615040104] [2022-04-07 16:41:45,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:41:45,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:41:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:45,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:41:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:45,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {108#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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) (= (select |v_#length_1| 2) 22))) 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] {100#true} is VALID [2022-04-07 16:41:45,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {100#true} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-07 16:41:45,623 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {100#true} {100#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-07 16:41:45,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {100#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {108#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:41:45,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {108#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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) (= (select |v_#length_1| 2) 22))) 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] {100#true} is VALID [2022-04-07 16:41:45,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {100#true} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-07 16:41:45,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100#true} {100#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-07 16:41:45,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {100#true} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-07 16:41:45,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {100#true} [59] mainENTRY-->L22: Formula: (and (= v_main_~i~0_3 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_3, 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] {105#(= main_~x~0 0)} is VALID [2022-04-07 16:41:45,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {105#(= main_~x~0 0)} [62] L22-->L23-2: Formula: (and (< 0 v_main_~n~0_3) (= v_main_~i~0_4 0)) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_~i~0] {105#(= main_~x~0 0)} is VALID [2022-04-07 16:41:45,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {105#(= main_~x~0 0)} [66] L23-2-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105#(= main_~x~0 0)} is VALID [2022-04-07 16:41:45,627 INFO L272 TraceCheckUtils]: 8: Hoare triple {105#(= main_~x~0 0)} [68] L25-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_4 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {106#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 16:41:45,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {106#(not (= |__VERIFIER_assert_#in~cond| 0))} [69] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {107#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 16:41:45,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {107#(not (= __VERIFIER_assert_~cond 0))} [71] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {101#false} is VALID [2022-04-07 16:41:45,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {101#false} [73] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {101#false} is VALID [2022-04-07 16:41:45,628 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-07 16:41:45,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:41:45,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615040104] [2022-04-07 16:41:45,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615040104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:41:45,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:41:45,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 16:41:45,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470340177] [2022-04-07 16:41:45,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:41:45,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 16:41:45,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:41:45,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:41:45,641 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-07 16:41:45,641 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 16:41:45,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:41:45,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 16:41:45,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 16:41:45,643 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:41:45,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:45,735 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-07 16:41:45,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 16:41:45,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 16:41:45,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:41:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:41:45,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2022-04-07 16:41:45,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:41:45,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2022-04-07 16:41:45,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 15 transitions. [2022-04-07 16:41:45,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:41:45,759 INFO L225 Difference]: With dead ends: 14 [2022-04-07 16:41:45,759 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 16:41:45,762 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-07 16:41:45,765 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 16:41:45,765 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 28 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 16:41:45,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 16:41:45,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 16:41:45,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:41:45,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 16:41:45,767 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 16:41:45,767 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 16:41:45,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:45,768 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 16:41:45,768 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 16:41:45,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:41:45,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:41:45,768 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 16:41:45,768 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 16:41:45,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:45,768 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 16:41:45,768 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 16:41:45,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:41:45,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:41:45,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:41:45,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:41:45,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 16:41:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 16:41:45,770 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2022-04-07 16:41:45,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:41:45,770 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 16:41:45,770 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:41:45,770 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 16:41:45,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:41:45,772 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 16:41:45,773 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 16:41:45,775 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-07 16:41:45,776 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 16:41:45,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 04:41:45 BasicIcfg [2022-04-07 16:41:45,778 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 16:41:45,779 INFO L158 Benchmark]: Toolchain (without parser) took 1288.33ms. Allocated memory was 215.0MB in the beginning and 287.3MB in the end (delta: 72.4MB). Free memory was 159.8MB in the beginning and 201.0MB in the end (delta: -41.2MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-04-07 16:41:45,779 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 215.0MB. Free memory is still 175.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 16:41:45,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.97ms. Allocated memory was 215.0MB in the beginning and 287.3MB in the end (delta: 72.4MB). Free memory was 159.7MB in the beginning and 260.8MB in the end (delta: -101.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 16:41:45,780 INFO L158 Benchmark]: Boogie Preprocessor took 27.22ms. Allocated memory is still 287.3MB. Free memory was 260.8MB in the beginning and 259.7MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 16:41:45,780 INFO L158 Benchmark]: RCFGBuilder took 295.24ms. Allocated memory is still 287.3MB. Free memory was 259.6MB in the beginning and 249.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-07 16:41:45,780 INFO L158 Benchmark]: IcfgTransformer took 41.58ms. Allocated memory is still 287.3MB. Free memory was 249.1MB in the beginning and 247.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 16:41:45,781 INFO L158 Benchmark]: TraceAbstraction took 655.97ms. Allocated memory is still 287.3MB. Free memory was 247.1MB in the beginning and 201.0MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2022-04-07 16:41:45,782 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.09ms. Allocated memory is still 215.0MB. Free memory is still 175.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 256.97ms. Allocated memory was 215.0MB in the beginning and 287.3MB in the end (delta: 72.4MB). Free memory was 159.7MB in the beginning and 260.8MB in the end (delta: -101.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.22ms. Allocated memory is still 287.3MB. Free memory was 260.8MB in the beginning and 259.7MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 295.24ms. Allocated memory is still 287.3MB. Free memory was 259.6MB in the beginning and 249.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 41.58ms. Allocated memory is still 287.3MB. Free memory was 249.1MB in the beginning and 247.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 655.97ms. Allocated memory is still 287.3MB. Free memory was 247.1MB in the beginning and 201.0MB in the end (delta: 46.1MB). Peak memory consumption was 46.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 - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 30 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 46 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-07 16:41:45,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...