/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_2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 17:03:19,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 17:03:19,953 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 17:03:19,991 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 17:03:19,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 17:03:19,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 17:03:19,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 17:03:19,996 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 17:03:19,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 17:03:20,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 17:03:20,000 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 17:03:20,001 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 17:03:20,001 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 17:03:20,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 17:03:20,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 17:03:20,006 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 17:03:20,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 17:03:20,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 17:03:20,009 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 17:03:20,012 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 17:03:20,013 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 17:03:20,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 17:03:20,015 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 17:03:20,015 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 17:03:20,016 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 17:03:20,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 17:03:20,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 17:03:20,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 17:03:20,022 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 17:03:20,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 17:03:20,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 17:03:20,023 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 17:03:20,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 17:03:20,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 17:03:20,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 17:03:20,025 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 17:03:20,025 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 17:03:20,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 17:03:20,026 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 17:03:20,026 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 17:03:20,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 17:03:20,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 17:03:20,028 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:20,037 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 17:03:20,037 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 17:03:20,038 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 17:03:20,038 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 17:03:20,038 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 17:03:20,038 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 17:03:20,039 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 17:03:20,039 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 17:03:20,039 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 17:03:20,039 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 17:03:20,039 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 17:03:20,039 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 17:03:20,040 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 17:03:20,040 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 17:03:20,040 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 17:03:20,040 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 17:03:20,040 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 17:03:20,040 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 17:03:20,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:03:20,040 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 17:03:20,040 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 17:03:20,041 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 17:03:20,041 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:20,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 17:03:20,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 17:03:20,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 17:03:20,229 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 17:03:20,231 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 17:03:20,232 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_2.c [2022-04-27 17:03:20,274 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e0c095de/eed774f3708445089056993f330e8ae2/FLAG725773ad6 [2022-04-27 17:03:20,629 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 17:03:20,630 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_2.c [2022-04-27 17:03:20,634 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e0c095de/eed774f3708445089056993f330e8ae2/FLAG725773ad6 [2022-04-27 17:03:20,642 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e0c095de/eed774f3708445089056993f330e8ae2 [2022-04-27 17:03:20,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 17:03:20,646 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 17:03:20,648 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 17:03:20,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 17:03:20,652 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 17:03:20,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:03:20" (1/1) ... [2022-04-27 17:03:20,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2caa6ec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:03:20, skipping insertion in model container [2022-04-27 17:03:20,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:03:20" (1/1) ... [2022-04-27 17:03:20,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 17:03:20,667 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 17:03:20,815 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_2.c[730,743] [2022-04-27 17:03:20,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:03:20,837 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 17:03:20,845 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_2.c[730,743] [2022-04-27 17:03:20,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:03:20,857 INFO L208 MainTranslator]: Completed translation [2022-04-27 17:03:20,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:03:20 WrapperNode [2022-04-27 17:03:20,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 17:03:20,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 17:03:20,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 17:03:20,859 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 17:03:20,866 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:20" (1/1) ... [2022-04-27 17:03:20,866 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:20" (1/1) ... [2022-04-27 17:03:20,870 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:20" (1/1) ... [2022-04-27 17:03:20,871 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:20" (1/1) ... [2022-04-27 17:03:20,876 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:20" (1/1) ... [2022-04-27 17:03:20,879 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:20" (1/1) ... [2022-04-27 17:03:20,884 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:20" (1/1) ... [2022-04-27 17:03:20,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 17:03:20,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 17:03:20,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 17:03:20,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 17:03:20,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:03:20" (1/1) ... [2022-04-27 17:03:20,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:03:20,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:03:20,912 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:20,964 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:20,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 17:03:20,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 17:03:20,982 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 17:03:20,982 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 17:03:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 17:03:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 17:03:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 17:03:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 17:03:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 17:03:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 17:03:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 17:03:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 17:03:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 17:03:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 17:03:21,027 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 17:03:21,028 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 17:03:21,142 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 17:03:21,148 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 17:03:21,148 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 17:03:21,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:03:21 BoogieIcfgContainer [2022-04-27 17:03:21,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 17:03:21,150 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 17:03:21,150 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 17:03:21,151 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 17:03:21,160 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:03:21" (1/1) ... [2022-04-27 17:03:21,166 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 17:03:21,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:03:21 BasicIcfg [2022-04-27 17:03:21,185 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 17:03:21,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 17:03:21,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 17:03:21,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 17:03:21,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 05:03:20" (1/4) ... [2022-04-27 17:03:21,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c122ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:03:21, skipping insertion in model container [2022-04-27 17:03:21,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:03:20" (2/4) ... [2022-04-27 17:03:21,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c122ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:03:21, skipping insertion in model container [2022-04-27 17:03:21,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:03:21" (3/4) ... [2022-04-27 17:03:21,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c122ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 05:03:21, skipping insertion in model container [2022-04-27 17:03:21,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:03:21" (4/4) ... [2022-04-27 17:03:21,204 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_2.cJordan [2022-04-27 17:03:21,221 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 17:03:21,221 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 17:03:21,261 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 17:03:21,267 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@2d88f44a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@69f8b8d5 [2022-04-27 17:03:21,268 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 17:03:21,276 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 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:21,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-27 17:03:21,280 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:03:21,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:03:21,281 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:03:21,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:03:21,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1120438501, now seen corresponding path program 1 times [2022-04-27 17:03:21,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:03:21,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783374071] [2022-04-27 17:03:21,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:03:21,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:03:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:21,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:03:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:21,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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] {21#true} is VALID [2022-04-27 17:03:21,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 17:03:21,390 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 17:03:21,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:03:21,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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] {21#true} is VALID [2022-04-27 17:03:21,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 17:03:21,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 17:03:21,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 17:03:21,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} [51] mainENTRY-->L20-3: Formula: (and (= v_main_~b~0_2 6) (= v_main_~a~0_2 0)) InVars {} OutVars{main_~b~0=v_main_~b~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {21#true} is VALID [2022-04-27 17:03:21,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} [53] L20-3-->L20-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-27 17:03:21,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {22#false} [56] L20-4-->L26: Formula: (or (not (= v_main_~a~0_1 6)) (not (= v_main_~b~0_1 6))) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-27 17:03:21,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} [61] L26-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-27 17:03:21,394 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:21,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:03:21,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783374071] [2022-04-27 17:03:21,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783374071] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:03:21,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:03:21,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 17:03:21,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848601699] [2022-04-27 17:03:21,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:03:21,399 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:21,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:03:21,402 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:21,412 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:21,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 17:03:21,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:03:21,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 17:03:21,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 17:03:21,428 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 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:21,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:21,461 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-27 17:03:21,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 17:03:21,462 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:21,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:03:21,463 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:21,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-04-27 17:03:21,468 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:21,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-04-27 17:03:21,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 22 transitions. [2022-04-27 17:03:21,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:03:21,495 INFO L225 Difference]: With dead ends: 18 [2022-04-27 17:03:21,495 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 17:03:21,496 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:21,498 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 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:21,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 22 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:21,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 17:03:21,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 17:03:21,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:03:21,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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:21,515 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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:21,515 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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:21,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:21,517 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-27 17:03:21,517 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 17:03:21,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:03:21,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:03:21,518 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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:21,518 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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:21,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:21,519 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-27 17:03:21,520 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 17:03:21,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:03:21,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:03:21,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:03:21,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:03:21,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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:21,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-27 17:03:21,522 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2022-04-27 17:03:21,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:03:21,522 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-27 17:03:21,522 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:21,522 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 17:03:21,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-27 17:03:21,523 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:03:21,523 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:03:21,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 17:03:21,523 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:03:21,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:03:21,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1120439462, now seen corresponding path program 1 times [2022-04-27 17:03:21,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:03:21,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718726249] [2022-04-27 17:03:21,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:03:21,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:03:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:21,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:03:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:21,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {92#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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] {86#true} is VALID [2022-04-27 17:03:21,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {86#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#true} is VALID [2022-04-27 17:03:21,583 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86#true} {86#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#true} is VALID [2022-04-27 17:03:21,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {86#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {92#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:03:21,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {92#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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] {86#true} is VALID [2022-04-27 17:03:21,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {86#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#true} is VALID [2022-04-27 17:03:21,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86#true} {86#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#true} is VALID [2022-04-27 17:03:21,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {86#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#true} is VALID [2022-04-27 17:03:21,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {86#true} [51] mainENTRY-->L20-3: Formula: (and (= v_main_~b~0_2 6) (= v_main_~a~0_2 0)) InVars {} OutVars{main_~b~0=v_main_~b~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {91#(= main_~a~0 0)} is VALID [2022-04-27 17:03:21,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {91#(= main_~a~0 0)} [54] L20-3-->L20-4: 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[] {87#false} is VALID [2022-04-27 17:03:21,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {87#false} [56] L20-4-->L26: Formula: (or (not (= v_main_~a~0_1 6)) (not (= v_main_~b~0_1 6))) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {87#false} is VALID [2022-04-27 17:03:21,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {87#false} [61] L26-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87#false} is VALID [2022-04-27 17:03:21,586 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:21,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:03:21,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718726249] [2022-04-27 17:03:21,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718726249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:03:21,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:03:21,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 17:03:21,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925564812] [2022-04-27 17:03:21,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:03:21,588 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:21,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:03:21,588 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:21,596 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:21,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 17:03:21,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:03:21,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 17:03:21,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 17:03:21,597 INFO L87 Difference]: Start difference. First operand 13 states and 14 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:21,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:21,661 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 17:03:21,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 17:03:21,662 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:21,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:03:21,662 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:21,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-04-27 17:03:21,666 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:21,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-04-27 17:03:21,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 20 transitions. [2022-04-27 17:03:21,695 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:21,697 INFO L225 Difference]: With dead ends: 17 [2022-04-27 17:03:21,697 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 17:03:21,699 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:21,701 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 17:03:21,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 19 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 17:03:21,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 17:03:21,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2022-04-27 17:03:21,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:03:21,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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:21,704 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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:21,704 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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:21,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:21,705 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 17:03:21,705 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 17:03:21,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:03:21,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:03:21,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 17 states. [2022-04-27 17:03:21,706 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 17 states. [2022-04-27 17:03:21,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:21,707 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 17:03:21,707 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 17:03:21,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:03:21,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:03:21,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:03:21,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:03:21,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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:21,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-27 17:03:21,708 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2022-04-27 17:03:21,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:03:21,709 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-27 17:03:21,709 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:21,709 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 17:03:21,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 17:03:21,709 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:03:21,709 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:03:21,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 17:03:21,710 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:03:21,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:03:21,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1442269292, now seen corresponding path program 1 times [2022-04-27 17:03:21,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:03:21,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907065648] [2022-04-27 17:03:21,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:03:21,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:03:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:21,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:03:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:21,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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] {162#true} is VALID [2022-04-27 17:03:21,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-27 17:03:21,797 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {162#true} {162#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-27 17:03:21,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {162#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:03:21,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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] {162#true} is VALID [2022-04-27 17:03:21,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {162#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-27 17:03:21,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {162#true} {162#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-27 17:03:21,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {162#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-27 17:03:21,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {162#true} [51] mainENTRY-->L20-3: Formula: (and (= v_main_~b~0_2 6) (= v_main_~a~0_2 0)) InVars {} OutVars{main_~b~0=v_main_~b~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {162#true} is VALID [2022-04-27 17:03:21,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {162#true} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {167#(= main_~b~0 0)} is VALID [2022-04-27 17:03:21,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {167#(= main_~b~0 0)} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {163#false} is VALID [2022-04-27 17:03:21,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {163#false} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {163#false} is VALID [2022-04-27 17:03:21,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {163#false} [54] L20-3-->L20-4: 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[] {163#false} is VALID [2022-04-27 17:03:21,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {163#false} [56] L20-4-->L26: Formula: (or (not (= v_main_~a~0_1 6)) (not (= v_main_~b~0_1 6))) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {163#false} is VALID [2022-04-27 17:03:21,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {163#false} [61] L26-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {163#false} is VALID [2022-04-27 17:03:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 17:03:21,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:03:21,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907065648] [2022-04-27 17:03:21,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907065648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:03:21,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:03:21,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 17:03:21,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531241150] [2022-04-27 17:03:21,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:03:21,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 12 [2022-04-27 17:03:21,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:03:21,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:21,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:03:21,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 17:03:21,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:03:21,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 17:03:21,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 17:03:21,821 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:21,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:21,862 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-27 17:03:21,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 17:03:21,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 12 [2022-04-27 17:03:21,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:03:21,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:21,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2022-04-27 17:03:21,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2022-04-27 17:03:21,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 17 transitions. [2022-04-27 17:03:21,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:03:21,888 INFO L225 Difference]: With dead ends: 16 [2022-04-27 17:03:21,888 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 17:03:21,891 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:21,894 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 17:03:21,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 19 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 17:03:21,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 17:03:21,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-27 17:03:21,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:03:21,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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:21,898 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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:21,898 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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:21,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:21,900 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-27 17:03:21,900 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-27 17:03:21,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:03:21,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:03:21,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 16 states. [2022-04-27 17:03:21,901 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 16 states. [2022-04-27 17:03:21,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:21,903 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-27 17:03:21,903 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-27 17:03:21,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:03:21,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:03:21,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:03:21,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:03:21,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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:21,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 17:03:21,906 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-27 17:03:21,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:03:21,906 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 17:03:21,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:21,907 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 17:03:21,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 17:03:21,908 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:03:21,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:03:21,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 17:03:21,908 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:03:21,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:03:21,909 INFO L85 PathProgramCache]: Analyzing trace with hash -2120336465, now seen corresponding path program 1 times [2022-04-27 17:03:21,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:03:21,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948889541] [2022-04-27 17:03:21,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:03:21,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:03:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:21,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:03:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:21,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {243#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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] {236#true} is VALID [2022-04-27 17:03:21,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {236#true} is VALID [2022-04-27 17:03:21,961 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {236#true} {236#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {236#true} is VALID [2022-04-27 17:03:21,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {236#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:03:21,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {243#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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] {236#true} is VALID [2022-04-27 17:03:21,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {236#true} is VALID [2022-04-27 17:03:21,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {236#true} {236#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {236#true} is VALID [2022-04-27 17:03:21,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {236#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {236#true} is VALID [2022-04-27 17:03:21,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#true} [51] mainENTRY-->L20-3: Formula: (and (= v_main_~b~0_2 6) (= v_main_~a~0_2 0)) InVars {} OutVars{main_~b~0=v_main_~b~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {236#true} is VALID [2022-04-27 17:03:21,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {236#true} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {241#(= main_~b~0 0)} is VALID [2022-04-27 17:03:21,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {241#(= main_~b~0 0)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {241#(= main_~b~0 0)} is VALID [2022-04-27 17:03:21,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {241#(= main_~b~0 0)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {242#(<= main_~b~0 1)} is VALID [2022-04-27 17:03:21,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {242#(<= main_~b~0 1)} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {237#false} is VALID [2022-04-27 17:03:21,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {237#false} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {237#false} is VALID [2022-04-27 17:03:21,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {237#false} [54] L20-3-->L20-4: 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[] {237#false} is VALID [2022-04-27 17:03:21,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {237#false} [56] L20-4-->L26: Formula: (or (not (= v_main_~a~0_1 6)) (not (= v_main_~b~0_1 6))) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {237#false} is VALID [2022-04-27 17:03:21,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {237#false} [61] L26-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {237#false} is VALID [2022-04-27 17:03:21,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 17:03:21,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:03:21,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948889541] [2022-04-27 17:03:21,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948889541] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 17:03:21,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314764099] [2022-04-27 17:03:21,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:03:21,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:03:21,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:03:21,967 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:22,000 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:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:22,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 17:03:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:22,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:03:22,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {236#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {236#true} is VALID [2022-04-27 17:03:22,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#true} [49] 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] {236#true} is VALID [2022-04-27 17:03:22,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {236#true} is VALID [2022-04-27 17:03:22,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {236#true} {236#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {236#true} is VALID [2022-04-27 17:03:22,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {236#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {236#true} is VALID [2022-04-27 17:03:22,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#true} [51] mainENTRY-->L20-3: Formula: (and (= v_main_~b~0_2 6) (= v_main_~a~0_2 0)) InVars {} OutVars{main_~b~0=v_main_~b~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {236#true} is VALID [2022-04-27 17:03:22,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {236#true} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {265#(<= main_~b~0 0)} is VALID [2022-04-27 17:03:22,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {265#(<= main_~b~0 0)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {265#(<= main_~b~0 0)} is VALID [2022-04-27 17:03:22,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {265#(<= main_~b~0 0)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {242#(<= main_~b~0 1)} is VALID [2022-04-27 17:03:22,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {242#(<= main_~b~0 1)} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {237#false} is VALID [2022-04-27 17:03:22,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {237#false} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {237#false} is VALID [2022-04-27 17:03:22,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {237#false} [54] L20-3-->L20-4: 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[] {237#false} is VALID [2022-04-27 17:03:22,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {237#false} [56] L20-4-->L26: Formula: (or (not (= v_main_~a~0_1 6)) (not (= v_main_~b~0_1 6))) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {237#false} is VALID [2022-04-27 17:03:22,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {237#false} [61] L26-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {237#false} is VALID [2022-04-27 17:03:22,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 17:03:22,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 17:03:22,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {237#false} [61] L26-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {237#false} is VALID [2022-04-27 17:03:22,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {237#false} [56] L20-4-->L26: Formula: (or (not (= v_main_~a~0_1 6)) (not (= v_main_~b~0_1 6))) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {237#false} is VALID [2022-04-27 17:03:22,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {237#false} [54] L20-3-->L20-4: 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[] {237#false} is VALID [2022-04-27 17:03:22,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {237#false} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {237#false} is VALID [2022-04-27 17:03:22,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {299#(< main_~b~0 6)} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {237#false} is VALID [2022-04-27 17:03:22,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {303#(< main_~b~0 5)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {299#(< main_~b~0 6)} is VALID [2022-04-27 17:03:22,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {303#(< main_~b~0 5)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {303#(< main_~b~0 5)} is VALID [2022-04-27 17:03:22,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {236#true} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {303#(< main_~b~0 5)} is VALID [2022-04-27 17:03:22,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#true} [51] mainENTRY-->L20-3: Formula: (and (= v_main_~b~0_2 6) (= v_main_~a~0_2 0)) InVars {} OutVars{main_~b~0=v_main_~b~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {236#true} is VALID [2022-04-27 17:03:22,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {236#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {236#true} is VALID [2022-04-27 17:03:22,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {236#true} {236#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {236#true} is VALID [2022-04-27 17:03:22,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {236#true} is VALID [2022-04-27 17:03:22,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#true} [49] 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] {236#true} is VALID [2022-04-27 17:03:22,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {236#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {236#true} is VALID [2022-04-27 17:03:22,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 17:03:22,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314764099] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 17:03:22,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 17:03:22,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 17:03:22,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467515192] [2022-04-27 17:03:22,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 17:03:22,148 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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 14 [2022-04-27 17:03:22,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:03:22,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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:22,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:03:22,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 17:03:22,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:03:22,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 17:03:22,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 17:03:22,165 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:22,245 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-27 17:03:22,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 17:03:22,246 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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 14 [2022-04-27 17:03:22,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:03:22,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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:22,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2022-04-27 17:03:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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:22,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2022-04-27 17:03:22,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 24 transitions. [2022-04-27 17:03:22,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:03:22,267 INFO L225 Difference]: With dead ends: 21 [2022-04-27 17:03:22,267 INFO L226 Difference]: Without dead ends: 21 [2022-04-27 17:03:22,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 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:22,268 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 17:03:22,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 24 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 17:03:22,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-27 17:03:22,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-27 17:03:22,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:03:22,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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:22,270 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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:22,271 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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:22,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:22,271 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-27 17:03:22,272 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-27 17:03:22,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:03:22,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:03:22,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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 21 states. [2022-04-27 17:03:22,272 INFO L87 Difference]: Start difference. First operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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 21 states. [2022-04-27 17:03:22,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:22,273 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-27 17:03:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-27 17:03:22,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:03:22,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:03:22,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:03:22,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:03:22,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-27 17:03:22,274 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2022-04-27 17:03:22,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:03:22,275 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-27 17:03:22,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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:22,275 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-27 17:03:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 17:03:22,275 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:03:22,275 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:03:22,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 17:03:22,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:03:22,492 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:03:22,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:03:22,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1933436800, now seen corresponding path program 2 times [2022-04-27 17:03:22,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:03:22,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544206583] [2022-04-27 17:03:22,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:03:22,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:03:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:22,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:03:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:22,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {429#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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] {422#true} is VALID [2022-04-27 17:03:22,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {422#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#true} is VALID [2022-04-27 17:03:22,546 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {422#true} {422#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#true} is VALID [2022-04-27 17:03:22,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {422#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {429#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:03:22,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {429#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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] {422#true} is VALID [2022-04-27 17:03:22,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {422#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#true} is VALID [2022-04-27 17:03:22,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {422#true} {422#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#true} is VALID [2022-04-27 17:03:22,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {422#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#true} is VALID [2022-04-27 17:03:22,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {422#true} [51] mainENTRY-->L20-3: Formula: (and (= v_main_~b~0_2 6) (= v_main_~a~0_2 0)) InVars {} OutVars{main_~b~0=v_main_~b~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {427#(= main_~a~0 0)} is VALID [2022-04-27 17:03:22,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {427#(= main_~a~0 0)} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {427#(= main_~a~0 0)} is VALID [2022-04-27 17:03:22,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {427#(= main_~a~0 0)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {427#(= main_~a~0 0)} is VALID [2022-04-27 17:03:22,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {427#(= main_~a~0 0)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {427#(= main_~a~0 0)} is VALID [2022-04-27 17:03:22,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {427#(= main_~a~0 0)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {427#(= main_~a~0 0)} is VALID [2022-04-27 17:03:22,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {427#(= main_~a~0 0)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {427#(= main_~a~0 0)} is VALID [2022-04-27 17:03:22,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {427#(= main_~a~0 0)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {427#(= main_~a~0 0)} is VALID [2022-04-27 17:03:22,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {427#(= main_~a~0 0)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {427#(= main_~a~0 0)} is VALID [2022-04-27 17:03:22,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {427#(= main_~a~0 0)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {427#(= main_~a~0 0)} is VALID [2022-04-27 17:03:22,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {427#(= main_~a~0 0)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {427#(= main_~a~0 0)} is VALID [2022-04-27 17:03:22,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {427#(= main_~a~0 0)} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {427#(= main_~a~0 0)} is VALID [2022-04-27 17:03:22,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {427#(= main_~a~0 0)} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {428#(<= main_~a~0 1)} is VALID [2022-04-27 17:03:22,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {428#(<= main_~a~0 1)} [54] L20-3-->L20-4: 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[] {423#false} is VALID [2022-04-27 17:03:22,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {423#false} [56] L20-4-->L26: Formula: (or (not (= v_main_~a~0_1 6)) (not (= v_main_~b~0_1 6))) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {423#false} is VALID [2022-04-27 17:03:22,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {423#false} [61] L26-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {423#false} is VALID [2022-04-27 17:03:22,559 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 17:03:22,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:03:22,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544206583] [2022-04-27 17:03:22,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544206583] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 17:03:22,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049377171] [2022-04-27 17:03:22,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 17:03:22,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:03:22,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:03:22,573 INFO L229 MonitoredProcess]: Starting monitored process 3 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:22,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 17:03:22,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 17:03:22,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 17:03:22,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 17:03:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:22,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:03:22,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {422#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#true} is VALID [2022-04-27 17:03:22,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {422#true} [49] 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] {422#true} is VALID [2022-04-27 17:03:22,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {422#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#true} is VALID [2022-04-27 17:03:22,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {422#true} {422#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#true} is VALID [2022-04-27 17:03:22,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {422#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#true} is VALID [2022-04-27 17:03:22,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {422#true} [51] mainENTRY-->L20-3: Formula: (and (= v_main_~b~0_2 6) (= v_main_~a~0_2 0)) InVars {} OutVars{main_~b~0=v_main_~b~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {448#(<= main_~a~0 0)} is VALID [2022-04-27 17:03:22,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {448#(<= main_~a~0 0)} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {448#(<= main_~a~0 0)} is VALID [2022-04-27 17:03:22,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {448#(<= main_~a~0 0)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {448#(<= main_~a~0 0)} is VALID [2022-04-27 17:03:22,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {448#(<= main_~a~0 0)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {448#(<= main_~a~0 0)} is VALID [2022-04-27 17:03:22,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {448#(<= main_~a~0 0)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {448#(<= main_~a~0 0)} is VALID [2022-04-27 17:03:22,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {448#(<= main_~a~0 0)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {448#(<= main_~a~0 0)} is VALID [2022-04-27 17:03:22,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {448#(<= main_~a~0 0)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {448#(<= main_~a~0 0)} is VALID [2022-04-27 17:03:22,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {448#(<= main_~a~0 0)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {448#(<= main_~a~0 0)} is VALID [2022-04-27 17:03:22,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {448#(<= main_~a~0 0)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {448#(<= main_~a~0 0)} is VALID [2022-04-27 17:03:22,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {448#(<= main_~a~0 0)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {448#(<= main_~a~0 0)} is VALID [2022-04-27 17:03:22,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {448#(<= main_~a~0 0)} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {448#(<= main_~a~0 0)} is VALID [2022-04-27 17:03:22,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {448#(<= main_~a~0 0)} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {428#(<= main_~a~0 1)} is VALID [2022-04-27 17:03:22,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {428#(<= main_~a~0 1)} [54] L20-3-->L20-4: 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[] {423#false} is VALID [2022-04-27 17:03:22,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {423#false} [56] L20-4-->L26: Formula: (or (not (= v_main_~a~0_1 6)) (not (= v_main_~b~0_1 6))) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {423#false} is VALID [2022-04-27 17:03:22,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {423#false} [61] L26-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {423#false} is VALID [2022-04-27 17:03:22,722 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 17:03:22,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 17:03:22,859 INFO L290 TraceCheckUtils]: 19: Hoare triple {423#false} [61] L26-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {423#false} is VALID [2022-04-27 17:03:22,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {423#false} [56] L20-4-->L26: Formula: (or (not (= v_main_~a~0_1 6)) (not (= v_main_~b~0_1 6))) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {423#false} is VALID [2022-04-27 17:03:22,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {497#(< main_~a~0 6)} [54] L20-3-->L20-4: 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[] {423#false} is VALID [2022-04-27 17:03:22,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {501#(< main_~a~0 5)} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {497#(< main_~a~0 6)} is VALID [2022-04-27 17:03:22,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {501#(< main_~a~0 5)} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {501#(< main_~a~0 5)} is VALID [2022-04-27 17:03:22,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {501#(< main_~a~0 5)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {501#(< main_~a~0 5)} is VALID [2022-04-27 17:03:22,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {501#(< main_~a~0 5)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {501#(< main_~a~0 5)} is VALID [2022-04-27 17:03:22,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {501#(< main_~a~0 5)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {501#(< main_~a~0 5)} is VALID [2022-04-27 17:03:22,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {501#(< main_~a~0 5)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {501#(< main_~a~0 5)} is VALID [2022-04-27 17:03:22,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {501#(< main_~a~0 5)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {501#(< main_~a~0 5)} is VALID [2022-04-27 17:03:22,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {501#(< main_~a~0 5)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {501#(< main_~a~0 5)} is VALID [2022-04-27 17:03:22,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {501#(< main_~a~0 5)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {501#(< main_~a~0 5)} is VALID [2022-04-27 17:03:22,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {501#(< main_~a~0 5)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {501#(< main_~a~0 5)} is VALID [2022-04-27 17:03:22,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {501#(< main_~a~0 5)} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {501#(< main_~a~0 5)} is VALID [2022-04-27 17:03:22,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {422#true} [51] mainENTRY-->L20-3: Formula: (and (= v_main_~b~0_2 6) (= v_main_~a~0_2 0)) InVars {} OutVars{main_~b~0=v_main_~b~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {501#(< main_~a~0 5)} is VALID [2022-04-27 17:03:22,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {422#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#true} is VALID [2022-04-27 17:03:22,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {422#true} {422#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#true} is VALID [2022-04-27 17:03:22,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {422#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#true} is VALID [2022-04-27 17:03:22,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {422#true} [49] 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] {422#true} is VALID [2022-04-27 17:03:22,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {422#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#true} is VALID [2022-04-27 17:03:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 17:03:22,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049377171] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 17:03:22,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 17:03:22,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 17:03:22,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565278120] [2022-04-27 17:03:22,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 17:03:22,866 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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 20 [2022-04-27 17:03:22,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:03:22,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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:22,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:03:22,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 17:03:22,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:03:22,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 17:03:22,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 17:03:22,885 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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:22,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:22,989 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-27 17:03:22,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 17:03:22,990 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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 20 [2022-04-27 17:03:22,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:03:22,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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:22,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-04-27 17:03:22,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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:22,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-04-27 17:03:22,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2022-04-27 17:03:23,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:03:23,020 INFO L225 Difference]: With dead ends: 54 [2022-04-27 17:03:23,020 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 17:03:23,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 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:23,021 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 17:03:23,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 19 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 17:03:23,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 17:03:23,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-27 17:03:23,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:03:23,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 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:23,028 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 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:23,028 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 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:23,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:23,033 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-27 17:03:23,033 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-27 17:03:23,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:03:23,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:03:23,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 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 54 states. [2022-04-27 17:03:23,036 INFO L87 Difference]: Start difference. First operand has 54 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 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 54 states. [2022-04-27 17:03:23,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:23,039 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-27 17:03:23,039 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-27 17:03:23,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:03:23,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:03:23,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:03:23,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:03:23,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 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:23,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-04-27 17:03:23,043 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 20 [2022-04-27 17:03:23,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:03:23,043 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-04-27 17:03:23,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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:23,043 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-27 17:03:23,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-27 17:03:23,045 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:03:23,045 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:03:23,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 17:03:23,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:03:23,261 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:03:23,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:03:23,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1544578086, now seen corresponding path program 3 times [2022-04-27 17:03:23,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:03:23,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260642917] [2022-04-27 17:03:23,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:03:23,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:03:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:23,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:03:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:23,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {786#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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] {776#true} is VALID [2022-04-27 17:03:23,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {776#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 17:03:23,336 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {776#true} {776#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 17:03:23,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {776#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {786#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:03:23,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {786#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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] {776#true} is VALID [2022-04-27 17:03:23,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {776#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 17:03:23,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {776#true} {776#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 17:03:23,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {776#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 17:03:23,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {776#true} [51] mainENTRY-->L20-3: Formula: (and (= v_main_~b~0_2 6) (= v_main_~a~0_2 0)) InVars {} OutVars{main_~b~0=v_main_~b~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {776#true} is VALID [2022-04-27 17:03:23,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {776#true} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {781#(= main_~b~0 0)} is VALID [2022-04-27 17:03:23,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#(= main_~b~0 0)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {781#(= main_~b~0 0)} is VALID [2022-04-27 17:03:23,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {781#(= main_~b~0 0)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {782#(<= main_~b~0 1)} is VALID [2022-04-27 17:03:23,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {782#(<= main_~b~0 1)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {782#(<= main_~b~0 1)} is VALID [2022-04-27 17:03:23,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {782#(<= main_~b~0 1)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {783#(<= main_~b~0 2)} is VALID [2022-04-27 17:03:23,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {783#(<= main_~b~0 2)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {783#(<= main_~b~0 2)} is VALID [2022-04-27 17:03:23,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {783#(<= main_~b~0 2)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {784#(<= main_~b~0 3)} is VALID [2022-04-27 17:03:23,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {784#(<= main_~b~0 3)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {784#(<= main_~b~0 3)} is VALID [2022-04-27 17:03:23,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {784#(<= main_~b~0 3)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {785#(<= main_~b~0 4)} is VALID [2022-04-27 17:03:23,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {785#(<= main_~b~0 4)} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {777#false} is VALID [2022-04-27 17:03:23,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {777#false} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {777#false} is VALID [2022-04-27 17:03:23,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {777#false} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {777#false} is VALID [2022-04-27 17:03:23,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {777#false} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {777#false} is VALID [2022-04-27 17:03:23,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {777#false} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {777#false} is VALID [2022-04-27 17:03:23,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {777#false} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {777#false} is VALID [2022-04-27 17:03:23,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {777#false} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {777#false} is VALID [2022-04-27 17:03:23,350 INFO L290 TraceCheckUtils]: 22: Hoare triple {777#false} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {777#false} is VALID [2022-04-27 17:03:23,350 INFO L290 TraceCheckUtils]: 23: Hoare triple {777#false} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {777#false} is VALID [2022-04-27 17:03:23,350 INFO L290 TraceCheckUtils]: 24: Hoare triple {777#false} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {777#false} is VALID [2022-04-27 17:03:23,350 INFO L290 TraceCheckUtils]: 25: Hoare triple {777#false} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {777#false} is VALID [2022-04-27 17:03:23,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {777#false} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {777#false} is VALID [2022-04-27 17:03:23,350 INFO L290 TraceCheckUtils]: 27: Hoare triple {777#false} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {777#false} is VALID [2022-04-27 17:03:23,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {777#false} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {777#false} is VALID [2022-04-27 17:03:23,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {777#false} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {777#false} is VALID [2022-04-27 17:03:23,352 INFO L290 TraceCheckUtils]: 30: Hoare triple {777#false} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {777#false} is VALID [2022-04-27 17:03:23,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {777#false} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {777#false} is VALID [2022-04-27 17:03:23,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {777#false} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {777#false} is VALID [2022-04-27 17:03:23,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {777#false} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {777#false} is VALID [2022-04-27 17:03:23,356 INFO L290 TraceCheckUtils]: 34: Hoare triple {777#false} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {777#false} is VALID [2022-04-27 17:03:23,356 INFO L290 TraceCheckUtils]: 35: Hoare triple {777#false} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {777#false} is VALID [2022-04-27 17:03:23,356 INFO L290 TraceCheckUtils]: 36: Hoare triple {777#false} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {777#false} is VALID [2022-04-27 17:03:23,356 INFO L290 TraceCheckUtils]: 37: Hoare triple {777#false} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {777#false} is VALID [2022-04-27 17:03:23,356 INFO L290 TraceCheckUtils]: 38: Hoare triple {777#false} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {777#false} is VALID [2022-04-27 17:03:23,356 INFO L290 TraceCheckUtils]: 39: Hoare triple {777#false} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {777#false} is VALID [2022-04-27 17:03:23,356 INFO L290 TraceCheckUtils]: 40: Hoare triple {777#false} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {777#false} is VALID [2022-04-27 17:03:23,357 INFO L290 TraceCheckUtils]: 41: Hoare triple {777#false} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {777#false} is VALID [2022-04-27 17:03:23,357 INFO L290 TraceCheckUtils]: 42: Hoare triple {777#false} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {777#false} is VALID [2022-04-27 17:03:23,357 INFO L290 TraceCheckUtils]: 43: Hoare triple {777#false} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {777#false} is VALID [2022-04-27 17:03:23,357 INFO L290 TraceCheckUtils]: 44: Hoare triple {777#false} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {777#false} is VALID [2022-04-27 17:03:23,357 INFO L290 TraceCheckUtils]: 45: Hoare triple {777#false} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {777#false} is VALID [2022-04-27 17:03:23,357 INFO L290 TraceCheckUtils]: 46: Hoare triple {777#false} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {777#false} is VALID [2022-04-27 17:03:23,357 INFO L290 TraceCheckUtils]: 47: Hoare triple {777#false} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {777#false} is VALID [2022-04-27 17:03:23,357 INFO L290 TraceCheckUtils]: 48: Hoare triple {777#false} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {777#false} is VALID [2022-04-27 17:03:23,357 INFO L290 TraceCheckUtils]: 49: Hoare triple {777#false} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {777#false} is VALID [2022-04-27 17:03:23,358 INFO L290 TraceCheckUtils]: 50: Hoare triple {777#false} [54] L20-3-->L20-4: 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[] {777#false} is VALID [2022-04-27 17:03:23,358 INFO L290 TraceCheckUtils]: 51: Hoare triple {777#false} [56] L20-4-->L26: Formula: (or (not (= v_main_~a~0_1 6)) (not (= v_main_~b~0_1 6))) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {777#false} is VALID [2022-04-27 17:03:23,358 INFO L290 TraceCheckUtils]: 52: Hoare triple {777#false} [61] L26-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {777#false} is VALID [2022-04-27 17:03:23,358 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 127 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-04-27 17:03:23,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:03:23,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260642917] [2022-04-27 17:03:23,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260642917] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 17:03:23,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140270085] [2022-04-27 17:03:23,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 17:03:23,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:03:23,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:03:23,361 INFO L229 MonitoredProcess]: Starting monitored process 4 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:23,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 17:03:23,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-27 17:03:23,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 17:03:23,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 17:03:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:03:23,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:03:23,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {776#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 17:03:23,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {776#true} [49] 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] {776#true} is VALID [2022-04-27 17:03:23,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {776#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 17:03:23,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {776#true} {776#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 17:03:23,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {776#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 17:03:23,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {776#true} [51] mainENTRY-->L20-3: Formula: (and (= v_main_~b~0_2 6) (= v_main_~a~0_2 0)) InVars {} OutVars{main_~b~0=v_main_~b~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {776#true} is VALID [2022-04-27 17:03:23,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {776#true} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {776#true} is VALID [2022-04-27 17:03:23,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {776#true} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 17:03:23,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {776#true} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {776#true} is VALID [2022-04-27 17:03:23,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {776#true} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 17:03:23,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {776#true} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {776#true} is VALID [2022-04-27 17:03:23,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {776#true} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 17:03:23,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {776#true} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {776#true} is VALID [2022-04-27 17:03:23,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {776#true} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 17:03:23,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {776#true} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {776#true} is VALID [2022-04-27 17:03:23,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {776#true} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 17:03:23,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {776#true} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {776#true} is VALID [2022-04-27 17:03:23,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {776#true} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {776#true} is VALID [2022-04-27 17:03:23,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {776#true} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 17:03:23,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {776#true} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {776#true} is VALID [2022-04-27 17:03:23,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {776#true} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 17:03:23,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {776#true} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {776#true} is VALID [2022-04-27 17:03:23,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {776#true} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 17:03:23,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {776#true} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {776#true} is VALID [2022-04-27 17:03:23,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {776#true} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 17:03:23,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {776#true} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {776#true} is VALID [2022-04-27 17:03:23,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {776#true} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 17:03:23,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {776#true} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {776#true} is VALID [2022-04-27 17:03:23,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {776#true} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {776#true} is VALID [2022-04-27 17:03:23,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {776#true} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 17:03:23,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {776#true} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {776#true} is VALID [2022-04-27 17:03:23,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {776#true} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 17:03:23,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {776#true} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {776#true} is VALID [2022-04-27 17:03:23,734 INFO L290 TraceCheckUtils]: 33: Hoare triple {776#true} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 17:03:23,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {776#true} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {776#true} is VALID [2022-04-27 17:03:23,734 INFO L290 TraceCheckUtils]: 35: Hoare triple {776#true} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 17:03:23,734 INFO L290 TraceCheckUtils]: 36: Hoare triple {776#true} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {776#true} is VALID [2022-04-27 17:03:23,734 INFO L290 TraceCheckUtils]: 37: Hoare triple {776#true} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 17:03:23,734 INFO L290 TraceCheckUtils]: 38: Hoare triple {776#true} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {776#true} is VALID [2022-04-27 17:03:23,735 INFO L290 TraceCheckUtils]: 39: Hoare triple {776#true} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {907#(< main_~a~0 6)} is VALID [2022-04-27 17:03:23,739 INFO L290 TraceCheckUtils]: 40: Hoare triple {907#(< main_~a~0 6)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {907#(< main_~a~0 6)} is VALID [2022-04-27 17:03:23,739 INFO L290 TraceCheckUtils]: 41: Hoare triple {907#(< main_~a~0 6)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {907#(< main_~a~0 6)} is VALID [2022-04-27 17:03:23,740 INFO L290 TraceCheckUtils]: 42: Hoare triple {907#(< main_~a~0 6)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {907#(< main_~a~0 6)} is VALID [2022-04-27 17:03:23,740 INFO L290 TraceCheckUtils]: 43: Hoare triple {907#(< main_~a~0 6)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {907#(< main_~a~0 6)} is VALID [2022-04-27 17:03:23,740 INFO L290 TraceCheckUtils]: 44: Hoare triple {907#(< main_~a~0 6)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {907#(< main_~a~0 6)} is VALID [2022-04-27 17:03:23,741 INFO L290 TraceCheckUtils]: 45: Hoare triple {907#(< main_~a~0 6)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {907#(< main_~a~0 6)} is VALID [2022-04-27 17:03:23,741 INFO L290 TraceCheckUtils]: 46: Hoare triple {907#(< main_~a~0 6)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {929#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-27 17:03:23,742 INFO L290 TraceCheckUtils]: 47: Hoare triple {929#(and (< main_~b~0 6) (< main_~a~0 6))} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {933#(and (< main_~b~0 7) (< main_~a~0 6))} is VALID [2022-04-27 17:03:23,742 INFO L290 TraceCheckUtils]: 48: Hoare triple {933#(and (< main_~b~0 7) (< main_~a~0 6))} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {937#(and (< main_~b~0 7) (< main_~a~0 6) (not (< main_~b~0 6)))} is VALID [2022-04-27 17:03:23,743 INFO L290 TraceCheckUtils]: 49: Hoare triple {937#(and (< main_~b~0 7) (< main_~a~0 6) (not (< main_~b~0 6)))} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {941#(and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~b~0 6)))} is VALID [2022-04-27 17:03:23,743 INFO L290 TraceCheckUtils]: 50: Hoare triple {941#(and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~b~0 6)))} [54] L20-3-->L20-4: 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[] {945#(and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~b~0 6)) (not (< main_~a~0 6)))} is VALID [2022-04-27 17:03:23,744 INFO L290 TraceCheckUtils]: 51: Hoare triple {945#(and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~b~0 6)) (not (< main_~a~0 6)))} [56] L20-4-->L26: Formula: (or (not (= v_main_~a~0_1 6)) (not (= v_main_~b~0_1 6))) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {777#false} is VALID [2022-04-27 17:03:23,744 INFO L290 TraceCheckUtils]: 52: Hoare triple {777#false} [61] L26-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {777#false} is VALID [2022-04-27 17:03:23,744 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-04-27 17:03:23,744 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:03:23,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140270085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:03:23,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 17:03:23,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2022-04-27 17:03:23,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396900055] [2022-04-27 17:03:23,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:03:23,745 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 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 53 [2022-04-27 17:03:23,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:03:23,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 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:23,757 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:23,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 17:03:23,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:03:23,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 17:03:23,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-27 17:03:23,758 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 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:23,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:23,815 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-27 17:03:23,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 17:03:23,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 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 53 [2022-04-27 17:03:23,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:03:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 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:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2022-04-27 17:03:23,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 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:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2022-04-27 17:03:23,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 15 transitions. [2022-04-27 17:03:23,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:03:23,827 INFO L225 Difference]: With dead ends: 52 [2022-04-27 17:03:23,827 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 17:03:23,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-27 17:03:23,828 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 17:03:23,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 26 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 17:03:23,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 17:03:23,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 17:03:23,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:03:23,829 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:23,829 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:23,829 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:23,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:23,829 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 17:03:23,829 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 17:03:23,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:03:23,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:03:23,829 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:23,829 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:23,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:03:23,829 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 17:03:23,829 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 17:03:23,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:03:23,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:03:23,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:03:23,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:03:23,830 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:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 17:03:23,830 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2022-04-27 17:03:23,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:03:23,830 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 17:03:23,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 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:23,830 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 17:03:23,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:03:23,832 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 17:03:23,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 17:03:24,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:03:24,051 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2022-04-27 17:03:24,052 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 17:03:24,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 05:03:24 BasicIcfg [2022-04-27 17:03:24,054 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 17:03:24,055 INFO L158 Benchmark]: Toolchain (without parser) took 3408.72ms. Allocated memory was 185.6MB in the beginning and 298.8MB in the end (delta: 113.2MB). Free memory was 130.7MB in the beginning and 235.9MB in the end (delta: -105.2MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. [2022-04-27 17:03:24,055 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 185.6MB. Free memory was 146.8MB in the beginning and 146.7MB in the end (delta: 68.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 17:03:24,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.25ms. Allocated memory was 185.6MB in the beginning and 298.8MB in the end (delta: 113.2MB). Free memory was 130.5MB in the beginning and 270.1MB in the end (delta: -139.6MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2022-04-27 17:03:24,055 INFO L158 Benchmark]: Boogie Preprocessor took 27.36ms. Allocated memory is still 298.8MB. Free memory was 270.1MB in the beginning and 268.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 17:03:24,055 INFO L158 Benchmark]: RCFGBuilder took 263.57ms. Allocated memory is still 298.8MB. Free memory was 268.5MB in the beginning and 257.5MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 17:03:24,056 INFO L158 Benchmark]: IcfgTransformer took 34.71ms. Allocated memory is still 298.8MB. Free memory was 257.5MB in the beginning and 256.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 17:03:24,056 INFO L158 Benchmark]: TraceAbstraction took 2854.71ms. Allocated memory is still 298.8MB. Free memory was 255.4MB in the beginning and 235.9MB in the end (delta: 19.5MB). Peak memory consumption was 20.8MB. Max. memory is 8.0GB. [2022-04-27 17:03:24,057 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 185.6MB. Free memory was 146.8MB in the beginning and 146.7MB in the end (delta: 68.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 209.25ms. Allocated memory was 185.6MB in the beginning and 298.8MB in the end (delta: 113.2MB). Free memory was 130.5MB in the beginning and 270.1MB in the end (delta: -139.6MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.36ms. Allocated memory is still 298.8MB. Free memory was 270.1MB in the beginning and 268.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 263.57ms. Allocated memory is still 298.8MB. Free memory was 268.5MB in the beginning and 257.5MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 34.71ms. Allocated memory is still 298.8MB. Free memory was 257.5MB in the beginning and 256.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2854.71ms. Allocated memory is still 298.8MB. Free memory was 255.4MB in the beginning and 235.9MB in the end (delta: 19.5MB). Peak memory consumption was 20.8MB. 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: 26]: 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, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 107 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 107 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95 IncrementalHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 73 mSDtfsCounter, 95 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=5, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 204 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 435 SizeOfPredicates, 2 NumberOfNonLiveVariables, 201 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 688/710 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:24,090 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...