/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/locks/test_locks_6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 20:30:55,991 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 20:30:55,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 20:30:56,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 20:30:56,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 20:30:56,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 20:30:56,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 20:30:56,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 20:30:56,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 20:30:56,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 20:30:56,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 20:30:56,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 20:30:56,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 20:30:56,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 20:30:56,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 20:30:56,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 20:30:56,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 20:30:56,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 20:30:56,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 20:30:56,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 20:30:56,041 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 20:30:56,043 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 20:30:56,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 20:30:56,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 20:30:56,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 20:30:56,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 20:30:56,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 20:30:56,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 20:30:56,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 20:30:56,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 20:30:56,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 20:30:56,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 20:30:56,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 20:30:56,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 20:30:56,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 20:30:56,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 20:30:56,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 20:30:56,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 20:30:56,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 20:30:56,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 20:30:56,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 20:30:56,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 20:30:56,056 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 20:30:56,065 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 20:30:56,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 20:30:56,066 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 20:30:56,066 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 20:30:56,067 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 20:30:56,067 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 20:30:56,067 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 20:30:56,067 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 20:30:56,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 20:30:56,067 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 20:30:56,068 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 20:30:56,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 20:30:56,068 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 20:30:56,068 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 20:30:56,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 20:30:56,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 20:30:56,068 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 20:30:56,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 20:30:56,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 20:30:56,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 20:30:56,068 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 20:30:56,069 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 20:30:56,069 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 20:30:56,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 20:30:56,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 20:30:56,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 20:30:56,252 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 20:30:56,252 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 20:30:56,253 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2022-04-27 20:30:56,305 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6b595b4a/41efbf69326643a5a2ac04a0d5f7a42f/FLAGd9765a862 [2022-04-27 20:30:56,638 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 20:30:56,638 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2022-04-27 20:30:56,642 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6b595b4a/41efbf69326643a5a2ac04a0d5f7a42f/FLAGd9765a862 [2022-04-27 20:30:56,650 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6b595b4a/41efbf69326643a5a2ac04a0d5f7a42f [2022-04-27 20:30:56,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 20:30:56,653 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 20:30:56,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 20:30:56,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 20:30:56,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 20:30:56,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 08:30:56" (1/1) ... [2022-04-27 20:30:56,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6675d253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:30:56, skipping insertion in model container [2022-04-27 20:30:56,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 08:30:56" (1/1) ... [2022-04-27 20:30:56,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 20:30:56,670 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 20:30:56,785 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c[2544,2557] [2022-04-27 20:30:56,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 20:30:56,792 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 20:30:56,809 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c[2544,2557] [2022-04-27 20:30:56,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 20:30:56,818 INFO L208 MainTranslator]: Completed translation [2022-04-27 20:30:56,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:30:56 WrapperNode [2022-04-27 20:30:56,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 20:30:56,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 20:30:56,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 20:30:56,819 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 20:30:56,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:30:56" (1/1) ... [2022-04-27 20:30:56,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:30:56" (1/1) ... [2022-04-27 20:30:56,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:30:56" (1/1) ... [2022-04-27 20:30:56,833 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:30:56" (1/1) ... [2022-04-27 20:30:56,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:30:56" (1/1) ... [2022-04-27 20:30:56,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:30:56" (1/1) ... [2022-04-27 20:30:56,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:30:56" (1/1) ... [2022-04-27 20:30:56,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 20:30:56,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 20:30:56,844 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 20:30:56,844 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 20:30:56,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:30:56" (1/1) ... [2022-04-27 20:30:56,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 20:30:56,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:30:56,872 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 20:30:56,887 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 20:30:56,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 20:30:56,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 20:30:56,917 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 20:30:56,917 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 20:30:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 20:30:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 20:30:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 20:30:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 20:30:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 20:30:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 20:30:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 20:30:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 20:30:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 20:30:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 20:30:56,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 20:30:56,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 20:30:56,970 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 20:30:56,971 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 20:30:57,086 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 20:30:57,091 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 20:30:57,091 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 20:30:57,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 08:30:57 BoogieIcfgContainer [2022-04-27 20:30:57,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 20:30:57,093 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 20:30:57,093 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 20:30:57,096 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 20:30:57,116 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 08:30:57" (1/1) ... [2022-04-27 20:30:57,118 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 20:30:57,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 08:30:57 BasicIcfg [2022-04-27 20:30:57,138 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 20:30:57,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 20:30:57,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 20:30:57,141 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 20:30:57,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 08:30:56" (1/4) ... [2022-04-27 20:30:57,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bdda7eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 08:30:57, skipping insertion in model container [2022-04-27 20:30:57,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:30:56" (2/4) ... [2022-04-27 20:30:57,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bdda7eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 08:30:57, skipping insertion in model container [2022-04-27 20:30:57,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 08:30:57" (3/4) ... [2022-04-27 20:30:57,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bdda7eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 08:30:57, skipping insertion in model container [2022-04-27 20:30:57,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 08:30:57" (4/4) ... [2022-04-27 20:30:57,142 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_6.cJordan [2022-04-27 20:30:57,152 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 20:30:57,152 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 20:30:57,186 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 20:30:57,190 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@793db150, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@24fe849b [2022-04-27 20:30:57,190 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 20:30:57,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 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 20:30:57,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 20:30:57,215 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:30:57,215 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:30:57,216 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:30:57,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:30:57,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1293324729, now seen corresponding path program 1 times [2022-04-27 20:30:57,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:30:57,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286608122] [2022-04-27 20:30:57,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:30:57,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:30:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:57,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:30:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:57,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {36#true} is VALID [2022-04-27 20:30:57,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#true} is VALID [2022-04-27 20:30:57,369 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#true} is VALID [2022-04-27 20:30:57,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:30:57,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {36#true} is VALID [2022-04-27 20:30:57,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#true} is VALID [2022-04-27 20:30:57,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#true} is VALID [2022-04-27 20:30:57,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#true} is VALID [2022-04-27 20:30:57,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {36#true} is VALID [2022-04-27 20:30:57,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {36#true} is VALID [2022-04-27 20:30:57,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {36#true} is VALID [2022-04-27 20:30:57,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} [148] L48-->L48-2: Formula: (and (not (= v_main_~p1~0_3 0)) (= v_main_~lk1~0_5 1)) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3, main_~lk1~0=v_main_~lk1~0_5} AuxVars[] AssignedVars[main_~lk1~0] {41#(= main_~lk1~0 1)} is VALID [2022-04-27 20:30:57,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#(= main_~lk1~0 1)} [150] L48-2-->L52-1: Formula: (and (= v_main_~lk2~0_6 1) (not (= v_main_~p2~0_4 0))) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_6, main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[main_~lk2~0] {41#(= main_~lk1~0 1)} is VALID [2022-04-27 20:30:57,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {41#(= main_~lk1~0 1)} [152] L52-1-->L56-1: Formula: (and (= v_main_~lk3~0_6 1) (not (= v_main_~p3~0_4 0))) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {41#(= main_~lk1~0 1)} is VALID [2022-04-27 20:30:57,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#(= main_~lk1~0 1)} [154] L56-1-->L60-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {41#(= main_~lk1~0 1)} is VALID [2022-04-27 20:30:57,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#(= main_~lk1~0 1)} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {41#(= main_~lk1~0 1)} is VALID [2022-04-27 20:30:57,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#(= main_~lk1~0 1)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {41#(= main_~lk1~0 1)} is VALID [2022-04-27 20:30:57,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#(= main_~lk1~0 1)} [160] L68-1-->L75: Formula: (not (= v_main_~p1~0_5 0)) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {41#(= main_~lk1~0 1)} is VALID [2022-04-27 20:30:57,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#(= main_~lk1~0 1)} [162] L75-->L100-1: Formula: (not (= v_main_~lk1~0_6 1)) InVars {main_~lk1~0=v_main_~lk1~0_6} OutVars{main_~lk1~0=v_main_~lk1~0_6} AuxVars[] AssignedVars[] {37#false} is VALID [2022-04-27 20:30:57,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#false} is VALID [2022-04-27 20:30:57,376 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 20:30:57,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:30:57,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286608122] [2022-04-27 20:30:57,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286608122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:30:57,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:30:57,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:30:57,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377965875] [2022-04-27 20:30:57,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:30:57,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 20:30:57,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:30:57,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 20:30:57,404 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 20:30:57,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:30:57,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:30:57,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:30:57,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:30:57,422 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 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 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 20:30:57,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:57,640 INFO L93 Difference]: Finished difference Result 57 states and 90 transitions. [2022-04-27 20:30:57,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:30:57,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 20:30:57,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:30:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 20:30:57,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-04-27 20:30:57,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 20:30:57,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-04-27 20:30:57,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 97 transitions. [2022-04-27 20:30:57,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:30:57,736 INFO L225 Difference]: With dead ends: 57 [2022-04-27 20:30:57,737 INFO L226 Difference]: Without dead ends: 49 [2022-04-27 20:30:57,738 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 20:30:57,742 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 106 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 20:30:57,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 65 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 20:30:57,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-27 20:30:57,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2022-04-27 20:30:57,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:30:57,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 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 20:30:57,763 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 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 20:30:57,763 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 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 20:30:57,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:57,771 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. [2022-04-27 20:30:57,771 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 81 transitions. [2022-04-27 20:30:57,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:57,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:57,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 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 49 states. [2022-04-27 20:30:57,772 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 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 49 states. [2022-04-27 20:30:57,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:57,775 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. [2022-04-27 20:30:57,775 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 81 transitions. [2022-04-27 20:30:57,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:57,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:57,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:30:57,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:30:57,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 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 20:30:57,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2022-04-27 20:30:57,778 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 17 [2022-04-27 20:30:57,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:30:57,778 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2022-04-27 20:30:57,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 20:30:57,778 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2022-04-27 20:30:57,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 20:30:57,779 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:30:57,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:30:57,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 20:30:57,779 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:30:57,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:30:57,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1194188104, now seen corresponding path program 1 times [2022-04-27 20:30:57,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:30:57,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572933310] [2022-04-27 20:30:57,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:30:57,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:30:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:57,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:30:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:57,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {238#true} is VALID [2022-04-27 20:30:57,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {238#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {238#true} is VALID [2022-04-27 20:30:57,829 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {238#true} {238#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {238#true} is VALID [2022-04-27 20:30:57,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {238#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:30:57,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {238#true} is VALID [2022-04-27 20:30:57,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {238#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {238#true} is VALID [2022-04-27 20:30:57,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {238#true} {238#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {238#true} is VALID [2022-04-27 20:30:57,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {238#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {238#true} is VALID [2022-04-27 20:30:57,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {238#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {238#true} is VALID [2022-04-27 20:30:57,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {238#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {238#true} is VALID [2022-04-27 20:30:57,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {238#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {238#true} is VALID [2022-04-27 20:30:57,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {238#true} [149] L48-->L48-2: Formula: (= v_main_~p1~0_4 0) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {243#(= main_~p1~0 0)} is VALID [2022-04-27 20:30:57,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {243#(= main_~p1~0 0)} [150] L48-2-->L52-1: Formula: (and (= v_main_~lk2~0_6 1) (not (= v_main_~p2~0_4 0))) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_6, main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[main_~lk2~0] {243#(= main_~p1~0 0)} is VALID [2022-04-27 20:30:57,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {243#(= main_~p1~0 0)} [152] L52-1-->L56-1: Formula: (and (= v_main_~lk3~0_6 1) (not (= v_main_~p3~0_4 0))) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {243#(= main_~p1~0 0)} is VALID [2022-04-27 20:30:57,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {243#(= main_~p1~0 0)} [154] L56-1-->L60-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {243#(= main_~p1~0 0)} is VALID [2022-04-27 20:30:57,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {243#(= main_~p1~0 0)} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {243#(= main_~p1~0 0)} is VALID [2022-04-27 20:30:57,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {243#(= main_~p1~0 0)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {243#(= main_~p1~0 0)} is VALID [2022-04-27 20:30:57,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {243#(= main_~p1~0 0)} [160] L68-1-->L75: Formula: (not (= v_main_~p1~0_5 0)) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {239#false} is VALID [2022-04-27 20:30:57,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {239#false} [162] L75-->L100-1: Formula: (not (= v_main_~lk1~0_6 1)) InVars {main_~lk1~0=v_main_~lk1~0_6} OutVars{main_~lk1~0=v_main_~lk1~0_6} AuxVars[] AssignedVars[] {239#false} is VALID [2022-04-27 20:30:57,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {239#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#false} is VALID [2022-04-27 20:30:57,834 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 20:30:57,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:30:57,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572933310] [2022-04-27 20:30:57,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572933310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:30:57,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:30:57,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:30:57,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755631483] [2022-04-27 20:30:57,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:30:57,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 20:30:57,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:30:57,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 20:30:57,847 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 20:30:57,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:30:57,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:30:57,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:30:57,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:30:57,848 INFO L87 Difference]: Start difference. First operand 35 states and 58 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 20:30:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:57,962 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. [2022-04-27 20:30:57,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:30:57,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 20:30:57,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:30:57,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 20:30:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-04-27 20:30:57,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 20:30:57,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-04-27 20:30:57,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 81 transitions. [2022-04-27 20:30:58,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:30:58,033 INFO L225 Difference]: With dead ends: 49 [2022-04-27 20:30:58,034 INFO L226 Difference]: Without dead ends: 49 [2022-04-27 20:30:58,035 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 20:30:58,037 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:30:58,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 63 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:30:58,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-27 20:30:58,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-04-27 20:30:58,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:30:58,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 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 20:30:58,046 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 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 20:30:58,048 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 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 20:30:58,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:58,052 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. [2022-04-27 20:30:58,052 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2022-04-27 20:30:58,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:58,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:58,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 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 49 states. [2022-04-27 20:30:58,053 INFO L87 Difference]: Start difference. First operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 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 49 states. [2022-04-27 20:30:58,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:58,055 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. [2022-04-27 20:30:58,055 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2022-04-27 20:30:58,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:58,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:58,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:30:58,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:30:58,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 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 20:30:58,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 78 transitions. [2022-04-27 20:30:58,060 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 78 transitions. Word has length 17 [2022-04-27 20:30:58,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:30:58,060 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 78 transitions. [2022-04-27 20:30:58,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 20:30:58,061 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 78 transitions. [2022-04-27 20:30:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 20:30:58,061 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:30:58,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:30:58,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 20:30:58,062 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:30:58,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:30:58,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1438328994, now seen corresponding path program 1 times [2022-04-27 20:30:58,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:30:58,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064055873] [2022-04-27 20:30:58,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:30:58,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:30:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:58,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:30:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:58,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {444#true} is VALID [2022-04-27 20:30:58,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {444#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {444#true} is VALID [2022-04-27 20:30:58,114 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {444#true} {444#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {444#true} is VALID [2022-04-27 20:30:58,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {444#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:30:58,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {444#true} is VALID [2022-04-27 20:30:58,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {444#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {444#true} is VALID [2022-04-27 20:30:58,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {444#true} {444#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {444#true} is VALID [2022-04-27 20:30:58,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {444#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {444#true} is VALID [2022-04-27 20:30:58,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {444#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {444#true} is VALID [2022-04-27 20:30:58,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {444#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {444#true} is VALID [2022-04-27 20:30:58,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {444#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {444#true} is VALID [2022-04-27 20:30:58,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {444#true} [148] L48-->L48-2: Formula: (and (not (= v_main_~p1~0_3 0)) (= v_main_~lk1~0_5 1)) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3, main_~lk1~0=v_main_~lk1~0_5} AuxVars[] AssignedVars[main_~lk1~0] {449#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:30:58,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {449#(not (= main_~p1~0 0))} [150] L48-2-->L52-1: Formula: (and (= v_main_~lk2~0_6 1) (not (= v_main_~p2~0_4 0))) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_6, main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[main_~lk2~0] {449#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:30:58,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {449#(not (= main_~p1~0 0))} [152] L52-1-->L56-1: Formula: (and (= v_main_~lk3~0_6 1) (not (= v_main_~p3~0_4 0))) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {449#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:30:58,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {449#(not (= main_~p1~0 0))} [154] L56-1-->L60-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {449#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:30:58,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {449#(not (= main_~p1~0 0))} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {449#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:30:58,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {449#(not (= main_~p1~0 0))} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {449#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:30:58,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {449#(not (= main_~p1~0 0))} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {445#false} is VALID [2022-04-27 20:30:58,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {445#false} [164] L74-1-->L80: Formula: (not (= v_main_~p2~0_2 0)) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[] {445#false} is VALID [2022-04-27 20:30:58,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {445#false} [168] L80-->L100-1: Formula: (not (= v_main_~lk2~0_2 1)) InVars {main_~lk2~0=v_main_~lk2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_2} AuxVars[] AssignedVars[] {445#false} is VALID [2022-04-27 20:30:58,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {445#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {445#false} is VALID [2022-04-27 20:30:58,124 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 20:30:58,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:30:58,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064055873] [2022-04-27 20:30:58,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064055873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:30:58,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:30:58,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:30:58,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015023717] [2022-04-27 20:30:58,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:30:58,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-04-27 20:30:58,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:30:58,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 20:30:58,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:30:58,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:30:58,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:30:58,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:30:58,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:30:58,139 INFO L87 Difference]: Start difference. First operand 47 states and 78 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 20:30:58,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:58,241 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2022-04-27 20:30:58,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:30:58,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-04-27 20:30:58,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:30:58,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 20:30:58,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-04-27 20:30:58,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 20:30:58,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-04-27 20:30:58,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 80 transitions. [2022-04-27 20:30:58,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:30:58,300 INFO L225 Difference]: With dead ends: 52 [2022-04-27 20:30:58,300 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 20:30:58,300 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 20:30:58,301 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:30:58,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 73 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:30:58,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 20:30:58,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-04-27 20:30:58,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:30:58,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 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 20:30:58,304 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 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 20:30:58,304 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 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 20:30:58,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:58,306 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2022-04-27 20:30:58,306 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 81 transitions. [2022-04-27 20:30:58,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:58,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:58,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 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 52 states. [2022-04-27 20:30:58,307 INFO L87 Difference]: Start difference. First operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 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 52 states. [2022-04-27 20:30:58,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:58,308 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2022-04-27 20:30:58,308 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 81 transitions. [2022-04-27 20:30:58,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:58,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:58,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:30:58,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:30:58,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 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 20:30:58,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2022-04-27 20:30:58,310 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 18 [2022-04-27 20:30:58,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:30:58,311 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 80 transitions. [2022-04-27 20:30:58,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 20:30:58,311 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 80 transitions. [2022-04-27 20:30:58,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 20:30:58,311 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:30:58,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:30:58,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 20:30:58,312 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:30:58,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:30:58,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1634842499, now seen corresponding path program 1 times [2022-04-27 20:30:58,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:30:58,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239137003] [2022-04-27 20:30:58,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:30:58,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:30:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:58,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:30:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:58,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {668#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {662#true} is VALID [2022-04-27 20:30:58,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {662#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {662#true} is VALID [2022-04-27 20:30:58,355 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {662#true} {662#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {662#true} is VALID [2022-04-27 20:30:58,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {662#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {668#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:30:58,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {668#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {662#true} is VALID [2022-04-27 20:30:58,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {662#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {662#true} is VALID [2022-04-27 20:30:58,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {662#true} {662#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {662#true} is VALID [2022-04-27 20:30:58,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {662#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {662#true} is VALID [2022-04-27 20:30:58,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {662#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {662#true} is VALID [2022-04-27 20:30:58,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {662#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {662#true} is VALID [2022-04-27 20:30:58,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {662#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {662#true} is VALID [2022-04-27 20:30:58,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {662#true} [149] L48-->L48-2: Formula: (= v_main_~p1~0_4 0) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {662#true} is VALID [2022-04-27 20:30:58,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {662#true} [150] L48-2-->L52-1: Formula: (and (= v_main_~lk2~0_6 1) (not (= v_main_~p2~0_4 0))) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_6, main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[main_~lk2~0] {667#(= main_~lk2~0 1)} is VALID [2022-04-27 20:30:58,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {667#(= main_~lk2~0 1)} [152] L52-1-->L56-1: Formula: (and (= v_main_~lk3~0_6 1) (not (= v_main_~p3~0_4 0))) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {667#(= main_~lk2~0 1)} is VALID [2022-04-27 20:30:58,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {667#(= main_~lk2~0 1)} [154] L56-1-->L60-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {667#(= main_~lk2~0 1)} is VALID [2022-04-27 20:30:58,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {667#(= main_~lk2~0 1)} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {667#(= main_~lk2~0 1)} is VALID [2022-04-27 20:30:58,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {667#(= main_~lk2~0 1)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {667#(= main_~lk2~0 1)} is VALID [2022-04-27 20:30:58,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {667#(= main_~lk2~0 1)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {667#(= main_~lk2~0 1)} is VALID [2022-04-27 20:30:58,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {667#(= main_~lk2~0 1)} [164] L74-1-->L80: Formula: (not (= v_main_~p2~0_2 0)) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[] {667#(= main_~lk2~0 1)} is VALID [2022-04-27 20:30:58,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {667#(= main_~lk2~0 1)} [168] L80-->L100-1: Formula: (not (= v_main_~lk2~0_2 1)) InVars {main_~lk2~0=v_main_~lk2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_2} AuxVars[] AssignedVars[] {663#false} is VALID [2022-04-27 20:30:58,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {663#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {663#false} is VALID [2022-04-27 20:30:58,360 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 20:30:58,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:30:58,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239137003] [2022-04-27 20:30:58,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239137003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:30:58,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:30:58,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:30:58,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423885842] [2022-04-27 20:30:58,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:30:58,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-04-27 20:30:58,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:30:58,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 20:30:58,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:30:58,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:30:58,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:30:58,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:30:58,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:30:58,372 INFO L87 Difference]: Start difference. First operand 50 states and 80 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 20:30:58,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:58,472 INFO L93 Difference]: Finished difference Result 87 states and 142 transitions. [2022-04-27 20:30:58,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:30:58,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-04-27 20:30:58,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:30:58,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 20:30:58,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-27 20:30:58,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 20:30:58,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-27 20:30:58,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-27 20:30:58,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:30:58,529 INFO L225 Difference]: With dead ends: 87 [2022-04-27 20:30:58,529 INFO L226 Difference]: Without dead ends: 87 [2022-04-27 20:30:58,529 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 20:30:58,530 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 93 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:30:58,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 53 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:30:58,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-27 20:30:58,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 65. [2022-04-27 20:30:58,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:30:58,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 65 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 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 20:30:58,534 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 65 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 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 20:30:58,535 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 65 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 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 20:30:58,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:58,548 INFO L93 Difference]: Finished difference Result 87 states and 142 transitions. [2022-04-27 20:30:58,548 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 142 transitions. [2022-04-27 20:30:58,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:58,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:58,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 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 87 states. [2022-04-27 20:30:58,549 INFO L87 Difference]: Start difference. First operand has 65 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 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 87 states. [2022-04-27 20:30:58,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:58,552 INFO L93 Difference]: Finished difference Result 87 states and 142 transitions. [2022-04-27 20:30:58,552 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 142 transitions. [2022-04-27 20:30:58,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:58,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:58,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:30:58,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:30:58,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 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 20:30:58,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 105 transitions. [2022-04-27 20:30:58,555 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 105 transitions. Word has length 18 [2022-04-27 20:30:58,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:30:58,555 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 105 transitions. [2022-04-27 20:30:58,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 20:30:58,555 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 105 transitions. [2022-04-27 20:30:58,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 20:30:58,556 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:30:58,556 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:30:58,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 20:30:58,556 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:30:58,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:30:58,557 INFO L85 PathProgramCache]: Analyzing trace with hash 852670334, now seen corresponding path program 1 times [2022-04-27 20:30:58,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:30:58,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153882253] [2022-04-27 20:30:58,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:30:58,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:30:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:58,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:30:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:58,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {1006#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {1000#true} is VALID [2022-04-27 20:30:58,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {1000#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 20:30:58,600 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1000#true} {1000#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 20:30:58,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {1000#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1006#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:30:58,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {1006#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {1000#true} is VALID [2022-04-27 20:30:58,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {1000#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 20:30:58,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1000#true} {1000#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 20:30:58,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {1000#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 20:30:58,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {1000#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {1000#true} is VALID [2022-04-27 20:30:58,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {1000#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {1000#true} is VALID [2022-04-27 20:30:58,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {1000#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {1000#true} is VALID [2022-04-27 20:30:58,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {1000#true} [149] L48-->L48-2: Formula: (= v_main_~p1~0_4 0) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 20:30:58,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {1000#true} [151] L48-2-->L52-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {1005#(= main_~p2~0 0)} is VALID [2022-04-27 20:30:58,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {1005#(= main_~p2~0 0)} [152] L52-1-->L56-1: Formula: (and (= v_main_~lk3~0_6 1) (not (= v_main_~p3~0_4 0))) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {1005#(= main_~p2~0 0)} is VALID [2022-04-27 20:30:58,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {1005#(= main_~p2~0 0)} [154] L56-1-->L60-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {1005#(= main_~p2~0 0)} is VALID [2022-04-27 20:30:58,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {1005#(= main_~p2~0 0)} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {1005#(= main_~p2~0 0)} is VALID [2022-04-27 20:30:58,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {1005#(= main_~p2~0 0)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {1005#(= main_~p2~0 0)} is VALID [2022-04-27 20:30:58,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {1005#(= main_~p2~0 0)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {1005#(= main_~p2~0 0)} is VALID [2022-04-27 20:30:58,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {1005#(= main_~p2~0 0)} [164] L74-1-->L80: Formula: (not (= v_main_~p2~0_2 0)) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[] {1001#false} is VALID [2022-04-27 20:30:58,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {1001#false} [168] L80-->L100-1: Formula: (not (= v_main_~lk2~0_2 1)) InVars {main_~lk2~0=v_main_~lk2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_2} AuxVars[] AssignedVars[] {1001#false} is VALID [2022-04-27 20:30:58,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {1001#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1001#false} is VALID [2022-04-27 20:30:58,605 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 20:30:58,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:30:58,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153882253] [2022-04-27 20:30:58,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153882253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:30:58,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:30:58,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:30:58,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274435287] [2022-04-27 20:30:58,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:30:58,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-04-27 20:30:58,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:30:58,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 20:30:58,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:30:58,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:30:58,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:30:58,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:30:58,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:30:58,617 INFO L87 Difference]: Start difference. First operand 65 states and 105 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 20:30:58,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:58,711 INFO L93 Difference]: Finished difference Result 89 states and 140 transitions. [2022-04-27 20:30:58,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:30:58,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-04-27 20:30:58,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:30:58,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 20:30:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-04-27 20:30:58,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 20:30:58,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-04-27 20:30:58,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 79 transitions. [2022-04-27 20:30:58,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:30:58,765 INFO L225 Difference]: With dead ends: 89 [2022-04-27 20:30:58,765 INFO L226 Difference]: Without dead ends: 89 [2022-04-27 20:30:58,766 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 20:30:58,766 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:30:58,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 65 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:30:58,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-27 20:30:58,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-04-27 20:30:58,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:30:58,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 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 20:30:58,770 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 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 20:30:58,771 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 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 20:30:58,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:58,773 INFO L93 Difference]: Finished difference Result 89 states and 140 transitions. [2022-04-27 20:30:58,773 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 140 transitions. [2022-04-27 20:30:58,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:58,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:58,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 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 89 states. [2022-04-27 20:30:58,774 INFO L87 Difference]: Start difference. First operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 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 89 states. [2022-04-27 20:30:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:58,776 INFO L93 Difference]: Finished difference Result 89 states and 140 transitions. [2022-04-27 20:30:58,776 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 140 transitions. [2022-04-27 20:30:58,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:58,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:58,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:30:58,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:30:58,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 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 20:30:58,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 139 transitions. [2022-04-27 20:30:58,779 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 139 transitions. Word has length 18 [2022-04-27 20:30:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:30:58,779 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 139 transitions. [2022-04-27 20:30:58,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 20:30:58,779 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 139 transitions. [2022-04-27 20:30:58,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 20:30:58,780 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:30:58,780 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:30:58,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 20:30:58,780 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:30:58,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:30:58,780 INFO L85 PathProgramCache]: Analyzing trace with hash 859522148, now seen corresponding path program 1 times [2022-04-27 20:30:58,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:30:58,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620463526] [2022-04-27 20:30:58,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:30:58,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:30:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:58,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:30:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:58,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {1372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {1366#true} is VALID [2022-04-27 20:30:58,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {1366#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1366#true} is VALID [2022-04-27 20:30:58,812 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1366#true} {1366#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1366#true} is VALID [2022-04-27 20:30:58,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {1366#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:30:58,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {1372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {1366#true} is VALID [2022-04-27 20:30:58,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {1366#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1366#true} is VALID [2022-04-27 20:30:58,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1366#true} is VALID [2022-04-27 20:30:58,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {1366#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1366#true} is VALID [2022-04-27 20:30:58,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {1366#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {1366#true} is VALID [2022-04-27 20:30:58,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {1366#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {1366#true} is VALID [2022-04-27 20:30:58,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {1366#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {1366#true} is VALID [2022-04-27 20:30:58,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {1366#true} [149] L48-->L48-2: Formula: (= v_main_~p1~0_4 0) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {1366#true} is VALID [2022-04-27 20:30:58,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {1366#true} [150] L48-2-->L52-1: Formula: (and (= v_main_~lk2~0_6 1) (not (= v_main_~p2~0_4 0))) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_6, main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[main_~lk2~0] {1371#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:30:58,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {1371#(not (= main_~p2~0 0))} [152] L52-1-->L56-1: Formula: (and (= v_main_~lk3~0_6 1) (not (= v_main_~p3~0_4 0))) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {1371#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:30:58,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {1371#(not (= main_~p2~0 0))} [154] L56-1-->L60-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {1371#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:30:58,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {1371#(not (= main_~p2~0 0))} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {1371#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:30:58,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {1371#(not (= main_~p2~0 0))} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {1371#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:30:58,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {1371#(not (= main_~p2~0 0))} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {1371#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:30:58,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {1371#(not (= main_~p2~0 0))} [165] L74-1-->L79-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {1367#false} is VALID [2022-04-27 20:30:58,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {1367#false} [170] L79-1-->L85: Formula: (not (= v_main_~p3~0_2 0)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2} AuxVars[] AssignedVars[] {1367#false} is VALID [2022-04-27 20:30:58,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {1367#false} [172] L85-->L100-1: Formula: (not (= v_main_~lk3~0_3 1)) InVars {main_~lk3~0=v_main_~lk3~0_3} OutVars{main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[] {1367#false} is VALID [2022-04-27 20:30:58,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {1367#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1367#false} is VALID [2022-04-27 20:30:58,817 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 20:30:58,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:30:58,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620463526] [2022-04-27 20:30:58,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620463526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:30:58,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:30:58,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:30:58,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742374236] [2022-04-27 20:30:58,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:30:58,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2022-04-27 20:30:58,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:30:58,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 20:30:58,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:30:58,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:30:58,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:30:58,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:30:58,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:30:58,829 INFO L87 Difference]: Start difference. First operand 87 states and 139 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 20:30:58,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:58,908 INFO L93 Difference]: Finished difference Result 91 states and 140 transitions. [2022-04-27 20:30:58,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:30:58,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2022-04-27 20:30:58,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:30:58,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 20:30:58,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-27 20:30:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 20:30:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-27 20:30:58,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-27 20:30:58,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:30:58,965 INFO L225 Difference]: With dead ends: 91 [2022-04-27 20:30:58,965 INFO L226 Difference]: Without dead ends: 91 [2022-04-27 20:30:58,965 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 20:30:58,966 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 78 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:30:58,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 70 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:30:58,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-27 20:30:58,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2022-04-27 20:30:58,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:30:58,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.6) internal successors, (136), 85 states have internal predecessors, (136), 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 20:30:58,970 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.6) internal successors, (136), 85 states have internal predecessors, (136), 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 20:30:58,970 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.6) internal successors, (136), 85 states have internal predecessors, (136), 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 20:30:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:58,973 INFO L93 Difference]: Finished difference Result 91 states and 140 transitions. [2022-04-27 20:30:58,973 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2022-04-27 20:30:58,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:58,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:58,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 85 states have (on average 1.6) internal successors, (136), 85 states have internal predecessors, (136), 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 91 states. [2022-04-27 20:30:58,973 INFO L87 Difference]: Start difference. First operand has 89 states, 85 states have (on average 1.6) internal successors, (136), 85 states have internal predecessors, (136), 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 91 states. [2022-04-27 20:30:58,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:58,976 INFO L93 Difference]: Finished difference Result 91 states and 140 transitions. [2022-04-27 20:30:58,976 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2022-04-27 20:30:58,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:58,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:58,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:30:58,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:30:58,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 85 states have (on average 1.6) internal successors, (136), 85 states have internal predecessors, (136), 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 20:30:58,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 139 transitions. [2022-04-27 20:30:58,979 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 139 transitions. Word has length 19 [2022-04-27 20:30:58,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:30:58,979 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 139 transitions. [2022-04-27 20:30:58,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 20:30:58,979 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 139 transitions. [2022-04-27 20:30:58,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 20:30:58,980 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:30:58,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:30:58,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 20:30:58,980 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:30:58,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:30:58,981 INFO L85 PathProgramCache]: Analyzing trace with hash 663008643, now seen corresponding path program 1 times [2022-04-27 20:30:58,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:30:58,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76199220] [2022-04-27 20:30:58,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:30:58,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:30:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:59,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:30:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:59,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {1746#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {1740#true} is VALID [2022-04-27 20:30:59,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {1740#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1740#true} is VALID [2022-04-27 20:30:59,013 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1740#true} {1740#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1740#true} is VALID [2022-04-27 20:30:59,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {1740#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1746#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:30:59,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {1746#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {1740#true} is VALID [2022-04-27 20:30:59,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {1740#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1740#true} is VALID [2022-04-27 20:30:59,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1740#true} {1740#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1740#true} is VALID [2022-04-27 20:30:59,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {1740#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1740#true} is VALID [2022-04-27 20:30:59,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {1740#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {1740#true} is VALID [2022-04-27 20:30:59,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {1740#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {1740#true} is VALID [2022-04-27 20:30:59,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {1740#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {1740#true} is VALID [2022-04-27 20:30:59,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {1740#true} [149] L48-->L48-2: Formula: (= v_main_~p1~0_4 0) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {1740#true} is VALID [2022-04-27 20:30:59,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {1740#true} [151] L48-2-->L52-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {1740#true} is VALID [2022-04-27 20:30:59,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {1740#true} [152] L52-1-->L56-1: Formula: (and (= v_main_~lk3~0_6 1) (not (= v_main_~p3~0_4 0))) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {1745#(= main_~lk3~0 1)} is VALID [2022-04-27 20:30:59,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {1745#(= main_~lk3~0 1)} [154] L56-1-->L60-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {1745#(= main_~lk3~0 1)} is VALID [2022-04-27 20:30:59,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {1745#(= main_~lk3~0 1)} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {1745#(= main_~lk3~0 1)} is VALID [2022-04-27 20:30:59,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {1745#(= main_~lk3~0 1)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {1745#(= main_~lk3~0 1)} is VALID [2022-04-27 20:30:59,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {1745#(= main_~lk3~0 1)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {1745#(= main_~lk3~0 1)} is VALID [2022-04-27 20:30:59,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {1745#(= main_~lk3~0 1)} [165] L74-1-->L79-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {1745#(= main_~lk3~0 1)} is VALID [2022-04-27 20:30:59,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {1745#(= main_~lk3~0 1)} [170] L79-1-->L85: Formula: (not (= v_main_~p3~0_2 0)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2} AuxVars[] AssignedVars[] {1745#(= main_~lk3~0 1)} is VALID [2022-04-27 20:30:59,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {1745#(= main_~lk3~0 1)} [172] L85-->L100-1: Formula: (not (= v_main_~lk3~0_3 1)) InVars {main_~lk3~0=v_main_~lk3~0_3} OutVars{main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[] {1741#false} is VALID [2022-04-27 20:30:59,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {1741#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1741#false} is VALID [2022-04-27 20:30:59,021 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 20:30:59,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:30:59,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76199220] [2022-04-27 20:30:59,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76199220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:30:59,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:30:59,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:30:59,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266934089] [2022-04-27 20:30:59,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:30:59,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2022-04-27 20:30:59,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:30:59,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 20:30:59,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:30:59,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:30:59,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:30:59,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:30:59,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:30:59,037 INFO L87 Difference]: Start difference. First operand 89 states and 139 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 20:30:59,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:59,117 INFO L93 Difference]: Finished difference Result 155 states and 244 transitions. [2022-04-27 20:30:59,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:30:59,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2022-04-27 20:30:59,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:30:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 20:30:59,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-04-27 20:30:59,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 20:30:59,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-04-27 20:30:59,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 74 transitions. [2022-04-27 20:30:59,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:30:59,165 INFO L225 Difference]: With dead ends: 155 [2022-04-27 20:30:59,165 INFO L226 Difference]: Without dead ends: 155 [2022-04-27 20:30:59,165 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 20:30:59,166 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 86 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:30:59,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 52 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:30:59,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-27 20:30:59,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 121. [2022-04-27 20:30:59,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:30:59,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 121 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 117 states have internal predecessors, (184), 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 20:30:59,170 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 121 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 117 states have internal predecessors, (184), 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 20:30:59,171 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 121 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 117 states have internal predecessors, (184), 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 20:30:59,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:59,173 INFO L93 Difference]: Finished difference Result 155 states and 244 transitions. [2022-04-27 20:30:59,173 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 244 transitions. [2022-04-27 20:30:59,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:59,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:59,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 117 states have internal predecessors, (184), 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 155 states. [2022-04-27 20:30:59,174 INFO L87 Difference]: Start difference. First operand has 121 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 117 states have internal predecessors, (184), 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 155 states. [2022-04-27 20:30:59,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:59,177 INFO L93 Difference]: Finished difference Result 155 states and 244 transitions. [2022-04-27 20:30:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 244 transitions. [2022-04-27 20:30:59,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:59,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:59,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:30:59,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:30:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 117 states have internal predecessors, (184), 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 20:30:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 187 transitions. [2022-04-27 20:30:59,180 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 187 transitions. Word has length 19 [2022-04-27 20:30:59,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:30:59,180 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 187 transitions. [2022-04-27 20:30:59,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 20:30:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 187 transitions. [2022-04-27 20:30:59,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 20:30:59,181 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:30:59,181 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:30:59,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 20:30:59,181 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:30:59,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:30:59,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1144445820, now seen corresponding path program 1 times [2022-04-27 20:30:59,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:30:59,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84530543] [2022-04-27 20:30:59,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:30:59,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:30:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:59,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:30:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:59,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {2344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {2338#true} is VALID [2022-04-27 20:30:59,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {2338#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2338#true} is VALID [2022-04-27 20:30:59,233 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2338#true} {2338#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2338#true} is VALID [2022-04-27 20:30:59,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {2338#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:30:59,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {2344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {2338#true} is VALID [2022-04-27 20:30:59,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {2338#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2338#true} is VALID [2022-04-27 20:30:59,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2338#true} {2338#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2338#true} is VALID [2022-04-27 20:30:59,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {2338#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2338#true} is VALID [2022-04-27 20:30:59,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {2338#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {2338#true} is VALID [2022-04-27 20:30:59,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {2338#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {2338#true} is VALID [2022-04-27 20:30:59,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {2338#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {2338#true} is VALID [2022-04-27 20:30:59,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {2338#true} [149] L48-->L48-2: Formula: (= v_main_~p1~0_4 0) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {2338#true} is VALID [2022-04-27 20:30:59,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {2338#true} [151] L48-2-->L52-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {2338#true} is VALID [2022-04-27 20:30:59,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {2338#true} [153] L52-1-->L56-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {2343#(= main_~p3~0 0)} is VALID [2022-04-27 20:30:59,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {2343#(= main_~p3~0 0)} [154] L56-1-->L60-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {2343#(= main_~p3~0 0)} is VALID [2022-04-27 20:30:59,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {2343#(= main_~p3~0 0)} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {2343#(= main_~p3~0 0)} is VALID [2022-04-27 20:30:59,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {2343#(= main_~p3~0 0)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {2343#(= main_~p3~0 0)} is VALID [2022-04-27 20:30:59,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {2343#(= main_~p3~0 0)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {2343#(= main_~p3~0 0)} is VALID [2022-04-27 20:30:59,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {2343#(= main_~p3~0 0)} [165] L74-1-->L79-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {2343#(= main_~p3~0 0)} is VALID [2022-04-27 20:30:59,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {2343#(= main_~p3~0 0)} [170] L79-1-->L85: Formula: (not (= v_main_~p3~0_2 0)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2} AuxVars[] AssignedVars[] {2339#false} is VALID [2022-04-27 20:30:59,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {2339#false} [172] L85-->L100-1: Formula: (not (= v_main_~lk3~0_3 1)) InVars {main_~lk3~0=v_main_~lk3~0_3} OutVars{main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[] {2339#false} is VALID [2022-04-27 20:30:59,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {2339#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2339#false} is VALID [2022-04-27 20:30:59,238 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 20:30:59,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:30:59,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84530543] [2022-04-27 20:30:59,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84530543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:30:59,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:30:59,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:30:59,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938018732] [2022-04-27 20:30:59,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:30:59,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2022-04-27 20:30:59,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:30:59,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 20:30:59,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:30:59,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:30:59,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:30:59,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:30:59,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:30:59,249 INFO L87 Difference]: Start difference. First operand 121 states and 187 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 20:30:59,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:59,331 INFO L93 Difference]: Finished difference Result 163 states and 244 transitions. [2022-04-27 20:30:59,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:30:59,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2022-04-27 20:30:59,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:30:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 20:30:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-04-27 20:30:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 20:30:59,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-04-27 20:30:59,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2022-04-27 20:30:59,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:30:59,384 INFO L225 Difference]: With dead ends: 163 [2022-04-27 20:30:59,384 INFO L226 Difference]: Without dead ends: 163 [2022-04-27 20:30:59,384 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 20:30:59,385 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:30:59,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 67 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:30:59,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-27 20:30:59,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2022-04-27 20:30:59,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:30:59,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 161 states, 157 states have (on average 1.5286624203821657) internal successors, (240), 157 states have internal predecessors, (240), 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 20:30:59,389 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 161 states, 157 states have (on average 1.5286624203821657) internal successors, (240), 157 states have internal predecessors, (240), 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 20:30:59,389 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 161 states, 157 states have (on average 1.5286624203821657) internal successors, (240), 157 states have internal predecessors, (240), 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 20:30:59,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:59,392 INFO L93 Difference]: Finished difference Result 163 states and 244 transitions. [2022-04-27 20:30:59,392 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2022-04-27 20:30:59,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:59,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:59,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 157 states have (on average 1.5286624203821657) internal successors, (240), 157 states have internal predecessors, (240), 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 163 states. [2022-04-27 20:30:59,393 INFO L87 Difference]: Start difference. First operand has 161 states, 157 states have (on average 1.5286624203821657) internal successors, (240), 157 states have internal predecessors, (240), 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 163 states. [2022-04-27 20:30:59,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:59,396 INFO L93 Difference]: Finished difference Result 163 states and 244 transitions. [2022-04-27 20:30:59,396 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2022-04-27 20:30:59,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:59,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:59,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:30:59,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:30:59,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 157 states have (on average 1.5286624203821657) internal successors, (240), 157 states have internal predecessors, (240), 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 20:30:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 243 transitions. [2022-04-27 20:30:59,399 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 243 transitions. Word has length 19 [2022-04-27 20:30:59,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:30:59,399 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 243 transitions. [2022-04-27 20:30:59,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 20:30:59,399 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 243 transitions. [2022-04-27 20:30:59,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 20:30:59,400 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:30:59,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:30:59,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 20:30:59,400 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:30:59,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:30:59,400 INFO L85 PathProgramCache]: Analyzing trace with hash -921536358, now seen corresponding path program 1 times [2022-04-27 20:30:59,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:30:59,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086693208] [2022-04-27 20:30:59,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:30:59,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:30:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:59,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:30:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:59,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {3006#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {3000#true} is VALID [2022-04-27 20:30:59,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {3000#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3000#true} is VALID [2022-04-27 20:30:59,431 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3000#true} {3000#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3000#true} is VALID [2022-04-27 20:30:59,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {3000#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3006#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:30:59,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {3006#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {3000#true} is VALID [2022-04-27 20:30:59,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {3000#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3000#true} is VALID [2022-04-27 20:30:59,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3000#true} {3000#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3000#true} is VALID [2022-04-27 20:30:59,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {3000#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3000#true} is VALID [2022-04-27 20:30:59,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {3000#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {3000#true} is VALID [2022-04-27 20:30:59,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {3000#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {3000#true} is VALID [2022-04-27 20:30:59,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {3000#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {3000#true} is VALID [2022-04-27 20:30:59,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {3000#true} [149] L48-->L48-2: Formula: (= v_main_~p1~0_4 0) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {3000#true} is VALID [2022-04-27 20:30:59,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {3000#true} [151] L48-2-->L52-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {3000#true} is VALID [2022-04-27 20:30:59,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {3000#true} [152] L52-1-->L56-1: Formula: (and (= v_main_~lk3~0_6 1) (not (= v_main_~p3~0_4 0))) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {3005#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:30:59,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {3005#(not (= main_~p3~0 0))} [154] L56-1-->L60-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {3005#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:30:59,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {3005#(not (= main_~p3~0 0))} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {3005#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:30:59,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {3005#(not (= main_~p3~0 0))} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {3005#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:30:59,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {3005#(not (= main_~p3~0 0))} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {3005#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:30:59,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {3005#(not (= main_~p3~0 0))} [165] L74-1-->L79-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {3005#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:30:59,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {3005#(not (= main_~p3~0 0))} [171] L79-1-->L84-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {3001#false} is VALID [2022-04-27 20:30:59,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {3001#false} [174] L84-1-->L90: Formula: (not (= v_main_~p4~0_2 0)) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2} AuxVars[] AssignedVars[] {3001#false} is VALID [2022-04-27 20:30:59,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {3001#false} [176] L90-->L100-1: Formula: (not (= v_main_~lk4~0_3 1)) InVars {main_~lk4~0=v_main_~lk4~0_3} OutVars{main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[] {3001#false} is VALID [2022-04-27 20:30:59,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {3001#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3001#false} is VALID [2022-04-27 20:30:59,435 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 20:30:59,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:30:59,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086693208] [2022-04-27 20:30:59,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086693208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:30:59,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:30:59,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:30:59,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67490639] [2022-04-27 20:30:59,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:30:59,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-04-27 20:30:59,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:30:59,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20:30:59,446 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 20:30:59,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:30:59,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:30:59,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:30:59,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:30:59,446 INFO L87 Difference]: Start difference. First operand 161 states and 243 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20:30:59,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:59,524 INFO L93 Difference]: Finished difference Result 167 states and 244 transitions. [2022-04-27 20:30:59,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:30:59,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-04-27 20:30:59,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:30:59,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20:30:59,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-04-27 20:30:59,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20:30:59,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-04-27 20:30:59,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 76 transitions. [2022-04-27 20:30:59,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:30:59,571 INFO L225 Difference]: With dead ends: 167 [2022-04-27 20:30:59,572 INFO L226 Difference]: Without dead ends: 167 [2022-04-27 20:30:59,572 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 20:30:59,573 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 77 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:30:59,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 67 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:30:59,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-27 20:30:59,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2022-04-27 20:30:59,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:30:59,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 165 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 161 states have internal predecessors, (240), 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 20:30:59,587 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 165 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 161 states have internal predecessors, (240), 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 20:30:59,588 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 165 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 161 states have internal predecessors, (240), 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 20:30:59,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:59,591 INFO L93 Difference]: Finished difference Result 167 states and 244 transitions. [2022-04-27 20:30:59,591 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 244 transitions. [2022-04-27 20:30:59,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:59,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:59,591 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 161 states have internal predecessors, (240), 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 167 states. [2022-04-27 20:30:59,592 INFO L87 Difference]: Start difference. First operand has 165 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 161 states have internal predecessors, (240), 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 167 states. [2022-04-27 20:30:59,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:59,594 INFO L93 Difference]: Finished difference Result 167 states and 244 transitions. [2022-04-27 20:30:59,594 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 244 transitions. [2022-04-27 20:30:59,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:59,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:59,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:30:59,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:30:59,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 161 states have internal predecessors, (240), 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 20:30:59,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2022-04-27 20:30:59,597 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 20 [2022-04-27 20:30:59,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:30:59,597 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2022-04-27 20:30:59,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20:30:59,597 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2022-04-27 20:30:59,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 20:30:59,598 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:30:59,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:30:59,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 20:30:59,598 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:30:59,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:30:59,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1118049863, now seen corresponding path program 1 times [2022-04-27 20:30:59,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:30:59,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708736128] [2022-04-27 20:30:59,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:30:59,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:30:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:59,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:30:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:59,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {3684#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {3678#true} is VALID [2022-04-27 20:30:59,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {3678#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3678#true} is VALID [2022-04-27 20:30:59,628 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3678#true} {3678#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3678#true} is VALID [2022-04-27 20:30:59,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {3678#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3684#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:30:59,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {3684#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {3678#true} is VALID [2022-04-27 20:30:59,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {3678#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3678#true} is VALID [2022-04-27 20:30:59,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3678#true} {3678#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3678#true} is VALID [2022-04-27 20:30:59,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {3678#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3678#true} is VALID [2022-04-27 20:30:59,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {3678#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {3678#true} is VALID [2022-04-27 20:30:59,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {3678#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {3678#true} is VALID [2022-04-27 20:30:59,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {3678#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {3678#true} is VALID [2022-04-27 20:30:59,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {3678#true} [149] L48-->L48-2: Formula: (= v_main_~p1~0_4 0) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {3678#true} is VALID [2022-04-27 20:30:59,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {3678#true} [151] L48-2-->L52-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {3678#true} is VALID [2022-04-27 20:30:59,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {3678#true} [153] L52-1-->L56-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {3678#true} is VALID [2022-04-27 20:30:59,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {3678#true} [154] L56-1-->L60-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {3683#(= main_~lk4~0 1)} is VALID [2022-04-27 20:30:59,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {3683#(= main_~lk4~0 1)} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {3683#(= main_~lk4~0 1)} is VALID [2022-04-27 20:30:59,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {3683#(= main_~lk4~0 1)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {3683#(= main_~lk4~0 1)} is VALID [2022-04-27 20:30:59,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {3683#(= main_~lk4~0 1)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {3683#(= main_~lk4~0 1)} is VALID [2022-04-27 20:30:59,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {3683#(= main_~lk4~0 1)} [165] L74-1-->L79-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {3683#(= main_~lk4~0 1)} is VALID [2022-04-27 20:30:59,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {3683#(= main_~lk4~0 1)} [171] L79-1-->L84-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {3683#(= main_~lk4~0 1)} is VALID [2022-04-27 20:30:59,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {3683#(= main_~lk4~0 1)} [174] L84-1-->L90: Formula: (not (= v_main_~p4~0_2 0)) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2} AuxVars[] AssignedVars[] {3683#(= main_~lk4~0 1)} is VALID [2022-04-27 20:30:59,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {3683#(= main_~lk4~0 1)} [176] L90-->L100-1: Formula: (not (= v_main_~lk4~0_3 1)) InVars {main_~lk4~0=v_main_~lk4~0_3} OutVars{main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[] {3679#false} is VALID [2022-04-27 20:30:59,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {3679#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3679#false} is VALID [2022-04-27 20:30:59,632 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 20:30:59,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:30:59,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708736128] [2022-04-27 20:30:59,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708736128] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:30:59,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:30:59,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:30:59,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027482869] [2022-04-27 20:30:59,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:30:59,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-04-27 20:30:59,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:30:59,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20:30:59,643 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 20:30:59,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:30:59,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:30:59,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:30:59,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:30:59,643 INFO L87 Difference]: Start difference. First operand 165 states and 243 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20:30:59,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:59,720 INFO L93 Difference]: Finished difference Result 283 states and 416 transitions. [2022-04-27 20:30:59,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:30:59,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-04-27 20:30:59,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:30:59,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20:30:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-27 20:30:59,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20:30:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-27 20:30:59,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2022-04-27 20:30:59,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:30:59,766 INFO L225 Difference]: With dead ends: 283 [2022-04-27 20:30:59,766 INFO L226 Difference]: Without dead ends: 283 [2022-04-27 20:30:59,766 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 20:30:59,767 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:30:59,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 51 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:30:59,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-04-27 20:30:59,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 233. [2022-04-27 20:30:59,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:30:59,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand has 233 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 229 states have internal predecessors, (332), 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 20:30:59,772 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand has 233 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 229 states have internal predecessors, (332), 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 20:30:59,773 INFO L87 Difference]: Start difference. First operand 283 states. Second operand has 233 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 229 states have internal predecessors, (332), 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 20:30:59,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:59,778 INFO L93 Difference]: Finished difference Result 283 states and 416 transitions. [2022-04-27 20:30:59,778 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 416 transitions. [2022-04-27 20:30:59,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:59,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:59,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 229 states have internal predecessors, (332), 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 283 states. [2022-04-27 20:30:59,779 INFO L87 Difference]: Start difference. First operand has 233 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 229 states have internal predecessors, (332), 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 283 states. [2022-04-27 20:30:59,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:59,783 INFO L93 Difference]: Finished difference Result 283 states and 416 transitions. [2022-04-27 20:30:59,784 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 416 transitions. [2022-04-27 20:30:59,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:59,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:59,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:30:59,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:30:59,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 229 states have internal predecessors, (332), 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 20:30:59,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 335 transitions. [2022-04-27 20:30:59,788 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 335 transitions. Word has length 20 [2022-04-27 20:30:59,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:30:59,788 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 335 transitions. [2022-04-27 20:30:59,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20:30:59,788 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 335 transitions. [2022-04-27 20:30:59,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 20:30:59,788 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:30:59,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:30:59,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 20:30:59,789 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:30:59,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:30:59,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1369462970, now seen corresponding path program 1 times [2022-04-27 20:30:59,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:30:59,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035573541] [2022-04-27 20:30:59,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:30:59,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:30:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:59,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:30:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:59,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {4778#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {4772#true} is VALID [2022-04-27 20:30:59,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {4772#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4772#true} is VALID [2022-04-27 20:30:59,844 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4772#true} {4772#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4772#true} is VALID [2022-04-27 20:30:59,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {4772#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4778#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:30:59,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {4778#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {4772#true} is VALID [2022-04-27 20:30:59,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {4772#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4772#true} is VALID [2022-04-27 20:30:59,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4772#true} {4772#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4772#true} is VALID [2022-04-27 20:30:59,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {4772#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4772#true} is VALID [2022-04-27 20:30:59,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {4772#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {4772#true} is VALID [2022-04-27 20:30:59,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {4772#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {4772#true} is VALID [2022-04-27 20:30:59,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {4772#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {4772#true} is VALID [2022-04-27 20:30:59,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {4772#true} [149] L48-->L48-2: Formula: (= v_main_~p1~0_4 0) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {4772#true} is VALID [2022-04-27 20:30:59,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {4772#true} [151] L48-2-->L52-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {4772#true} is VALID [2022-04-27 20:30:59,846 INFO L290 TraceCheckUtils]: 10: Hoare triple {4772#true} [153] L52-1-->L56-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {4772#true} is VALID [2022-04-27 20:30:59,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {4772#true} [155] L56-1-->L60-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {4777#(= main_~p4~0 0)} is VALID [2022-04-27 20:30:59,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {4777#(= main_~p4~0 0)} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {4777#(= main_~p4~0 0)} is VALID [2022-04-27 20:30:59,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {4777#(= main_~p4~0 0)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {4777#(= main_~p4~0 0)} is VALID [2022-04-27 20:30:59,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {4777#(= main_~p4~0 0)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {4777#(= main_~p4~0 0)} is VALID [2022-04-27 20:30:59,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {4777#(= main_~p4~0 0)} [165] L74-1-->L79-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {4777#(= main_~p4~0 0)} is VALID [2022-04-27 20:30:59,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {4777#(= main_~p4~0 0)} [171] L79-1-->L84-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {4777#(= main_~p4~0 0)} is VALID [2022-04-27 20:30:59,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {4777#(= main_~p4~0 0)} [174] L84-1-->L90: Formula: (not (= v_main_~p4~0_2 0)) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2} AuxVars[] AssignedVars[] {4773#false} is VALID [2022-04-27 20:30:59,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {4773#false} [176] L90-->L100-1: Formula: (not (= v_main_~lk4~0_3 1)) InVars {main_~lk4~0=v_main_~lk4~0_3} OutVars{main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[] {4773#false} is VALID [2022-04-27 20:30:59,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {4773#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4773#false} is VALID [2022-04-27 20:30:59,850 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 20:30:59,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:30:59,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035573541] [2022-04-27 20:30:59,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035573541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:30:59,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:30:59,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:30:59,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921591787] [2022-04-27 20:30:59,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:30:59,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-04-27 20:30:59,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:30:59,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20:30:59,860 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 20:30:59,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:30:59,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:30:59,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:30:59,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:30:59,861 INFO L87 Difference]: Start difference. First operand 233 states and 335 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20:30:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:59,941 INFO L93 Difference]: Finished difference Result 307 states and 424 transitions. [2022-04-27 20:30:59,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:30:59,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-04-27 20:30:59,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:30:59,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20:30:59,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-27 20:30:59,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20:30:59,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-27 20:30:59,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 75 transitions. [2022-04-27 20:30:59,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:30:59,994 INFO L225 Difference]: With dead ends: 307 [2022-04-27 20:30:59,994 INFO L226 Difference]: Without dead ends: 307 [2022-04-27 20:30:59,994 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 20:30:59,994 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 70 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:30:59,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 69 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:30:59,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-27 20:30:59,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2022-04-27 20:30:59,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:30:59,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.3953488372093024) internal successors, (420), 301 states have internal predecessors, (420), 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 20:30:59,999 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.3953488372093024) internal successors, (420), 301 states have internal predecessors, (420), 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 20:31:00,000 INFO L87 Difference]: Start difference. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.3953488372093024) internal successors, (420), 301 states have internal predecessors, (420), 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 20:31:00,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:00,006 INFO L93 Difference]: Finished difference Result 307 states and 424 transitions. [2022-04-27 20:31:00,006 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 424 transitions. [2022-04-27 20:31:00,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:00,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:00,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 305 states, 301 states have (on average 1.3953488372093024) internal successors, (420), 301 states have internal predecessors, (420), 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 307 states. [2022-04-27 20:31:00,007 INFO L87 Difference]: Start difference. First operand has 305 states, 301 states have (on average 1.3953488372093024) internal successors, (420), 301 states have internal predecessors, (420), 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 307 states. [2022-04-27 20:31:00,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:00,012 INFO L93 Difference]: Finished difference Result 307 states and 424 transitions. [2022-04-27 20:31:00,012 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 424 transitions. [2022-04-27 20:31:00,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:00,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:00,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:00,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:00,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 301 states have (on average 1.3953488372093024) internal successors, (420), 301 states have internal predecessors, (420), 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 20:31:00,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 423 transitions. [2022-04-27 20:31:00,017 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 423 transitions. Word has length 20 [2022-04-27 20:31:00,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:00,018 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 423 transitions. [2022-04-27 20:31:00,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20:31:00,018 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 423 transitions. [2022-04-27 20:31:00,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 20:31:00,019 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:00,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:31:00,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 20:31:00,019 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:00,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:00,020 INFO L85 PathProgramCache]: Analyzing trace with hash -299775072, now seen corresponding path program 1 times [2022-04-27 20:31:00,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:00,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815896242] [2022-04-27 20:31:00,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:00,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:00,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:00,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {6016#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {6010#true} is VALID [2022-04-27 20:31:00,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {6010#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6010#true} is VALID [2022-04-27 20:31:00,053 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6010#true} {6010#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6010#true} is VALID [2022-04-27 20:31:00,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {6010#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6016#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:00,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {6016#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {6010#true} is VALID [2022-04-27 20:31:00,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {6010#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6010#true} is VALID [2022-04-27 20:31:00,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6010#true} {6010#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6010#true} is VALID [2022-04-27 20:31:00,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {6010#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6010#true} is VALID [2022-04-27 20:31:00,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {6010#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {6010#true} is VALID [2022-04-27 20:31:00,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {6010#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {6010#true} is VALID [2022-04-27 20:31:00,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {6010#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {6010#true} is VALID [2022-04-27 20:31:00,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {6010#true} [149] L48-->L48-2: Formula: (= v_main_~p1~0_4 0) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {6010#true} is VALID [2022-04-27 20:31:00,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {6010#true} [151] L48-2-->L52-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {6010#true} is VALID [2022-04-27 20:31:00,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {6010#true} [153] L52-1-->L56-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {6010#true} is VALID [2022-04-27 20:31:00,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {6010#true} [154] L56-1-->L60-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {6015#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:31:00,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {6015#(not (= main_~p4~0 0))} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {6015#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:31:00,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {6015#(not (= main_~p4~0 0))} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {6015#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:31:00,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {6015#(not (= main_~p4~0 0))} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {6015#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:31:00,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {6015#(not (= main_~p4~0 0))} [165] L74-1-->L79-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {6015#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:31:00,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {6015#(not (= main_~p4~0 0))} [171] L79-1-->L84-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {6015#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:31:00,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {6015#(not (= main_~p4~0 0))} [175] L84-1-->L89-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {6011#false} is VALID [2022-04-27 20:31:00,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {6011#false} [178] L89-1-->L95: Formula: (not (= v_main_~p5~0_2 0)) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2} AuxVars[] AssignedVars[] {6011#false} is VALID [2022-04-27 20:31:00,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {6011#false} [180] L95-->L100-1: Formula: (not (= v_main_~lk5~0_3 1)) InVars {main_~lk5~0=v_main_~lk5~0_3} OutVars{main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[] {6011#false} is VALID [2022-04-27 20:31:00,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {6011#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6011#false} is VALID [2022-04-27 20:31:00,065 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 20:31:00,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:00,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815896242] [2022-04-27 20:31:00,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815896242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:00,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:00,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:00,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844914027] [2022-04-27 20:31:00,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:00,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2022-04-27 20:31:00,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:00,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 20:31:00,075 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 20:31:00,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:00,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:00,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:00,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:00,076 INFO L87 Difference]: Start difference. First operand 305 states and 423 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 20:31:00,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:00,151 INFO L93 Difference]: Finished difference Result 315 states and 424 transitions. [2022-04-27 20:31:00,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:00,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2022-04-27 20:31:00,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:00,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 20:31:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-04-27 20:31:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 20:31:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-04-27 20:31:00,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 74 transitions. [2022-04-27 20:31:00,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:00,201 INFO L225 Difference]: With dead ends: 315 [2022-04-27 20:31:00,201 INFO L226 Difference]: Without dead ends: 315 [2022-04-27 20:31:00,201 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 20:31:00,201 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:00,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 64 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:00,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-04-27 20:31:00,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2022-04-27 20:31:00,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:00,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 315 states. Second operand has 313 states, 309 states have (on average 1.3592233009708738) internal successors, (420), 309 states have internal predecessors, (420), 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 20:31:00,206 INFO L74 IsIncluded]: Start isIncluded. First operand 315 states. Second operand has 313 states, 309 states have (on average 1.3592233009708738) internal successors, (420), 309 states have internal predecessors, (420), 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 20:31:00,206 INFO L87 Difference]: Start difference. First operand 315 states. Second operand has 313 states, 309 states have (on average 1.3592233009708738) internal successors, (420), 309 states have internal predecessors, (420), 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 20:31:00,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:00,211 INFO L93 Difference]: Finished difference Result 315 states and 424 transitions. [2022-04-27 20:31:00,211 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 424 transitions. [2022-04-27 20:31:00,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:00,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:00,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 313 states, 309 states have (on average 1.3592233009708738) internal successors, (420), 309 states have internal predecessors, (420), 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 315 states. [2022-04-27 20:31:00,212 INFO L87 Difference]: Start difference. First operand has 313 states, 309 states have (on average 1.3592233009708738) internal successors, (420), 309 states have internal predecessors, (420), 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 315 states. [2022-04-27 20:31:00,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:00,217 INFO L93 Difference]: Finished difference Result 315 states and 424 transitions. [2022-04-27 20:31:00,217 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 424 transitions. [2022-04-27 20:31:00,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:00,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:00,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:00,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:00,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 309 states have (on average 1.3592233009708738) internal successors, (420), 309 states have internal predecessors, (420), 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 20:31:00,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 423 transitions. [2022-04-27 20:31:00,222 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 423 transitions. Word has length 21 [2022-04-27 20:31:00,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:00,222 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 423 transitions. [2022-04-27 20:31:00,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 20:31:00,222 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 423 transitions. [2022-04-27 20:31:00,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 20:31:00,223 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:00,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:31:00,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 20:31:00,223 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:00,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:00,223 INFO L85 PathProgramCache]: Analyzing trace with hash -496288577, now seen corresponding path program 1 times [2022-04-27 20:31:00,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:00,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841356939] [2022-04-27 20:31:00,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:00,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:00,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:00,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {7286#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {7280#true} is VALID [2022-04-27 20:31:00,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {7280#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7280#true} is VALID [2022-04-27 20:31:00,246 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7280#true} {7280#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7280#true} is VALID [2022-04-27 20:31:00,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {7280#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7286#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:00,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {7286#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {7280#true} is VALID [2022-04-27 20:31:00,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {7280#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7280#true} is VALID [2022-04-27 20:31:00,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7280#true} {7280#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7280#true} is VALID [2022-04-27 20:31:00,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {7280#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7280#true} is VALID [2022-04-27 20:31:00,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {7280#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {7280#true} is VALID [2022-04-27 20:31:00,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {7280#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {7280#true} is VALID [2022-04-27 20:31:00,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {7280#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {7280#true} is VALID [2022-04-27 20:31:00,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {7280#true} [149] L48-->L48-2: Formula: (= v_main_~p1~0_4 0) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {7280#true} is VALID [2022-04-27 20:31:00,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {7280#true} [151] L48-2-->L52-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {7280#true} is VALID [2022-04-27 20:31:00,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {7280#true} [153] L52-1-->L56-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {7280#true} is VALID [2022-04-27 20:31:00,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {7280#true} [155] L56-1-->L60-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {7280#true} is VALID [2022-04-27 20:31:00,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {7280#true} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {7285#(= main_~lk5~0 1)} is VALID [2022-04-27 20:31:00,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {7285#(= main_~lk5~0 1)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {7285#(= main_~lk5~0 1)} is VALID [2022-04-27 20:31:00,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {7285#(= main_~lk5~0 1)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {7285#(= main_~lk5~0 1)} is VALID [2022-04-27 20:31:00,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {7285#(= main_~lk5~0 1)} [165] L74-1-->L79-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {7285#(= main_~lk5~0 1)} is VALID [2022-04-27 20:31:00,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {7285#(= main_~lk5~0 1)} [171] L79-1-->L84-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {7285#(= main_~lk5~0 1)} is VALID [2022-04-27 20:31:00,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {7285#(= main_~lk5~0 1)} [175] L84-1-->L89-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {7285#(= main_~lk5~0 1)} is VALID [2022-04-27 20:31:00,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {7285#(= main_~lk5~0 1)} [178] L89-1-->L95: Formula: (not (= v_main_~p5~0_2 0)) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2} AuxVars[] AssignedVars[] {7285#(= main_~lk5~0 1)} is VALID [2022-04-27 20:31:00,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {7285#(= main_~lk5~0 1)} [180] L95-->L100-1: Formula: (not (= v_main_~lk5~0_3 1)) InVars {main_~lk5~0=v_main_~lk5~0_3} OutVars{main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[] {7281#false} is VALID [2022-04-27 20:31:00,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {7281#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7281#false} is VALID [2022-04-27 20:31:00,250 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 20:31:00,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:00,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841356939] [2022-04-27 20:31:00,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841356939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:00,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:00,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:00,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075416011] [2022-04-27 20:31:00,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:00,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2022-04-27 20:31:00,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:00,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 20:31:00,261 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 20:31:00,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:00,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:00,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:00,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:00,262 INFO L87 Difference]: Start difference. First operand 313 states and 423 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 20:31:00,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:00,341 INFO L93 Difference]: Finished difference Result 523 states and 696 transitions. [2022-04-27 20:31:00,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:00,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2022-04-27 20:31:00,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:00,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 20:31:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-04-27 20:31:00,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 20:31:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-04-27 20:31:00,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 66 transitions. [2022-04-27 20:31:00,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:00,388 INFO L225 Difference]: With dead ends: 523 [2022-04-27 20:31:00,388 INFO L226 Difference]: Without dead ends: 523 [2022-04-27 20:31:00,388 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 20:31:00,388 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 72 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:00,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 50 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:00,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-04-27 20:31:00,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 457. [2022-04-27 20:31:00,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:00,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 523 states. Second operand has 457 states, 453 states have (on average 1.315673289183223) internal successors, (596), 453 states have internal predecessors, (596), 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 20:31:00,395 INFO L74 IsIncluded]: Start isIncluded. First operand 523 states. Second operand has 457 states, 453 states have (on average 1.315673289183223) internal successors, (596), 453 states have internal predecessors, (596), 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 20:31:00,395 INFO L87 Difference]: Start difference. First operand 523 states. Second operand has 457 states, 453 states have (on average 1.315673289183223) internal successors, (596), 453 states have internal predecessors, (596), 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 20:31:00,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:00,405 INFO L93 Difference]: Finished difference Result 523 states and 696 transitions. [2022-04-27 20:31:00,405 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 696 transitions. [2022-04-27 20:31:00,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:00,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:00,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 457 states, 453 states have (on average 1.315673289183223) internal successors, (596), 453 states have internal predecessors, (596), 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 523 states. [2022-04-27 20:31:00,407 INFO L87 Difference]: Start difference. First operand has 457 states, 453 states have (on average 1.315673289183223) internal successors, (596), 453 states have internal predecessors, (596), 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 523 states. [2022-04-27 20:31:00,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:00,418 INFO L93 Difference]: Finished difference Result 523 states and 696 transitions. [2022-04-27 20:31:00,418 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 696 transitions. [2022-04-27 20:31:00,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:00,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:00,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:00,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:00,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.315673289183223) internal successors, (596), 453 states have internal predecessors, (596), 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 20:31:00,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 599 transitions. [2022-04-27 20:31:00,427 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 599 transitions. Word has length 21 [2022-04-27 20:31:00,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:00,427 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 599 transitions. [2022-04-27 20:31:00,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 20:31:00,427 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 599 transitions. [2022-04-27 20:31:00,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 20:31:00,428 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:00,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:31:00,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 20:31:00,428 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:00,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:00,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1991224256, now seen corresponding path program 1 times [2022-04-27 20:31:00,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:00,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104295449] [2022-04-27 20:31:00,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:00,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:00,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:00,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {9324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {9318#true} is VALID [2022-04-27 20:31:00,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {9318#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9318#true} is VALID [2022-04-27 20:31:00,460 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9318#true} {9318#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9318#true} is VALID [2022-04-27 20:31:00,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {9318#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:00,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {9324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {9318#true} is VALID [2022-04-27 20:31:00,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {9318#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9318#true} is VALID [2022-04-27 20:31:00,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9318#true} {9318#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9318#true} is VALID [2022-04-27 20:31:00,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {9318#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9318#true} is VALID [2022-04-27 20:31:00,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {9318#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {9318#true} is VALID [2022-04-27 20:31:00,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {9318#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {9318#true} is VALID [2022-04-27 20:31:00,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {9318#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {9318#true} is VALID [2022-04-27 20:31:00,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {9318#true} [149] L48-->L48-2: Formula: (= v_main_~p1~0_4 0) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {9318#true} is VALID [2022-04-27 20:31:00,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {9318#true} [151] L48-2-->L52-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {9318#true} is VALID [2022-04-27 20:31:00,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {9318#true} [153] L52-1-->L56-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {9318#true} is VALID [2022-04-27 20:31:00,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {9318#true} [155] L56-1-->L60-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {9318#true} is VALID [2022-04-27 20:31:00,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {9318#true} [157] L60-1-->L64-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {9323#(= main_~p5~0 0)} is VALID [2022-04-27 20:31:00,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {9323#(= main_~p5~0 0)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {9323#(= main_~p5~0 0)} is VALID [2022-04-27 20:31:00,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {9323#(= main_~p5~0 0)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {9323#(= main_~p5~0 0)} is VALID [2022-04-27 20:31:00,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {9323#(= main_~p5~0 0)} [165] L74-1-->L79-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {9323#(= main_~p5~0 0)} is VALID [2022-04-27 20:31:00,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {9323#(= main_~p5~0 0)} [171] L79-1-->L84-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {9323#(= main_~p5~0 0)} is VALID [2022-04-27 20:31:00,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {9323#(= main_~p5~0 0)} [175] L84-1-->L89-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {9323#(= main_~p5~0 0)} is VALID [2022-04-27 20:31:00,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {9323#(= main_~p5~0 0)} [178] L89-1-->L95: Formula: (not (= v_main_~p5~0_2 0)) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2} AuxVars[] AssignedVars[] {9319#false} is VALID [2022-04-27 20:31:00,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {9319#false} [180] L95-->L100-1: Formula: (not (= v_main_~lk5~0_3 1)) InVars {main_~lk5~0=v_main_~lk5~0_3} OutVars{main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[] {9319#false} is VALID [2022-04-27 20:31:00,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {9319#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9319#false} is VALID [2022-04-27 20:31:00,464 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 20:31:00,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:00,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104295449] [2022-04-27 20:31:00,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104295449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:00,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:00,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:00,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289326188] [2022-04-27 20:31:00,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:00,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2022-04-27 20:31:00,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:00,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 20:31:00,475 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 20:31:00,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:00,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:00,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:00,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:00,476 INFO L87 Difference]: Start difference. First operand 457 states and 599 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 20:31:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:00,560 INFO L93 Difference]: Finished difference Result 587 states and 728 transitions. [2022-04-27 20:31:00,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:00,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2022-04-27 20:31:00,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:00,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 20:31:00,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-04-27 20:31:00,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 20:31:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-04-27 20:31:00,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 73 transitions. [2022-04-27 20:31:00,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:00,614 INFO L225 Difference]: With dead ends: 587 [2022-04-27 20:31:00,614 INFO L226 Difference]: Without dead ends: 587 [2022-04-27 20:31:00,614 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 20:31:00,615 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:00,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 71 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:00,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-04-27 20:31:00,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2022-04-27 20:31:00,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:00,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 587 states. Second operand has 585 states, 581 states have (on average 1.2461273666092942) internal successors, (724), 581 states have internal predecessors, (724), 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 20:31:00,622 INFO L74 IsIncluded]: Start isIncluded. First operand 587 states. Second operand has 585 states, 581 states have (on average 1.2461273666092942) internal successors, (724), 581 states have internal predecessors, (724), 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 20:31:00,623 INFO L87 Difference]: Start difference. First operand 587 states. Second operand has 585 states, 581 states have (on average 1.2461273666092942) internal successors, (724), 581 states have internal predecessors, (724), 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 20:31:00,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:00,634 INFO L93 Difference]: Finished difference Result 587 states and 728 transitions. [2022-04-27 20:31:00,634 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 728 transitions. [2022-04-27 20:31:00,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:00,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:00,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 585 states, 581 states have (on average 1.2461273666092942) internal successors, (724), 581 states have internal predecessors, (724), 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 587 states. [2022-04-27 20:31:00,636 INFO L87 Difference]: Start difference. First operand has 585 states, 581 states have (on average 1.2461273666092942) internal successors, (724), 581 states have internal predecessors, (724), 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 587 states. [2022-04-27 20:31:00,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:00,649 INFO L93 Difference]: Finished difference Result 587 states and 728 transitions. [2022-04-27 20:31:00,649 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 728 transitions. [2022-04-27 20:31:00,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:00,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:00,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:00,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:00,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 581 states have (on average 1.2461273666092942) internal successors, (724), 581 states have internal predecessors, (724), 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 20:31:00,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 727 transitions. [2022-04-27 20:31:00,662 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 727 transitions. Word has length 21 [2022-04-27 20:31:00,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:00,663 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 727 transitions. [2022-04-27 20:31:00,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 20:31:00,663 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 727 transitions. [2022-04-27 20:31:00,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 20:31:00,664 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:00,664 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:31:00,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 20:31:00,664 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:00,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:00,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1794955734, now seen corresponding path program 1 times [2022-04-27 20:31:00,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:00,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850269262] [2022-04-27 20:31:00,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:00,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:00,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:00,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {11682#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {11676#true} is VALID [2022-04-27 20:31:00,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {11676#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11676#true} is VALID [2022-04-27 20:31:00,688 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11676#true} {11676#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11676#true} is VALID [2022-04-27 20:31:00,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {11676#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11682#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:00,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {11682#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {11676#true} is VALID [2022-04-27 20:31:00,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {11676#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11676#true} is VALID [2022-04-27 20:31:00,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11676#true} {11676#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11676#true} is VALID [2022-04-27 20:31:00,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {11676#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11676#true} is VALID [2022-04-27 20:31:00,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {11676#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {11676#true} is VALID [2022-04-27 20:31:00,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {11676#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {11676#true} is VALID [2022-04-27 20:31:00,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {11676#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {11676#true} is VALID [2022-04-27 20:31:00,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {11676#true} [149] L48-->L48-2: Formula: (= v_main_~p1~0_4 0) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {11676#true} is VALID [2022-04-27 20:31:00,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {11676#true} [151] L48-2-->L52-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {11676#true} is VALID [2022-04-27 20:31:00,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {11676#true} [153] L52-1-->L56-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {11676#true} is VALID [2022-04-27 20:31:00,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {11676#true} [155] L56-1-->L60-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {11676#true} is VALID [2022-04-27 20:31:00,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {11676#true} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {11681#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:31:00,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {11681#(not (= main_~p5~0 0))} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {11681#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:31:00,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {11681#(not (= main_~p5~0 0))} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {11681#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:31:00,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {11681#(not (= main_~p5~0 0))} [165] L74-1-->L79-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {11681#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:31:00,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {11681#(not (= main_~p5~0 0))} [171] L79-1-->L84-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {11681#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:31:00,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {11681#(not (= main_~p5~0 0))} [175] L84-1-->L89-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {11681#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:31:00,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {11681#(not (= main_~p5~0 0))} [179] L89-1-->L94-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {11677#false} is VALID [2022-04-27 20:31:00,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {11677#false} [182] L94-1-->L100: Formula: (not (= v_main_~p6~0_2 0)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[] {11677#false} is VALID [2022-04-27 20:31:00,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {11677#false} [184] L100-->L100-1: Formula: (not (= v_main_~lk6~0_4 1)) InVars {main_~lk6~0=v_main_~lk6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_4} AuxVars[] AssignedVars[] {11677#false} is VALID [2022-04-27 20:31:00,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {11677#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11677#false} is VALID [2022-04-27 20:31:00,692 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 20:31:00,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:00,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850269262] [2022-04-27 20:31:00,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850269262] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:00,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:00,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:00,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269916168] [2022-04-27 20:31:00,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:00,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 22 [2022-04-27 20:31:00,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:00,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 20:31:00,704 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 20:31:00,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:00,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:00,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:00,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:00,705 INFO L87 Difference]: Start difference. First operand 585 states and 727 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 20:31:00,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:00,786 INFO L93 Difference]: Finished difference Result 603 states and 728 transitions. [2022-04-27 20:31:00,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:00,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 22 [2022-04-27 20:31:00,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:00,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 20:31:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-04-27 20:31:00,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 20:31:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-04-27 20:31:00,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 72 transitions. [2022-04-27 20:31:00,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:00,839 INFO L225 Difference]: With dead ends: 603 [2022-04-27 20:31:00,839 INFO L226 Difference]: Without dead ends: 603 [2022-04-27 20:31:00,840 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 20:31:00,842 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 75 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:00,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 61 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:00,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-04-27 20:31:00,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2022-04-27 20:31:00,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:00,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.2127303182579565) internal successors, (724), 597 states have internal predecessors, (724), 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 20:31:00,850 INFO L74 IsIncluded]: Start isIncluded. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.2127303182579565) internal successors, (724), 597 states have internal predecessors, (724), 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 20:31:00,851 INFO L87 Difference]: Start difference. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.2127303182579565) internal successors, (724), 597 states have internal predecessors, (724), 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 20:31:00,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:00,863 INFO L93 Difference]: Finished difference Result 603 states and 728 transitions. [2022-04-27 20:31:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 728 transitions. [2022-04-27 20:31:00,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:00,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:00,864 INFO L74 IsIncluded]: Start isIncluded. First operand has 601 states, 597 states have (on average 1.2127303182579565) internal successors, (724), 597 states have internal predecessors, (724), 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 603 states. [2022-04-27 20:31:00,865 INFO L87 Difference]: Start difference. First operand has 601 states, 597 states have (on average 1.2127303182579565) internal successors, (724), 597 states have internal predecessors, (724), 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 603 states. [2022-04-27 20:31:00,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:00,878 INFO L93 Difference]: Finished difference Result 603 states and 728 transitions. [2022-04-27 20:31:00,878 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 728 transitions. [2022-04-27 20:31:00,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:00,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:00,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:00,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:00,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 597 states have (on average 1.2127303182579565) internal successors, (724), 597 states have internal predecessors, (724), 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 20:31:00,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 727 transitions. [2022-04-27 20:31:00,891 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 727 transitions. Word has length 22 [2022-04-27 20:31:00,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:00,891 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 727 transitions. [2022-04-27 20:31:00,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 20:31:00,892 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 727 transitions. [2022-04-27 20:31:00,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 20:31:00,893 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:00,893 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:31:00,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 20:31:00,893 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:00,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:00,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1598442229, now seen corresponding path program 1 times [2022-04-27 20:31:00,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:00,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107402821] [2022-04-27 20:31:00,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:00,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:00,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:00,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {14104#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {14098#true} is VALID [2022-04-27 20:31:00,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {14098#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14098#true} is VALID [2022-04-27 20:31:00,926 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14098#true} {14098#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14098#true} is VALID [2022-04-27 20:31:00,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {14098#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14104#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:00,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {14104#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {14098#true} is VALID [2022-04-27 20:31:00,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {14098#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14098#true} is VALID [2022-04-27 20:31:00,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14098#true} {14098#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14098#true} is VALID [2022-04-27 20:31:00,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {14098#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14098#true} is VALID [2022-04-27 20:31:00,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {14098#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {14098#true} is VALID [2022-04-27 20:31:00,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {14098#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {14098#true} is VALID [2022-04-27 20:31:00,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {14098#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {14098#true} is VALID [2022-04-27 20:31:00,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {14098#true} [149] L48-->L48-2: Formula: (= v_main_~p1~0_4 0) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {14098#true} is VALID [2022-04-27 20:31:00,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {14098#true} [151] L48-2-->L52-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {14098#true} is VALID [2022-04-27 20:31:00,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {14098#true} [153] L52-1-->L56-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {14098#true} is VALID [2022-04-27 20:31:00,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {14098#true} [155] L56-1-->L60-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {14098#true} is VALID [2022-04-27 20:31:00,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {14098#true} [157] L60-1-->L64-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {14098#true} is VALID [2022-04-27 20:31:00,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {14098#true} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {14103#(= main_~lk6~0 1)} is VALID [2022-04-27 20:31:00,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {14103#(= main_~lk6~0 1)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {14103#(= main_~lk6~0 1)} is VALID [2022-04-27 20:31:00,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {14103#(= main_~lk6~0 1)} [165] L74-1-->L79-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {14103#(= main_~lk6~0 1)} is VALID [2022-04-27 20:31:00,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {14103#(= main_~lk6~0 1)} [171] L79-1-->L84-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {14103#(= main_~lk6~0 1)} is VALID [2022-04-27 20:31:00,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {14103#(= main_~lk6~0 1)} [175] L84-1-->L89-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {14103#(= main_~lk6~0 1)} is VALID [2022-04-27 20:31:00,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {14103#(= main_~lk6~0 1)} [179] L89-1-->L94-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {14103#(= main_~lk6~0 1)} is VALID [2022-04-27 20:31:00,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {14103#(= main_~lk6~0 1)} [182] L94-1-->L100: Formula: (not (= v_main_~p6~0_2 0)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[] {14103#(= main_~lk6~0 1)} is VALID [2022-04-27 20:31:00,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {14103#(= main_~lk6~0 1)} [184] L100-->L100-1: Formula: (not (= v_main_~lk6~0_4 1)) InVars {main_~lk6~0=v_main_~lk6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_4} AuxVars[] AssignedVars[] {14099#false} is VALID [2022-04-27 20:31:00,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {14099#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14099#false} is VALID [2022-04-27 20:31:00,932 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 20:31:00,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:00,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107402821] [2022-04-27 20:31:00,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107402821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:00,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:00,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:00,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56332089] [2022-04-27 20:31:00,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:00,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 22 [2022-04-27 20:31:00,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:00,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 20:31:00,945 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 20:31:00,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:00,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:00,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:00,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:00,945 INFO L87 Difference]: Start difference. First operand 601 states and 727 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 20:31:01,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:01,037 INFO L93 Difference]: Finished difference Result 969 states and 1127 transitions. [2022-04-27 20:31:01,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:01,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 22 [2022-04-27 20:31:01,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:01,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 20:31:01,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-27 20:31:01,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 20:31:01,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-27 20:31:01,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 61 transitions. [2022-04-27 20:31:01,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:01,100 INFO L225 Difference]: With dead ends: 969 [2022-04-27 20:31:01,101 INFO L226 Difference]: Without dead ends: 969 [2022-04-27 20:31:01,101 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 20:31:01,101 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:01,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 48 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:01,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2022-04-27 20:31:01,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 905. [2022-04-27 20:31:01,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:01,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 969 states. Second operand has 905 states, 901 states have (on average 1.1764705882352942) internal successors, (1060), 901 states have internal predecessors, (1060), 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 20:31:01,112 INFO L74 IsIncluded]: Start isIncluded. First operand 969 states. Second operand has 905 states, 901 states have (on average 1.1764705882352942) internal successors, (1060), 901 states have internal predecessors, (1060), 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 20:31:01,113 INFO L87 Difference]: Start difference. First operand 969 states. Second operand has 905 states, 901 states have (on average 1.1764705882352942) internal successors, (1060), 901 states have internal predecessors, (1060), 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 20:31:01,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:01,141 INFO L93 Difference]: Finished difference Result 969 states and 1127 transitions. [2022-04-27 20:31:01,141 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1127 transitions. [2022-04-27 20:31:01,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:01,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:01,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 905 states, 901 states have (on average 1.1764705882352942) internal successors, (1060), 901 states have internal predecessors, (1060), 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 969 states. [2022-04-27 20:31:01,144 INFO L87 Difference]: Start difference. First operand has 905 states, 901 states have (on average 1.1764705882352942) internal successors, (1060), 901 states have internal predecessors, (1060), 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 969 states. [2022-04-27 20:31:01,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:01,172 INFO L93 Difference]: Finished difference Result 969 states and 1127 transitions. [2022-04-27 20:31:01,172 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1127 transitions. [2022-04-27 20:31:01,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:01,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:01,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:01,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:01,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 901 states have (on average 1.1764705882352942) internal successors, (1060), 901 states have internal predecessors, (1060), 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 20:31:01,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1063 transitions. [2022-04-27 20:31:01,199 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1063 transitions. Word has length 22 [2022-04-27 20:31:01,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:01,199 INFO L495 AbstractCegarLoop]: Abstraction has 905 states and 1063 transitions. [2022-04-27 20:31:01,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 20:31:01,200 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1063 transitions. [2022-04-27 20:31:01,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 20:31:01,201 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:01,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:31:01,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 20:31:01,201 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:01,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:01,201 INFO L85 PathProgramCache]: Analyzing trace with hash -209012234, now seen corresponding path program 1 times [2022-04-27 20:31:01,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:01,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798974752] [2022-04-27 20:31:01,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:01,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:01,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:01,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {17928#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {17922#true} is VALID [2022-04-27 20:31:01,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {17922#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17922#true} is VALID [2022-04-27 20:31:01,237 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17922#true} {17922#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17922#true} is VALID [2022-04-27 20:31:01,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {17922#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17928#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:01,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {17928#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {17922#true} is VALID [2022-04-27 20:31:01,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {17922#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17922#true} is VALID [2022-04-27 20:31:01,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17922#true} {17922#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17922#true} is VALID [2022-04-27 20:31:01,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {17922#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17922#true} is VALID [2022-04-27 20:31:01,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {17922#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {17922#true} is VALID [2022-04-27 20:31:01,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {17922#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {17922#true} is VALID [2022-04-27 20:31:01,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {17922#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {17922#true} is VALID [2022-04-27 20:31:01,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {17922#true} [149] L48-->L48-2: Formula: (= v_main_~p1~0_4 0) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {17922#true} is VALID [2022-04-27 20:31:01,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {17922#true} [151] L48-2-->L52-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {17922#true} is VALID [2022-04-27 20:31:01,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {17922#true} [153] L52-1-->L56-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {17922#true} is VALID [2022-04-27 20:31:01,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {17922#true} [155] L56-1-->L60-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {17922#true} is VALID [2022-04-27 20:31:01,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {17922#true} [157] L60-1-->L64-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {17922#true} is VALID [2022-04-27 20:31:01,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {17922#true} [159] L64-1-->L68-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {17927#(= main_~p6~0 0)} is VALID [2022-04-27 20:31:01,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {17927#(= main_~p6~0 0)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {17927#(= main_~p6~0 0)} is VALID [2022-04-27 20:31:01,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {17927#(= main_~p6~0 0)} [165] L74-1-->L79-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {17927#(= main_~p6~0 0)} is VALID [2022-04-27 20:31:01,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {17927#(= main_~p6~0 0)} [171] L79-1-->L84-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {17927#(= main_~p6~0 0)} is VALID [2022-04-27 20:31:01,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {17927#(= main_~p6~0 0)} [175] L84-1-->L89-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {17927#(= main_~p6~0 0)} is VALID [2022-04-27 20:31:01,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {17927#(= main_~p6~0 0)} [179] L89-1-->L94-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {17927#(= main_~p6~0 0)} is VALID [2022-04-27 20:31:01,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {17927#(= main_~p6~0 0)} [182] L94-1-->L100: Formula: (not (= v_main_~p6~0_2 0)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[] {17923#false} is VALID [2022-04-27 20:31:01,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {17923#false} [184] L100-->L100-1: Formula: (not (= v_main_~lk6~0_4 1)) InVars {main_~lk6~0=v_main_~lk6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_4} AuxVars[] AssignedVars[] {17923#false} is VALID [2022-04-27 20:31:01,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {17923#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17923#false} is VALID [2022-04-27 20:31:01,246 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 20:31:01,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:01,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798974752] [2022-04-27 20:31:01,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798974752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:01,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:01,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:01,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237412860] [2022-04-27 20:31:01,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:01,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 22 [2022-04-27 20:31:01,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:01,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 20:31:01,257 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 20:31:01,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:01,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:01,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:01,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:01,258 INFO L87 Difference]: Start difference. First operand 905 states and 1063 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 20:31:01,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:01,369 INFO L93 Difference]: Finished difference Result 1127 states and 1222 transitions. [2022-04-27 20:31:01,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:01,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 22 [2022-04-27 20:31:01,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:01,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 20:31:01,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-04-27 20:31:01,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 20:31:01,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-04-27 20:31:01,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 69 transitions. [2022-04-27 20:31:01,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:01,409 INFO L225 Difference]: With dead ends: 1127 [2022-04-27 20:31:01,409 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 20:31:01,409 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 20:31:01,410 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:01,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 72 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:01,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 20:31:01,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 20:31:01,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:01,411 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 20:31:01,411 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 20:31:01,411 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 20:31:01,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:01,411 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 20:31:01,411 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 20:31:01,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:01,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:01,411 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 20:31:01,411 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 20:31:01,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:01,412 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 20:31:01,412 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 20:31:01,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:01,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:01,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:01,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:01,412 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 20:31:01,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 20:31:01,412 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-27 20:31:01,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:01,412 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 20:31:01,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 20:31:01,412 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 20:31:01,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:01,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 20:31:01,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 20:31:01,422 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:31:01,423 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 20:31:01,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 08:31:01 BasicIcfg [2022-04-27 20:31:01,426 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 20:31:01,427 INFO L158 Benchmark]: Toolchain (without parser) took 4774.22ms. Allocated memory was 190.8MB in the beginning and 243.3MB in the end (delta: 52.4MB). Free memory was 141.4MB in the beginning and 203.6MB in the end (delta: -62.2MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 20:31:01,427 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 190.8MB. Free memory is still 158.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 20:31:01,427 INFO L158 Benchmark]: CACSL2BoogieTranslator took 165.03ms. Allocated memory is still 190.8MB. Free memory was 141.2MB in the beginning and 166.1MB in the end (delta: -24.9MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. [2022-04-27 20:31:01,428 INFO L158 Benchmark]: Boogie Preprocessor took 24.31ms. Allocated memory is still 190.8MB. Free memory was 165.8MB in the beginning and 164.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 20:31:01,428 INFO L158 Benchmark]: RCFGBuilder took 248.88ms. Allocated memory is still 190.8MB. Free memory was 164.2MB in the beginning and 152.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 20:31:01,428 INFO L158 Benchmark]: IcfgTransformer took 44.82ms. Allocated memory is still 190.8MB. Free memory was 152.2MB in the beginning and 150.4MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 20:31:01,428 INFO L158 Benchmark]: TraceAbstraction took 4287.36ms. Allocated memory was 190.8MB in the beginning and 243.3MB in the end (delta: 52.4MB). Free memory was 149.8MB in the beginning and 204.2MB in the end (delta: -54.3MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 20:31:01,430 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 190.8MB. Free memory is still 158.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 165.03ms. Allocated memory is still 190.8MB. Free memory was 141.2MB in the beginning and 166.1MB in the end (delta: -24.9MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.31ms. Allocated memory is still 190.8MB. Free memory was 165.8MB in the beginning and 164.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 248.88ms. Allocated memory is still 190.8MB. Free memory was 164.2MB in the beginning and 152.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 44.82ms. Allocated memory is still 190.8MB. Free memory was 152.2MB in the beginning and 150.4MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4287.36ms. Allocated memory was 190.8MB in the beginning and 243.3MB in the end (delta: 52.4MB). Free memory was 149.8MB in the beginning and 204.2MB in the end (delta: -54.3MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 107]: 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, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1320 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1320 mSDsluCounter, 1061 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 653 IncrementalHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 940 mSDtfsCounter, 653 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=905occurred in iteration=16, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 317 ConstructedInterpolants, 0 QuantifiedInterpolants, 665 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 20:31:01,457 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...