/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-simple/nested_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 17:03:08,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 17:03:08,258 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 17:03:08,283 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 17:03:08,283 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 17:03:08,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 17:03:08,285 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 17:03:08,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 17:03:08,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 17:03:08,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 17:03:08,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 17:03:08,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 17:03:08,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 17:03:08,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 17:03:08,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 17:03:08,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 17:03:08,308 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 17:03:08,309 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 17:03:08,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 17:03:08,316 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 17:03:08,317 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 17:03:08,318 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 17:03:08,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 17:03:08,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 17:03:08,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 17:03:08,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 17:03:08,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 17:03:08,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 17:03:08,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 17:03:08,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 17:03:08,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 17:03:08,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 17:03:08,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 17:03:08,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 17:03:08,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 17:03:08,324 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 17:03:08,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 17:03:08,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 17:03:08,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 17:03:08,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 17:03:08,326 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 17:03:08,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 17:03:08,327 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 17:03:08,333 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 17:03:08,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 17:03:08,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 17:03:08,334 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 17:03:08,334 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 17:03:08,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 17:03:08,334 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 17:03:08,335 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 17:03:08,335 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 17:03:08,335 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 17:03:08,335 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 17:03:08,335 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 17:03:08,335 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 17:03:08,335 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 17:03:08,336 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 17:03:08,336 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 17:03:08,336 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 17:03:08,336 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 17:03:08,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:03:08,336 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 17:03:08,336 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 17:03:08,337 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 17:03:08,337 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 17:03:08,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 17:03:08,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 17:03:08,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 17:03:08,531 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 17:03:08,531 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 17:03:08,532 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_1.c [2022-04-27 17:03:08,580 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0218f2db/c3863d4bdd5d46cb835c5ff56c002425/FLAG2928d9b5e [2022-04-27 17:03:08,965 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 17:03:08,965 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_1.c [2022-04-27 17:03:08,972 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0218f2db/c3863d4bdd5d46cb835c5ff56c002425/FLAG2928d9b5e [2022-04-27 17:03:08,982 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0218f2db/c3863d4bdd5d46cb835c5ff56c002425 [2022-04-27 17:03:08,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 17:03:08,984 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 17:03:08,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 17:03:08,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 17:03:08,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 17:03:08,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:03:08" (1/1) ... [2022-04-27 17:03:08,989 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ca1abce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:03:08, skipping insertion in model container [2022-04-27 17:03:08,989 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:03:08" (1/1) ... [2022-04-27 17:03:08,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 17:03:09,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 17:03:09,132 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-simple/nested_1.c[676,689] [2022-04-27 17:03:09,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:03:09,150 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 17:03:09,160 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-simple/nested_1.c[676,689] [2022-04-27 17:03:09,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:03:09,170 INFO L208 MainTranslator]: Completed translation [2022-04-27 17:03:09,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:03:09 WrapperNode [2022-04-27 17:03:09,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 17:03:09,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 17:03:09,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 17:03:09,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 17:03:09,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:03:09" (1/1) ... [2022-04-27 17:03:09,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:03:09" (1/1) ... [2022-04-27 17:03:09,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:03:09" (1/1) ... [2022-04-27 17:03:09,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:03:09" (1/1) ... [2022-04-27 17:03:09,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:03:09" (1/1) ... [2022-04-27 17:03:09,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:03:09" (1/1) ... [2022-04-27 17:03:09,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:03:09" (1/1) ... [2022-04-27 17:03:09,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 17:03:09,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 17:03:09,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 17:03:09,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 17:03:09,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:03:09" (1/1) ... [2022-04-27 17:03:09,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:03:09,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:03:09,249 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 17:03:09,318 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 17:03:09,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 17:03:09,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 17:03:09,332 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 17:03:09,332 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 17:03:09,332 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 17:03:09,332 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 17:03:09,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 17:03:09,333 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 17:03:09,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 17:03:09,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 17:03:09,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 17:03:09,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 17:03:09,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 17:03:09,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 17:03:09,377 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 17:03:09,380 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 17:03:09,487 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 17:03:09,493 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 17:03:09,494 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 17:03:09,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:03:09 BoogieIcfgContainer [2022-04-27 17:03:09,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 17:03:09,495 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 17:03:09,496 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 17:03:09,512 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 17:03:09,514 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:03:09" (1/1) ... [2022-04-27 17:03:09,515 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 17:03:09,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:03:09 BasicIcfg [2022-04-27 17:03:09,539 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 17:03:09,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 17:03:09,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 17:03:09,542 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 17:03:09,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 05:03:08" (1/4) ... [2022-04-27 17:03:09,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13662693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:03:09, skipping insertion in model container [2022-04-27 17:03:09,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:03:09" (2/4) ... [2022-04-27 17:03:09,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13662693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:03:09, skipping insertion in model container [2022-04-27 17:03:09,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:03:09" (3/4) ... [2022-04-27 17:03:09,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13662693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 05:03:09, skipping insertion in model container [2022-04-27 17:03:09,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:03:09" (4/4) ... [2022-04-27 17:03:09,544 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_1.cJordan [2022-04-27 17:03:09,567 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 17:03:09,568 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 17:03:09,649 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 17:03:09,658 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@6bd2e97c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7fb4a3ca [2022-04-27 17:03:09,658 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 17:03:09,670 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 17:03:09,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-27 17:03:09,674 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:03:09,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:03:09,675 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:03:09,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:03:09,679 INFO L85 PathProgramCache]: Analyzing trace with hash -633459621, now seen corresponding path program 1 times [2022-04-27 17:03:09,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:03:09,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886062571] [2022-04-27 17:03:09,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:03:09,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:03:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:09,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:03:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:09,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [37] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {19#true} is VALID [2022-04-27 17:03:09,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} [40] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19#true} is VALID [2022-04-27 17:03:09,812 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19#true} {19#true} [51] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19#true} is VALID [2022-04-27 17:03:09,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {19#true} [35] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:03:09,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [37] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {19#true} is VALID [2022-04-27 17:03:09,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#true} [40] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19#true} is VALID [2022-04-27 17:03:09,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19#true} {19#true} [51] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19#true} is VALID [2022-04-27 17:03:09,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {19#true} [36] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19#true} is VALID [2022-04-27 17:03:09,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {19#true} [39] mainENTRY-->L19-3: Formula: (= v_main_~a~0_3 0) InVars {} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~a~0] {19#true} is VALID [2022-04-27 17:03:09,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {19#true} [41] L19-3-->L19-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {20#false} is VALID [2022-04-27 17:03:09,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {20#false} [44] L19-4-->L23: Formula: (not (= v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {20#false} is VALID [2022-04-27 17:03:09,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {20#false} [47] L23-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20#false} is VALID [2022-04-27 17:03:09,820 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 17:03:09,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:03:09,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886062571] [2022-04-27 17:03:09,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886062571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:03:09,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:03:09,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 17:03:09,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737742099] [2022-04-27 17:03:09,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:03:09,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-27 17:03:09,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:03:09,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:09,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:03:09,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 17:03:09,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:03:09,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 17:03:09,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 17:03:09,863 INFO L87 Difference]: Start difference. First operand has 16 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:09,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:09,906 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 17:03:09,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 17:03:09,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-27 17:03:09,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:03:09,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-04-27 17:03:09,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:09,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-04-27 17:03:09,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 18 transitions. [2022-04-27 17:03:09,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:03:09,944 INFO L225 Difference]: With dead ends: 16 [2022-04-27 17:03:09,944 INFO L226 Difference]: Without dead ends: 11 [2022-04-27 17:03:09,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 17:03:09,948 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 17:03:09,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 19 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 17:03:09,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-04-27 17:03:09,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-04-27 17:03:09,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:03:09,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:09,968 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:09,968 INFO L87 Difference]: Start difference. First operand 11 states. Second operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:09,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:09,972 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-04-27 17:03:09,972 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-04-27 17:03:09,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:03:09,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:03:09,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11 states. [2022-04-27 17:03:09,973 INFO L87 Difference]: Start difference. First operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11 states. [2022-04-27 17:03:09,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:09,977 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-04-27 17:03:09,977 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-04-27 17:03:09,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:03:09,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:03:09,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:03:09,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:03:09,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:09,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-04-27 17:03:09,981 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2022-04-27 17:03:09,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:03:09,982 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-04-27 17:03:09,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-04-27 17:03:09,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-27 17:03:09,982 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:03:09,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:03:09,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 17:03:09,983 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:03:09,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:03:09,984 INFO L85 PathProgramCache]: Analyzing trace with hash -633458660, now seen corresponding path program 1 times [2022-04-27 17:03:09,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:03:09,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776920899] [2022-04-27 17:03:09,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:03:09,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:03:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:10,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:03:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:10,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {82#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [37] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {76#true} is VALID [2022-04-27 17:03:10,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {76#true} [40] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {76#true} is VALID [2022-04-27 17:03:10,068 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76#true} {76#true} [51] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {76#true} is VALID [2022-04-27 17:03:10,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {76#true} [35] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {82#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:03:10,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {82#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [37] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {76#true} is VALID [2022-04-27 17:03:10,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {76#true} [40] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {76#true} is VALID [2022-04-27 17:03:10,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76#true} {76#true} [51] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {76#true} is VALID [2022-04-27 17:03:10,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {76#true} [36] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {76#true} is VALID [2022-04-27 17:03:10,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {76#true} [39] mainENTRY-->L19-3: Formula: (= v_main_~a~0_3 0) InVars {} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~a~0] {81#(= main_~a~0 0)} is VALID [2022-04-27 17:03:10,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {81#(= main_~a~0 0)} [42] L19-3-->L19-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {77#false} is VALID [2022-04-27 17:03:10,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {77#false} [44] L19-4-->L23: Formula: (not (= v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {77#false} is VALID [2022-04-27 17:03:10,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {77#false} [47] L23-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {77#false} is VALID [2022-04-27 17:03:10,072 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 17:03:10,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:03:10,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776920899] [2022-04-27 17:03:10,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776920899] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:03:10,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:03:10,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 17:03:10,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492347652] [2022-04-27 17:03:10,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:03:10,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-27 17:03:10,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:03:10,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:10,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:03:10,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 17:03:10,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:03:10,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 17:03:10,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 17:03:10,103 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:10,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:10,153 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 17:03:10,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 17:03:10,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-27 17:03:10,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:03:10,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-04-27 17:03:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:10,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-04-27 17:03:10,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 14 transitions. [2022-04-27 17:03:10,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:03:10,225 INFO L225 Difference]: With dead ends: 13 [2022-04-27 17:03:10,225 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 17:03:10,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 17:03:10,226 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 17:03:10,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 16 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 17:03:10,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 17:03:10,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-04-27 17:03:10,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:03:10,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:10,229 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:10,229 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:10,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:10,230 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 17:03:10,230 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 17:03:10,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:03:10,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:03:10,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 17:03:10,231 INFO L87 Difference]: Start difference. First operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 17:03:10,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:10,232 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 17:03:10,232 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 17:03:10,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:03:10,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:03:10,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:03:10,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:03:10,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:10,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-27 17:03:10,233 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2022-04-27 17:03:10,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:03:10,233 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-27 17:03:10,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:10,233 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 17:03:10,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 17:03:10,234 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:03:10,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:03:10,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 17:03:10,234 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:03:10,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:03:10,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1132563481, now seen corresponding path program 1 times [2022-04-27 17:03:10,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:03:10,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333049213] [2022-04-27 17:03:10,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:03:10,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:03:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:10,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:03:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:10,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {145#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [37] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {138#true} is VALID [2022-04-27 17:03:10,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {138#true} [40] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-27 17:03:10,285 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {138#true} {138#true} [51] 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 17:03:10,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {138#true} [35] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {145#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:03:10,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {145#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [37] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {138#true} is VALID [2022-04-27 17:03:10,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {138#true} [40] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-27 17:03:10,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138#true} {138#true} [51] 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 17:03:10,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {138#true} [36] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-27 17:03:10,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {138#true} [39] mainENTRY-->L19-3: Formula: (= v_main_~a~0_3 0) InVars {} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~a~0] {143#(= main_~a~0 0)} is VALID [2022-04-27 17:03:10,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {143#(= main_~a~0 0)} [43] L19-3-->L19-2: Formula: (< v_main_~a~0_8 6) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[] {143#(= main_~a~0 0)} is VALID [2022-04-27 17:03:10,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {143#(= main_~a~0 0)} [46] L19-2-->L19-3: Formula: (= (+ v_main_~a~0_2 1) v_main_~a~0_1) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {144#(<= main_~a~0 1)} is VALID [2022-04-27 17:03:10,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {144#(<= main_~a~0 1)} [42] L19-3-->L19-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {139#false} is VALID [2022-04-27 17:03:10,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {139#false} [44] L19-4-->L23: Formula: (not (= v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {139#false} is VALID [2022-04-27 17:03:10,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {139#false} [47] L23-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {139#false} is VALID [2022-04-27 17:03:10,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 17:03:10,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:03:10,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333049213] [2022-04-27 17:03:10,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333049213] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 17:03:10,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695070248] [2022-04-27 17:03:10,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:03:10,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:03:10,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:03:10,294 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 17:03:10,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 17:03:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:10,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 17:03:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:10,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:03:10,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {138#true} [35] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-27 17:03:10,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {138#true} [37] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {138#true} is VALID [2022-04-27 17:03:10,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {138#true} [40] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-27 17:03:10,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138#true} {138#true} [51] 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 17:03:10,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {138#true} [36] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-27 17:03:10,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {138#true} [39] mainENTRY-->L19-3: Formula: (= v_main_~a~0_3 0) InVars {} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~a~0] {164#(<= main_~a~0 0)} is VALID [2022-04-27 17:03:10,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {164#(<= main_~a~0 0)} [43] L19-3-->L19-2: Formula: (< v_main_~a~0_8 6) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[] {164#(<= main_~a~0 0)} is VALID [2022-04-27 17:03:10,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {164#(<= main_~a~0 0)} [46] L19-2-->L19-3: Formula: (= (+ v_main_~a~0_2 1) v_main_~a~0_1) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {144#(<= main_~a~0 1)} is VALID [2022-04-27 17:03:10,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {144#(<= main_~a~0 1)} [42] L19-3-->L19-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {139#false} is VALID [2022-04-27 17:03:10,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {139#false} [44] L19-4-->L23: Formula: (not (= v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {139#false} is VALID [2022-04-27 17:03:10,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {139#false} [47] L23-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {139#false} is VALID [2022-04-27 17:03:10,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 17:03:10,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 17:03:10,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {139#false} [47] L23-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {139#false} is VALID [2022-04-27 17:03:10,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {139#false} [44] L19-4-->L23: Formula: (not (= v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {139#false} is VALID [2022-04-27 17:03:10,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#(< main_~a~0 6)} [42] L19-3-->L19-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {139#false} is VALID [2022-04-27 17:03:10,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {190#(< main_~a~0 5)} [46] L19-2-->L19-3: Formula: (= (+ v_main_~a~0_2 1) v_main_~a~0_1) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {186#(< main_~a~0 6)} is VALID [2022-04-27 17:03:10,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {190#(< main_~a~0 5)} [43] L19-3-->L19-2: Formula: (< v_main_~a~0_8 6) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[] {190#(< main_~a~0 5)} is VALID [2022-04-27 17:03:10,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {138#true} [39] mainENTRY-->L19-3: Formula: (= v_main_~a~0_3 0) InVars {} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~a~0] {190#(< main_~a~0 5)} is VALID [2022-04-27 17:03:10,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {138#true} [36] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-27 17:03:10,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138#true} {138#true} [51] 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 17:03:10,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {138#true} [40] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-27 17:03:10,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {138#true} [37] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {138#true} is VALID [2022-04-27 17:03:10,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {138#true} [35] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-27 17:03:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 17:03:10,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695070248] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 17:03:10,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 17:03:10,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 17:03:10,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115029827] [2022-04-27 17:03:10,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 17:03:10,484 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 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 11 [2022-04-27 17:03:10,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:03:10,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 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 17:03:10,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:03:10,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 17:03:10,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:03:10,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 17:03:10,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 17:03:10,498 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 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 17:03:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:10,583 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 17:03:10,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 17:03:10,584 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 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 11 [2022-04-27 17:03:10,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:03:10,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 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 17:03:10,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-27 17:03:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 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 17:03:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-27 17:03:10,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-04-27 17:03:10,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:03:10,603 INFO L225 Difference]: With dead ends: 18 [2022-04-27 17:03:10,603 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 17:03:10,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-04-27 17:03:10,604 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 15 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 17:03:10,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 31 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 17:03:10,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 17:03:10,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-27 17:03:10,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:03:10,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:10,606 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:10,606 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:10,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:10,607 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 17:03:10,607 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-27 17:03:10,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:03:10,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:03:10,608 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 17:03:10,608 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 17:03:10,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:10,609 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 17:03:10,609 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-27 17:03:10,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:03:10,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:03:10,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:03:10,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:03:10,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-27 17:03:10,610 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 11 [2022-04-27 17:03:10,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:03:10,610 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-27 17:03:10,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 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 17:03:10,610 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-27 17:03:10,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 17:03:10,611 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:03:10,611 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:03:10,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 17:03:10,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:03:10,828 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:03:10,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:03:10,828 INFO L85 PathProgramCache]: Analyzing trace with hash -754672496, now seen corresponding path program 2 times [2022-04-27 17:03:10,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:03:10,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139351866] [2022-04-27 17:03:10,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:03:10,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:03:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:10,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:03:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:10,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {302#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [37] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {294#true} is VALID [2022-04-27 17:03:10,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#true} [40] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {294#true} is VALID [2022-04-27 17:03:10,887 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {294#true} {294#true} [51] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {294#true} is VALID [2022-04-27 17:03:10,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {294#true} [35] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {302#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:03:10,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {302#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [37] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {294#true} is VALID [2022-04-27 17:03:10,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} [40] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {294#true} is VALID [2022-04-27 17:03:10,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#true} {294#true} [51] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {294#true} is VALID [2022-04-27 17:03:10,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#true} [36] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {294#true} is VALID [2022-04-27 17:03:10,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#true} [39] mainENTRY-->L19-3: Formula: (= v_main_~a~0_3 0) InVars {} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~a~0] {294#true} is VALID [2022-04-27 17:03:10,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {294#true} [43] L19-3-->L19-2: Formula: (< v_main_~a~0_8 6) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[] {294#true} is VALID [2022-04-27 17:03:10,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#true} [46] L19-2-->L19-3: Formula: (= (+ v_main_~a~0_2 1) v_main_~a~0_1) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {294#true} is VALID [2022-04-27 17:03:10,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {294#true} [43] L19-3-->L19-2: Formula: (< v_main_~a~0_8 6) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[] {294#true} is VALID [2022-04-27 17:03:10,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#true} [46] L19-2-->L19-3: Formula: (= (+ v_main_~a~0_2 1) v_main_~a~0_1) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {294#true} is VALID [2022-04-27 17:03:10,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {294#true} [43] L19-3-->L19-2: Formula: (< v_main_~a~0_8 6) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[] {294#true} is VALID [2022-04-27 17:03:10,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {294#true} [46] L19-2-->L19-3: Formula: (= (+ v_main_~a~0_2 1) v_main_~a~0_1) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {294#true} is VALID [2022-04-27 17:03:10,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {294#true} [43] L19-3-->L19-2: Formula: (< v_main_~a~0_8 6) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[] {299#(<= main_~a~0 5)} is VALID [2022-04-27 17:03:10,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {299#(<= main_~a~0 5)} [46] L19-2-->L19-3: Formula: (= (+ v_main_~a~0_2 1) v_main_~a~0_1) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {300#(<= main_~a~0 6)} is VALID [2022-04-27 17:03:10,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {300#(<= main_~a~0 6)} [42] L19-3-->L19-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {301#(and (<= main_~a~0 6) (< 5 main_~a~0))} is VALID [2022-04-27 17:03:10,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {301#(and (<= main_~a~0 6) (< 5 main_~a~0))} [44] L19-4-->L23: Formula: (not (= v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {295#false} is VALID [2022-04-27 17:03:10,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {295#false} [47] L23-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {295#false} is VALID [2022-04-27 17:03:10,892 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 17:03:10,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:03:10,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139351866] [2022-04-27 17:03:10,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139351866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:03:10,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:03:10,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 17:03:10,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428121164] [2022-04-27 17:03:10,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:03:10,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 17:03:10,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:03:10,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:10,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:03:10,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 17:03:10,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:03:10,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 17:03:10,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 17:03:10,906 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:10,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:10,971 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 17:03:10,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 17:03:10,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 17:03:10,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:03:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2022-04-27 17:03:10,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:10,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2022-04-27 17:03:10,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 11 transitions. [2022-04-27 17:03:10,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:03:10,982 INFO L225 Difference]: With dead ends: 16 [2022-04-27 17:03:10,982 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 17:03:10,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-27 17:03:10,983 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 7 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 17:03:10,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 23 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 17:03:10,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 17:03:10,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 17:03:10,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:03:10,984 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 17:03:10,984 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 17:03:10,985 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 17:03:10,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:10,985 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 17:03:10,985 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 17:03:10,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:03:10,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:03:10,985 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 17:03:10,985 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 17:03:10,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:10,985 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 17:03:10,985 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 17:03:10,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:03:10,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:03:10,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:03:10,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:03:10,986 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 17:03:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 17:03:10,986 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-04-27 17:03:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:03:10,986 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 17:03:10,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:03:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 17:03:10,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:03:10,988 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 17:03:10,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 17:03:10,990 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-27 17:03:10,992 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 17:03:10,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 05:03:10 BasicIcfg [2022-04-27 17:03:10,993 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 17:03:10,994 INFO L158 Benchmark]: Toolchain (without parser) took 2009.82ms. Allocated memory was 188.7MB in the beginning and 238.0MB in the end (delta: 49.3MB). Free memory was 137.4MB in the beginning and 163.5MB in the end (delta: -26.0MB). Peak memory consumption was 23.2MB. Max. memory is 8.0GB. [2022-04-27 17:03:10,994 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 188.7MB. Free memory is still 153.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 17:03:10,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.22ms. Allocated memory is still 188.7MB. Free memory was 137.2MB in the beginning and 163.5MB in the end (delta: -26.2MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-04-27 17:03:10,995 INFO L158 Benchmark]: Boogie Preprocessor took 22.93ms. Allocated memory is still 188.7MB. Free memory was 163.5MB in the beginning and 161.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 17:03:10,995 INFO L158 Benchmark]: RCFGBuilder took 300.16ms. Allocated memory is still 188.7MB. Free memory was 161.9MB in the beginning and 152.5MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-27 17:03:10,995 INFO L158 Benchmark]: IcfgTransformer took 43.96ms. Allocated memory is still 188.7MB. Free memory was 152.5MB in the beginning and 151.4MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 17:03:10,995 INFO L158 Benchmark]: TraceAbstraction took 1452.98ms. Allocated memory was 188.7MB in the beginning and 238.0MB in the end (delta: 49.3MB). Free memory was 150.7MB in the beginning and 163.5MB in the end (delta: -12.8MB). Peak memory consumption was 36.5MB. Max. memory is 8.0GB. [2022-04-27 17:03:10,996 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 188.7MB. Free memory is still 153.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 185.22ms. Allocated memory is still 188.7MB. Free memory was 137.2MB in the beginning and 163.5MB in the end (delta: -26.2MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.93ms. Allocated memory is still 188.7MB. Free memory was 163.5MB in the beginning and 161.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 300.16ms. Allocated memory is still 188.7MB. Free memory was 161.9MB in the beginning and 152.5MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 43.96ms. Allocated memory is still 188.7MB. Free memory was 152.5MB in the beginning and 151.4MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1452.98ms. Allocated memory was 188.7MB in the beginning and 238.0MB in the end (delta: 49.3MB). Free memory was 150.7MB in the beginning and 163.5MB in the end (delta: -12.8MB). Peak memory consumption was 36.5MB. 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: 23]: 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 3 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43 IncrementalHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 40 mSDtfsCounter, 43 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=3, InterpolantAutomatonStates: 20, 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, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 62 ConstructedInterpolants, 0 QuantifiedInterpolants, 116 SizeOfPredicates, 0 NumberOfNonLiveVariables, 47 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 16/19 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 17:03:11,040 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...