/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-e106359-m [2022-04-14 18:55:58,966 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 18:55:58,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 18:55:59,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 18:55:59,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 18:55:59,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 18:55:59,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 18:55:59,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 18:55:59,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 18:55:59,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 18:55:59,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 18:55:59,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 18:55:59,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 18:55:59,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 18:55:59,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 18:55:59,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 18:55:59,032 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 18:55:59,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 18:55:59,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 18:55:59,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 18:55:59,039 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 18:55:59,040 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 18:55:59,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 18:55:59,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 18:55:59,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 18:55:59,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 18:55:59,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 18:55:59,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 18:55:59,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 18:55:59,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 18:55:59,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 18:55:59,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 18:55:59,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 18:55:59,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 18:55:59,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 18:55:59,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 18:55:59,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 18:55:59,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 18:55:59,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 18:55:59,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 18:55:59,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 18:55:59,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 18:55:59,054 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 18:55:59,062 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 18:55:59,063 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 18:55:59,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 18:55:59,064 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 18:55:59,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 18:55:59,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 18:55:59,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 18:55:59,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 18:55:59,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 18:55:59,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 18:55:59,065 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 18:55:59,065 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 18:55:59,065 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 18:55:59,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 18:55:59,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 18:55:59,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 18:55:59,065 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 18:55:59,065 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 18:55:59,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 18:55:59,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 18:55:59,066 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 18:55:59,066 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 18:55:59,066 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-14 18:55:59,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 18:55:59,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 18:55:59,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 18:55:59,290 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 18:55:59,290 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 18:55:59,292 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-14 18:55:59,338 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b68575a3/32c8eef3b84a473dbc8171a378fcc2a0/FLAG131e60f9b [2022-04-14 18:55:59,721 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 18:55:59,722 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/for_infinite_loop_2.c [2022-04-14 18:55:59,727 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b68575a3/32c8eef3b84a473dbc8171a378fcc2a0/FLAG131e60f9b [2022-04-14 18:56:00,139 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b68575a3/32c8eef3b84a473dbc8171a378fcc2a0 [2022-04-14 18:56:00,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 18:56:00,143 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 18:56:00,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 18:56:00,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 18:56:00,160 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 18:56:00,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 06:56:00" (1/1) ... [2022-04-14 18:56:00,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef0851d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:56:00, skipping insertion in model container [2022-04-14 18:56:00,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 06:56:00" (1/1) ... [2022-04-14 18:56:00,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 18:56:00,185 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 18:56:00,388 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-14 18:56:00,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 18:56:00,423 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 18:56:00,432 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-14 18:56:00,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 18:56:00,459 INFO L208 MainTranslator]: Completed translation [2022-04-14 18:56:00,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:56:00 WrapperNode [2022-04-14 18:56:00,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 18:56:00,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 18:56:00,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 18:56:00,474 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 18:56:00,504 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:56:00" (1/1) ... [2022-04-14 18:56:00,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:56:00" (1/1) ... [2022-04-14 18:56:00,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:56:00" (1/1) ... [2022-04-14 18:56:00,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:56:00" (1/1) ... [2022-04-14 18:56:00,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:56:00" (1/1) ... [2022-04-14 18:56:00,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:56:00" (1/1) ... [2022-04-14 18:56:00,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:56:00" (1/1) ... [2022-04-14 18:56:00,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 18:56:00,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 18:56:00,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 18:56:00,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 18:56:00,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:56:00" (1/1) ... [2022-04-14 18:56:00,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 18:56:00,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 18:56:00,579 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-14 18:56:00,586 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-14 18:56:00,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 18:56:00,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 18:56:00,607 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 18:56:00,607 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 18:56:00,607 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 18:56:00,607 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 18:56:00,608 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 18:56:00,608 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 18:56:00,608 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 18:56:00,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 18:56:00,608 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 18:56:00,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 18:56:00,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 18:56:00,608 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 18:56:00,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 18:56:00,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 18:56:00,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 18:56:00,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 18:56:00,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 18:56:00,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 18:56:00,649 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 18:56:00,650 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 18:56:00,804 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 18:56:00,808 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 18:56:00,809 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 18:56:00,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 06:56:00 BoogieIcfgContainer [2022-04-14 18:56:00,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 18:56:00,810 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 18:56:00,810 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 18:56:00,811 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 18:56:00,813 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 06:56:00" (1/1) ... [2022-04-14 18:56:00,814 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 18:56:00,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 06:56:00 BasicIcfg [2022-04-14 18:56:00,848 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 18:56:00,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 18:56:00,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 18:56:00,852 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 18:56:00,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 06:56:00" (1/4) ... [2022-04-14 18:56:00,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295a872f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 06:56:00, skipping insertion in model container [2022-04-14 18:56:00,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:56:00" (2/4) ... [2022-04-14 18:56:00,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295a872f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 06:56:00, skipping insertion in model container [2022-04-14 18:56:00,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 06:56:00" (3/4) ... [2022-04-14 18:56:00,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295a872f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 06:56:00, skipping insertion in model container [2022-04-14 18:56:00,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 06:56:00" (4/4) ... [2022-04-14 18:56:00,854 INFO L111 eAbstractionObserver]: Analyzing ICFG for_infinite_loop_2.cJordan [2022-04-14 18:56:00,870 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 18:56:00,870 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 18:56:00,942 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 18:56:00,972 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-14 18:56:00,972 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 18:56:01,010 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-14 18:56:01,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 18:56:01,015 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:56:01,016 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:56:01,016 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:56:01,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:56:01,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1508123324, now seen corresponding path program 1 times [2022-04-14 18:56:01,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:56:01,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527586399] [2022-04-14 18:56:01,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:56:01,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:56:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:56:01,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:56:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:56:01,333 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-14 18:56:01,334 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-14 18:56:01,334 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-14 18:56:01,336 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-14 18:56:01,336 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-14 18:56:01,336 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-14 18:56:01,336 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-14 18:56:01,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-14 18:56:01,337 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-14 18:56:01,338 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-14 18:56:01,341 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-14 18:56:01,342 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-14 18:56:01,342 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-14 18:56:01,342 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-14 18:56:01,350 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-14 18:56:01,350 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-14 18:56:01,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:56:01,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527586399] [2022-04-14 18:56:01,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527586399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:56:01,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:56:01,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 18:56:01,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615315985] [2022-04-14 18:56:01,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:56:01,359 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-14 18:56:01,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:56:01,362 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-14 18:56:01,399 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-14 18:56:01,399 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 18:56:01,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:56:01,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 18:56:01,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 18:56:01,432 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-14 18:56:01,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:56:01,518 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-14 18:56:01,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 18:56:01,519 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-14 18:56:01,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:56:01,520 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-14 18:56:01,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-14 18:56:01,551 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-14 18:56:01,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-14 18:56:01,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-04-14 18:56:01,598 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-14 18:56:01,607 INFO L225 Difference]: With dead ends: 20 [2022-04-14 18:56:01,607 INFO L226 Difference]: Without dead ends: 16 [2022-04-14 18:56:01,608 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-14 18:56:01,611 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-14 18:56:01,613 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-14 18:56:01,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-14 18:56:01,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-14 18:56:01,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:56:01,652 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-14 18:56:01,652 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-14 18:56:01,653 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-14 18:56:01,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:56:01,658 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-14 18:56:01,658 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-14 18:56:01,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:56:01,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:56:01,671 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-14 18:56:01,671 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-14 18:56:01,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:56:01,674 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-14 18:56:01,674 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-14 18:56:01,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:56:01,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:56:01,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:56:01,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:56:01,675 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-14 18:56:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-14 18:56:01,676 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2022-04-14 18:56:01,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:56:01,677 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-14 18:56:01,677 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-14 18:56:01,678 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-14 18:56:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 18:56:01,679 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:56:01,681 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:56:01,681 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 18:56:01,684 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:56:01,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:56:01,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1510000157, now seen corresponding path program 1 times [2022-04-14 18:56:01,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:56:01,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702002074] [2022-04-14 18:56:01,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:56:01,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:56:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:56:01,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:56:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:56:01,856 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-14 18:56:01,856 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-14 18:56:01,857 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-14 18:56:01,859 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-14 18:56:01,861 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-14 18:56:01,861 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-14 18:56:01,861 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-14 18:56:01,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {100#true} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-14 18:56:01,878 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-14 18:56:01,879 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-14 18:56:01,879 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-14 18:56:01,881 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-14 18:56:01,881 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-14 18:56:01,882 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-14 18:56:01,882 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-14 18:56:01,882 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-14 18:56:01,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:56:01,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702002074] [2022-04-14 18:56:01,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702002074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:56:01,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:56:01,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 18:56:01,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279436596] [2022-04-14 18:56:01,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:56:01,884 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-14 18:56:01,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:56:01,885 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-14 18:56:01,909 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-14 18:56:01,910 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 18:56:01,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:56:01,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 18:56:01,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 18:56:01,911 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-14 18:56:02,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:56:02,116 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-14 18:56:02,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 18:56:02,116 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-14 18:56:02,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:56:02,119 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-14 18:56:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2022-04-14 18:56:02,121 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-14 18:56:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2022-04-14 18:56:02,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 15 transitions. [2022-04-14 18:56:02,147 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-14 18:56:02,148 INFO L225 Difference]: With dead ends: 14 [2022-04-14 18:56:02,148 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 18:56:02,150 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-14 18:56:02,152 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-14 18:56:02,153 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.1s Time] [2022-04-14 18:56:02,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 18:56:02,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 18:56:02,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:56:02,157 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-14 18:56:02,157 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-14 18:56:02,157 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-14 18:56:02,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:56:02,159 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 18:56:02,159 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 18:56:02,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:56:02,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:56:02,159 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-14 18:56:02,159 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-14 18:56:02,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:56:02,159 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 18:56:02,159 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 18:56:02,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:56:02,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:56:02,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:56:02,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:56:02,160 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-14 18:56:02,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 18:56:02,160 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2022-04-14 18:56:02,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:56:02,160 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 18:56:02,161 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-14 18:56:02,161 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 18:56:02,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:56:02,163 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 18:56:02,175 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 18:56:02,182 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-14 18:56:02,183 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 18:56:02,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 06:56:02 BasicIcfg [2022-04-14 18:56:02,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 18:56:02,191 INFO L158 Benchmark]: Toolchain (without parser) took 2048.12ms. Allocated memory was 154.1MB in the beginning and 188.7MB in the end (delta: 34.6MB). Free memory was 103.9MB in the beginning and 154.6MB in the end (delta: -50.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 18:56:02,191 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 154.1MB. Free memory was 120.3MB in the beginning and 120.2MB in the end (delta: 75.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 18:56:02,191 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.62ms. Allocated memory is still 154.1MB. Free memory was 103.8MB in the beginning and 130.6MB in the end (delta: -26.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 18:56:02,192 INFO L158 Benchmark]: Boogie Preprocessor took 56.16ms. Allocated memory is still 154.1MB. Free memory was 130.6MB in the beginning and 129.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 18:56:02,207 INFO L158 Benchmark]: RCFGBuilder took 279.48ms. Allocated memory is still 154.1MB. Free memory was 129.0MB in the beginning and 119.1MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-14 18:56:02,208 INFO L158 Benchmark]: IcfgTransformer took 37.37ms. Allocated memory is still 154.1MB. Free memory was 119.0MB in the beginning and 117.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 18:56:02,208 INFO L158 Benchmark]: TraceAbstraction took 1340.42ms. Allocated memory was 154.1MB in the beginning and 188.7MB in the end (delta: 34.6MB). Free memory was 117.0MB in the beginning and 154.6MB in the end (delta: -37.6MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 18:56:02,209 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 154.1MB. Free memory was 120.3MB in the beginning and 120.2MB in the end (delta: 75.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 316.62ms. Allocated memory is still 154.1MB. Free memory was 103.8MB in the beginning and 130.6MB in the end (delta: -26.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.16ms. Allocated memory is still 154.1MB. Free memory was 130.6MB in the beginning and 129.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 279.48ms. Allocated memory is still 154.1MB. Free memory was 129.0MB in the beginning and 119.1MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 37.37ms. Allocated memory is still 154.1MB. Free memory was 119.0MB in the beginning and 117.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 1340.42ms. Allocated memory was 154.1MB in the beginning and 188.7MB in the end (delta: 34.6MB). Free memory was 117.0MB in the beginning and 154.6MB in the end (delta: -37.6MB). There was no memory consumed. 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: 1.2s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.1s 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.1s 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.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s 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-14 18:56:02,255 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...