/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/loop-invgen/id_build.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:16:30,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:16:30,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:16:30,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:16:30,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:16:30,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:16:30,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:16:30,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:16:30,117 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:16:30,118 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:16:30,118 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:16:30,119 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:16:30,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:16:30,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:16:30,120 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:16:30,121 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:16:30,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:16:30,122 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:16:30,123 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:16:30,124 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:16:30,124 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:16:30,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:16:30,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:16:30,126 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:16:30,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:16:30,128 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:16:30,128 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:16:30,128 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:16:30,129 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:16:30,129 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:16:30,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:16:30,130 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:16:30,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:16:30,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:16:30,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:16:30,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:16:30,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:16:30,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:16:30,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:16:30,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:16:30,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:16:30,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:16:30,134 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:16:30,143 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:16:30,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:16:30,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:16:30,144 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:16:30,144 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:16:30,144 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:16:30,144 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:16:30,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:16:30,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:16:30,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:16:30,145 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:16:30,145 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:16:30,145 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:16:30,146 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:16:30,146 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:16:30,146 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:16:30,146 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:16:30,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:16:30,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:16:30,146 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:16:30,146 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:16:30,147 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:16:30,147 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 16:16:30,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:16:30,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:16:30,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:16:30,313 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:16:30,314 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:16:30,314 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/id_build.i [2022-04-27 16:16:30,359 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57b4d5b82/7c1eb05431ea4f1c8d593a71e5b5bb89/FLAGd2f867981 [2022-04-27 16:16:30,721 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:16:30,722 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i [2022-04-27 16:16:30,729 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57b4d5b82/7c1eb05431ea4f1c8d593a71e5b5bb89/FLAGd2f867981 [2022-04-27 16:16:30,745 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57b4d5b82/7c1eb05431ea4f1c8d593a71e5b5bb89 [2022-04-27 16:16:30,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:16:30,749 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:16:30,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:16:30,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:16:30,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:16:30,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:16:30" (1/1) ... [2022-04-27 16:16:30,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4841fdc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:30, skipping insertion in model container [2022-04-27 16:16:30,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:16:30" (1/1) ... [2022-04-27 16:16:30,759 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:16:30,770 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:16:30,919 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i[893,906] [2022-04-27 16:16:30,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:16:30,948 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:16:30,959 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i[893,906] [2022-04-27 16:16:30,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:16:30,972 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:16:30,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:30 WrapperNode [2022-04-27 16:16:30,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:16:30,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:16:30,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:16:30,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:16:30,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:30" (1/1) ... [2022-04-27 16:16:30,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:30" (1/1) ... [2022-04-27 16:16:30,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:30" (1/1) ... [2022-04-27 16:16:30,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:30" (1/1) ... [2022-04-27 16:16:30,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:30" (1/1) ... [2022-04-27 16:16:31,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:30" (1/1) ... [2022-04-27 16:16:31,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:30" (1/1) ... [2022-04-27 16:16:31,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:16:31,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:16:31,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:16:31,009 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:16:31,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:30" (1/1) ... [2022-04-27 16:16:31,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:16:31,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:16:31,040 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 16:16:31,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 16:16:31,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:16:31,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:16:31,068 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:16:31,068 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:16:31,068 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:16:31,069 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:16:31,069 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:16:31,069 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:16:31,069 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 16:16:31,069 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 16:16:31,069 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:16:31,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:16:31,069 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:16:31,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:16:31,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:16:31,070 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:16:31,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:16:31,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:16:31,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:16:31,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:16:31,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:16:31,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:16:31,132 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:16:31,134 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:16:31,278 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:16:31,285 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:16:31,286 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 16:16:31,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:16:31 BoogieIcfgContainer [2022-04-27 16:16:31,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:16:31,287 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:16:31,287 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:16:31,289 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:16:31,290 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:16:31" (1/1) ... [2022-04-27 16:16:31,292 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:16:31,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:16:31 BasicIcfg [2022-04-27 16:16:31,320 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:16:31,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:16:31,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:16:31,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:16:31,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:16:30" (1/4) ... [2022-04-27 16:16:31,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755083e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:16:31, skipping insertion in model container [2022-04-27 16:16:31,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:30" (2/4) ... [2022-04-27 16:16:31,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755083e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:16:31, skipping insertion in model container [2022-04-27 16:16:31,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:16:31" (3/4) ... [2022-04-27 16:16:31,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755083e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:16:31, skipping insertion in model container [2022-04-27 16:16:31,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:16:31" (4/4) ... [2022-04-27 16:16:31,328 INFO L111 eAbstractionObserver]: Analyzing ICFG id_build.iJordan [2022-04-27 16:16:31,340 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:16:31,340 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:16:31,364 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:16:31,368 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56ef24c2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@21c411d [2022-04-27 16:16:31,368 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:16:31,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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-27 16:16:31,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 16:16:31,378 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:16:31,378 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:16:31,379 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:16:31,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:16:31,383 INFO L85 PathProgramCache]: Analyzing trace with hash -870026719, now seen corresponding path program 1 times [2022-04-27 16:16:31,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:16:31,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368465590] [2022-04-27 16:16:31,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:31,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:16:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:31,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:16:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:31,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {26#true} is VALID [2022-04-27 16:16:31,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 16:16:31,623 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 16:16:31,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:16:31,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {26#true} is VALID [2022-04-27 16:16:31,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 16:16:31,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 16:16:31,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 16:16:31,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} [73] mainENTRY-->L27-3: Formula: (and (= v_main_~i~0_5 0) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet1_2| v_main_~nlen~0_3) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~length~0=v_main_~length~0_1, main_~nlen~0=v_main_~nlen~0_3, main_~offset~0=v_main_~offset~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~length~0, main_#t~nondet1, main_~j~0, main_~i~0, main_~nlen~0, main_~offset~0] {26#true} is VALID [2022-04-27 16:16:31,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} [77] L27-3-->L28-2: Formula: (and (< v_main_~i~0_8 v_main_~nlen~0_5) (= v_main_~j~0_4 0)) InVars {main_~i~0=v_main_~i~0_8, main_~nlen~0=v_main_~nlen~0_5} OutVars{main_~i~0=v_main_~i~0_8, main_~nlen~0=v_main_~nlen~0_5, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {31#(< main_~i~0 main_~nlen~0)} is VALID [2022-04-27 16:16:31,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#(< main_~i~0 main_~nlen~0)} [81] L28-2-->L29: Formula: (< v_main_~j~0_6 8) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {31#(< main_~i~0 main_~nlen~0)} is VALID [2022-04-27 16:16:31,630 INFO L272 TraceCheckUtils]: 8: Hoare triple {31#(< main_~i~0 main_~nlen~0)} [84] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (<= (+ v_main_~i~0_9 1) v_main_~nlen~0_6) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9, main_~nlen~0=v_main_~nlen~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0, main_~nlen~0] {32#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:16:31,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#(not (= |__VERIFIER_assert_#in~cond| 0))} [86] __VERIFIER_assertENTRY-->L18: 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] {33#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:16:31,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {33#(not (= __VERIFIER_assert_~cond 0))} [88] L18-->L19: 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[] {27#false} is VALID [2022-04-27 16:16:31,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} [90] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-27 16:16:31,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:16:31,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:16:31,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368465590] [2022-04-27 16:16:31,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368465590] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:16:31,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:16:31,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:16:31,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159020657] [2022-04-27 16:16:31,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:16:31,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:16:31,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:16:31,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:16:31,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:16:31,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:16:31,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:16:31,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:16:31,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:16:31,675 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:16:31,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:31,929 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-04-27 16:16:31,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:16:31,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:16:31,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:16:31,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:16:31,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-27 16:16:31,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:16:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-27 16:16:31,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2022-04-27 16:16:31,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:16:31,979 INFO L225 Difference]: With dead ends: 27 [2022-04-27 16:16:31,979 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 16:16:31,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 16:16:31,982 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 24 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:16:31,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 41 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:16:31,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 16:16:32,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-27 16:16:32,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:16:32,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:16:32,002 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:16:32,002 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:16:32,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:32,004 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-27 16:16:32,004 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-27 16:16:32,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:32,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:32,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-27 16:16:32,005 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-27 16:16:32,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:32,007 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-27 16:16:32,007 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-27 16:16:32,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:32,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:32,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:16:32,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:16:32,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:16:32,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-27 16:16:32,010 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 12 [2022-04-27 16:16:32,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:16:32,010 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-27 16:16:32,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:16:32,010 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-27 16:16:32,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 16:16:32,011 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:16:32,011 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:16:32,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:16:32,011 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:16:32,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:16:32,012 INFO L85 PathProgramCache]: Analyzing trace with hash 685068608, now seen corresponding path program 1 times [2022-04-27 16:16:32,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:16:32,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618678934] [2022-04-27 16:16:32,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:32,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:16:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:32,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:16:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:32,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {150#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {138#true} is VALID [2022-04-27 16:16:32,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {138#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-27 16:16:32,088 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {138#true} {138#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-27 16:16:32,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-27 16:16:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:32,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {138#true} [86] __VERIFIER_assertENTRY-->L18: 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] {138#true} is VALID [2022-04-27 16:16:32,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {138#true} [89] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-27 16:16:32,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {138#true} [92] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-27 16:16:32,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138#true} {143#(< 0 (+ main_~i~0 1))} [95] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (+ v_main_~i~0_9 1) v_main_~nlen~0_6) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9, main_~nlen~0=v_main_~nlen~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0, main_~nlen~0] {143#(< 0 (+ main_~i~0 1))} is VALID [2022-04-27 16:16:32,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {138#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {150#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:16:32,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {138#true} is VALID [2022-04-27 16:16:32,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {138#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-27 16:16:32,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138#true} {138#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-27 16:16:32,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {138#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-27 16:16:32,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {138#true} [73] mainENTRY-->L27-3: Formula: (and (= v_main_~i~0_5 0) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet1_2| v_main_~nlen~0_3) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~length~0=v_main_~length~0_1, main_~nlen~0=v_main_~nlen~0_3, main_~offset~0=v_main_~offset~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~length~0, main_#t~nondet1, main_~j~0, main_~i~0, main_~nlen~0, main_~offset~0] {143#(< 0 (+ main_~i~0 1))} is VALID [2022-04-27 16:16:32,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {143#(< 0 (+ main_~i~0 1))} [77] L27-3-->L28-2: Formula: (and (< v_main_~i~0_8 v_main_~nlen~0_5) (= v_main_~j~0_4 0)) InVars {main_~i~0=v_main_~i~0_8, main_~nlen~0=v_main_~nlen~0_5} OutVars{main_~i~0=v_main_~i~0_8, main_~nlen~0=v_main_~nlen~0_5, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {143#(< 0 (+ main_~i~0 1))} is VALID [2022-04-27 16:16:32,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {143#(< 0 (+ main_~i~0 1))} [81] L28-2-->L29: Formula: (< v_main_~j~0_6 8) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {143#(< 0 (+ main_~i~0 1))} is VALID [2022-04-27 16:16:32,101 INFO L272 TraceCheckUtils]: 8: Hoare triple {143#(< 0 (+ main_~i~0 1))} [84] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (<= (+ v_main_~i~0_9 1) v_main_~nlen~0_6) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9, main_~nlen~0=v_main_~nlen~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0, main_~nlen~0] {138#true} is VALID [2022-04-27 16:16:32,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {138#true} [86] __VERIFIER_assertENTRY-->L18: 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] {138#true} is VALID [2022-04-27 16:16:32,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {138#true} [89] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-27 16:16:32,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {138#true} [92] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-27 16:16:32,102 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {138#true} {143#(< 0 (+ main_~i~0 1))} [95] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (+ v_main_~i~0_9 1) v_main_~nlen~0_6) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9, main_~nlen~0=v_main_~nlen~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0, main_~nlen~0] {143#(< 0 (+ main_~i~0 1))} is VALID [2022-04-27 16:16:32,103 INFO L272 TraceCheckUtils]: 13: Hoare triple {143#(< 0 (+ main_~i~0 1))} [85] L29-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< 0 (+ v_main_~i~0_10 1)) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~nlen~0=v_main_~nlen~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0, main_~nlen~0] {148#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:16:32,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {148#(not (= |__VERIFIER_assert_#in~cond| 0))} [86] __VERIFIER_assertENTRY-->L18: 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] {149#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:16:32,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {149#(not (= __VERIFIER_assert_~cond 0))} [88] L18-->L19: 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[] {139#false} is VALID [2022-04-27 16:16:32,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {139#false} [90] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {139#false} is VALID [2022-04-27 16:16:32,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:16:32,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:16:32,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618678934] [2022-04-27 16:16:32,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618678934] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:16:32,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:16:32,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:16:32,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448225957] [2022-04-27 16:16:32,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:16:32,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-27 16:16:32,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:16:32,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:16:32,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:16:32,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:16:32,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:16:32,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:16:32,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:16:32,130 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:16:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:32,290 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-27 16:16:32,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:16:32,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-27 16:16:32,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:16:32,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:16:32,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2022-04-27 16:16:32,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:16:32,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2022-04-27 16:16:32,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 22 transitions. [2022-04-27 16:16:32,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:16:32,321 INFO L225 Difference]: With dead ends: 20 [2022-04-27 16:16:32,321 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:16:32,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 16:16:32,324 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:16:32,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 32 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:16:32,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:16:32,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:16:32,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:16:32,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:16:32,328 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:16:32,328 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:16:32,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:32,329 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:16:32,329 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:16:32,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:32,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:32,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:16:32,329 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:16:32,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:32,330 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:16:32,330 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:16:32,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:32,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:32,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:16:32,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:16:32,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:16:32,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:16:32,332 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-04-27 16:16:32,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:16:32,332 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:16:32,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:16:32,332 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:16:32,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:32,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:16:32,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:16:32,339 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-27 16:16:32,340 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:16:32,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:16:32 BasicIcfg [2022-04-27 16:16:32,342 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:16:32,343 INFO L158 Benchmark]: Toolchain (without parser) took 1594.49ms. Allocated memory is still 217.1MB. Free memory was 168.3MB in the beginning and 110.9MB in the end (delta: 57.3MB). Peak memory consumption was 58.2MB. Max. memory is 8.0GB. [2022-04-27 16:16:32,343 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 217.1MB. Free memory was 184.9MB in the beginning and 184.8MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:16:32,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.56ms. Allocated memory is still 217.1MB. Free memory was 168.0MB in the beginning and 194.3MB in the end (delta: -26.3MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-04-27 16:16:32,344 INFO L158 Benchmark]: Boogie Preprocessor took 34.21ms. Allocated memory is still 217.1MB. Free memory was 194.3MB in the beginning and 192.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:16:32,344 INFO L158 Benchmark]: RCFGBuilder took 278.17ms. Allocated memory is still 217.1MB. Free memory was 192.7MB in the beginning and 181.7MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 16:16:32,344 INFO L158 Benchmark]: IcfgTransformer took 33.18ms. Allocated memory is still 217.1MB. Free memory was 181.7MB in the beginning and 180.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:16:32,345 INFO L158 Benchmark]: TraceAbstraction took 1020.31ms. Allocated memory is still 217.1MB. Free memory was 179.6MB in the beginning and 110.9MB in the end (delta: 68.7MB). Peak memory consumption was 69.2MB. Max. memory is 8.0GB. [2022-04-27 16:16:32,346 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 217.1MB. Free memory was 184.9MB in the beginning and 184.8MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.56ms. Allocated memory is still 217.1MB. Free memory was 168.0MB in the beginning and 194.3MB in the end (delta: -26.3MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.21ms. Allocated memory is still 217.1MB. Free memory was 194.3MB in the beginning and 192.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 278.17ms. Allocated memory is still 217.1MB. Free memory was 192.7MB in the beginning and 181.7MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 33.18ms. Allocated memory is still 217.1MB. Free memory was 181.7MB in the beginning and 180.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 1020.31ms. Allocated memory is still 217.1MB. Free memory was 179.6MB in the beginning and 110.9MB in the end (delta: 68.7MB). Peak memory consumption was 69.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: 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, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 93 IncrementalHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 35 mSDtfsCounter, 93 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 71 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 16:16:32,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...