/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_8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 20:31:03,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 20:31:03,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 20:31:03,856 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 20:31:03,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 20:31:03,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 20:31:03,860 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 20:31:03,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 20:31:03,862 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 20:31:03,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 20:31:03,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 20:31:03,867 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 20:31:03,867 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 20:31:03,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 20:31:03,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 20:31:03,871 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 20:31:03,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 20:31:03,872 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 20:31:03,873 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 20:31:03,878 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 20:31:03,879 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 20:31:03,880 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 20:31:03,880 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 20:31:03,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 20:31:03,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 20:31:03,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 20:31:03,886 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 20:31:03,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 20:31:03,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 20:31:03,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 20:31:03,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 20:31:03,888 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 20:31:03,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 20:31:03,890 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 20:31:03,890 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 20:31:03,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 20:31:03,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 20:31:03,891 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 20:31:03,891 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 20:31:03,891 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 20:31:03,892 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 20:31:03,893 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 20:31:03,893 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 20:31:03,902 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 20:31:03,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 20:31:03,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 20:31:03,903 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 20:31:03,903 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 20:31:03,903 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 20:31:03,903 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 20:31:03,903 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 20:31:03,903 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 20:31:03,904 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 20:31:03,904 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 20:31:03,904 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 20:31:03,904 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 20:31:03,904 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 20:31:03,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 20:31:03,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 20:31:03,904 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 20:31:03,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 20:31:03,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 20:31:03,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 20:31:03,905 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 20:31:03,905 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 20:31:03,905 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:31:04,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 20:31:04,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 20:31:04,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 20:31:04,095 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 20:31:04,096 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 20:31:04,096 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2022-04-27 20:31:04,140 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e733673c/93b5165679084ab0a39b6e3eeb6c5593/FLAG685ca6092 [2022-04-27 20:31:04,432 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 20:31:04,433 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2022-04-27 20:31:04,446 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e733673c/93b5165679084ab0a39b6e3eeb6c5593/FLAG685ca6092 [2022-04-27 20:31:04,863 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e733673c/93b5165679084ab0a39b6e3eeb6c5593 [2022-04-27 20:31:04,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 20:31:04,866 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 20:31:04,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 20:31:04,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 20:31:04,870 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 20:31:04,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 08:31:04" (1/1) ... [2022-04-27 20:31:04,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@462eba33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:31:04, skipping insertion in model container [2022-04-27 20:31:04,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 08:31:04" (1/1) ... [2022-04-27 20:31:04,875 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 20:31:04,889 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 20:31:05,041 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_8.c[3218,3231] [2022-04-27 20:31:05,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 20:31:05,052 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 20:31:05,080 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_8.c[3218,3231] [2022-04-27 20:31:05,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 20:31:05,089 INFO L208 MainTranslator]: Completed translation [2022-04-27 20:31:05,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:31:05 WrapperNode [2022-04-27 20:31:05,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 20:31:05,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 20:31:05,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 20:31:05,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 20:31:05,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:31:05" (1/1) ... [2022-04-27 20:31:05,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:31:05" (1/1) ... [2022-04-27 20:31:05,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:31:05" (1/1) ... [2022-04-27 20:31:05,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:31:05" (1/1) ... [2022-04-27 20:31:05,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:31:05" (1/1) ... [2022-04-27 20:31:05,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:31:05" (1/1) ... [2022-04-27 20:31:05,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:31:05" (1/1) ... [2022-04-27 20:31:05,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 20:31:05,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 20:31:05,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 20:31:05,130 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 20:31:05,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:31:05" (1/1) ... [2022-04-27 20:31:05,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 20:31:05,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:31:05,153 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:31:05,158 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:31:05,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 20:31:05,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 20:31:05,178 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 20:31:05,179 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 20:31:05,179 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 20:31:05,179 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 20:31:05,179 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 20:31:05,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 20:31:05,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 20:31:05,180 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 20:31:05,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 20:31:05,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 20:31:05,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 20:31:05,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 20:31:05,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 20:31:05,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 20:31:05,234 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 20:31:05,235 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 20:31:05,410 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 20:31:05,415 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 20:31:05,415 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 20:31:05,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 08:31:05 BoogieIcfgContainer [2022-04-27 20:31:05,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 20:31:05,417 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 20:31:05,417 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 20:31:05,417 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 20:31:05,419 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 08:31:05" (1/1) ... [2022-04-27 20:31:05,421 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 20:31:05,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 08:31:05 BasicIcfg [2022-04-27 20:31:05,443 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 20:31:05,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 20:31:05,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 20:31:05,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 20:31:05,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 08:31:04" (1/4) ... [2022-04-27 20:31:05,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f37d867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 08:31:05, skipping insertion in model container [2022-04-27 20:31:05,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:31:05" (2/4) ... [2022-04-27 20:31:05,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f37d867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 08:31:05, skipping insertion in model container [2022-04-27 20:31:05,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 08:31:05" (3/4) ... [2022-04-27 20:31:05,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f37d867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 08:31:05, skipping insertion in model container [2022-04-27 20:31:05,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 08:31:05" (4/4) ... [2022-04-27 20:31:05,449 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_8.cJordan [2022-04-27 20:31:05,457 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 20:31:05,457 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 20:31:05,503 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 20:31:05,507 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@3cb4a64c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2d9b4b99 [2022-04-27 20:31:05,507 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 20:31:05,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 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:31:05,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 20:31:05,523 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:05,523 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:31:05,524 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:05,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:05,537 INFO L85 PathProgramCache]: Analyzing trace with hash -498315745, now seen corresponding path program 1 times [2022-04-27 20:31:05,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:05,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742510851] [2022-04-27 20:31:05,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:05,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:05,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:05,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {42#true} is VALID [2022-04-27 20:31:05,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 20:31:05,760 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 20:31:05,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:05,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {42#true} is VALID [2022-04-27 20:31:05,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 20:31:05,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 20:31:05,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 20:31:05,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, 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_2, main_~lk7~0=v_main_~lk7~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_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {42#true} is VALID [2022-04-27 20:31:05,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {42#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {42#true} is VALID [2022-04-27 20:31:05,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk8~0, main_~lk7~0] {42#true} is VALID [2022-04-27 20:31:05,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} [182] L58-->L58-2: Formula: (and (= v_main_~lk1~0_3 1) (not (= v_main_~p1~0_2 0))) InVars {main_~p1~0=v_main_~p1~0_2} OutVars{main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3} AuxVars[] AssignedVars[main_~lk1~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-27 20:31:05,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {47#(= main_~lk1~0 1)} [184] L58-2-->L62-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-27 20:31:05,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {47#(= main_~lk1~0 1)} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-27 20:31:05,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {47#(= main_~lk1~0 1)} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-27 20:31:05,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {47#(= main_~lk1~0 1)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-27 20:31:05,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {47#(= main_~lk1~0 1)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 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_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-27 20:31:05,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {47#(= main_~lk1~0 1)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-27 20:31:05,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {47#(= main_~lk1~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-27 20:31:05,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {47#(= main_~lk1~0 1)} [198] L86-1-->L93: Formula: (not (= 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[] {47#(= main_~lk1~0 1)} is VALID [2022-04-27 20:31:05,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {47#(= main_~lk1~0 1)} [200] L93-->L128-1: Formula: (not (= v_main_~lk1~0_4 1)) InVars {main_~lk1~0=v_main_~lk1~0_4} OutVars{main_~lk1~0=v_main_~lk1~0_4} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 20:31:05,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 20:31:05,768 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:05,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:05,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742510851] [2022-04-27 20:31:05,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742510851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:05,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:05,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:05,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562204484] [2022-04-27 20:31:05,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:05,774 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:31:05,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:05,777 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:31:05,798 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:31:05,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:05,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:05,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:05,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:05,814 INFO L87 Difference]: Start difference. First operand has 39 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 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 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:31:06,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:06,055 INFO L93 Difference]: Finished difference Result 69 states and 114 transitions. [2022-04-27 20:31:06,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:06,056 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:31:06,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:06,057 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:31:06,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2022-04-27 20:31:06,064 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:31:06,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2022-04-27 20:31:06,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 121 transitions. [2022-04-27 20:31:06,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:06,223 INFO L225 Difference]: With dead ends: 69 [2022-04-27 20:31:06,223 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 20:31:06,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:31:06,229 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 140 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:06,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 77 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 20:31:06,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 20:31:06,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2022-04-27 20:31:06,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:06,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 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:06,257 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 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:06,258 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 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:06,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:06,269 INFO L93 Difference]: Finished difference Result 61 states and 105 transitions. [2022-04-27 20:31:06,270 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 105 transitions. [2022-04-27 20:31:06,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:06,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:06,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 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 61 states. [2022-04-27 20:31:06,271 INFO L87 Difference]: Start difference. First operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 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 61 states. [2022-04-27 20:31:06,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:06,274 INFO L93 Difference]: Finished difference Result 61 states and 105 transitions. [2022-04-27 20:31:06,274 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 105 transitions. [2022-04-27 20:31:06,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:06,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:06,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:06,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:06,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 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:06,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2022-04-27 20:31:06,278 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 19 [2022-04-27 20:31:06,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:06,278 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2022-04-27 20:31:06,279 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:31:06,279 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2022-04-27 20:31:06,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 20:31:06,279 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:06,279 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:31:06,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 20:31:06,280 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:06,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:06,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1999700192, now seen corresponding path program 1 times [2022-04-27 20:31:06,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:06,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586185344] [2022-04-27 20:31:06,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:06,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:06,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:06,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {288#true} is VALID [2022-04-27 20:31:06,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {288#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#true} is VALID [2022-04-27 20:31:06,361 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {288#true} {288#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#true} is VALID [2022-04-27 20:31:06,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {288#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:06,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {288#true} is VALID [2022-04-27 20:31:06,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {288#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#true} is VALID [2022-04-27 20:31:06,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {288#true} {288#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#true} is VALID [2022-04-27 20:31:06,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {288#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#true} is VALID [2022-04-27 20:31:06,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {288#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, 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_2, main_~lk7~0=v_main_~lk7~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_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {288#true} is VALID [2022-04-27 20:31:06,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {288#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {288#true} is VALID [2022-04-27 20:31:06,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {288#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk8~0, main_~lk7~0] {288#true} is VALID [2022-04-27 20:31:06,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {288#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {293#(= main_~p1~0 0)} is VALID [2022-04-27 20:31:06,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {293#(= main_~p1~0 0)} [184] L58-2-->L62-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {293#(= main_~p1~0 0)} is VALID [2022-04-27 20:31:06,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {293#(= main_~p1~0 0)} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {293#(= main_~p1~0 0)} is VALID [2022-04-27 20:31:06,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {293#(= main_~p1~0 0)} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {293#(= main_~p1~0 0)} is VALID [2022-04-27 20:31:06,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {293#(= main_~p1~0 0)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {293#(= main_~p1~0 0)} is VALID [2022-04-27 20:31:06,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {293#(= main_~p1~0 0)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 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_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {293#(= main_~p1~0 0)} is VALID [2022-04-27 20:31:06,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {293#(= main_~p1~0 0)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {293#(= main_~p1~0 0)} is VALID [2022-04-27 20:31:06,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {293#(= main_~p1~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {293#(= main_~p1~0 0)} is VALID [2022-04-27 20:31:06,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {293#(= main_~p1~0 0)} [198] L86-1-->L93: Formula: (not (= 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[] {289#false} is VALID [2022-04-27 20:31:06,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {289#false} [200] L93-->L128-1: Formula: (not (= v_main_~lk1~0_4 1)) InVars {main_~lk1~0=v_main_~lk1~0_4} OutVars{main_~lk1~0=v_main_~lk1~0_4} AuxVars[] AssignedVars[] {289#false} is VALID [2022-04-27 20:31:06,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {289#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289#false} is VALID [2022-04-27 20:31:06,369 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:06,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:06,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586185344] [2022-04-27 20:31:06,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586185344] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:06,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:06,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:06,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646416555] [2022-04-27 20:31:06,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:06,371 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:31:06,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:06,373 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:31:06,386 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:31:06,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:06,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:06,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:06,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:06,392 INFO L87 Difference]: Start difference. First operand 43 states and 74 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:31:06,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:06,546 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2022-04-27 20:31:06,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:06,547 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:31:06,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:06,547 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:31:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2022-04-27 20:31:06,550 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:31:06,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2022-04-27 20:31:06,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 105 transitions. [2022-04-27 20:31:06,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:06,627 INFO L225 Difference]: With dead ends: 61 [2022-04-27 20:31:06,627 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 20:31:06,628 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:06,629 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:06,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 79 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:06,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 20:31:06,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-04-27 20:31:06,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:06,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 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:06,634 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 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:06,634 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 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:06,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:06,636 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2022-04-27 20:31:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2022-04-27 20:31:06,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:06,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:06,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 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 61 states. [2022-04-27 20:31:06,638 INFO L87 Difference]: Start difference. First operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 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 61 states. [2022-04-27 20:31:06,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:06,640 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2022-04-27 20:31:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2022-04-27 20:31:06,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:06,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:06,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:06,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:06,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 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:06,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 102 transitions. [2022-04-27 20:31:06,642 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 102 transitions. Word has length 19 [2022-04-27 20:31:06,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:06,642 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 102 transitions. [2022-04-27 20:31:06,642 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:31:06,643 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 102 transitions. [2022-04-27 20:31:06,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 20:31:06,643 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:06,643 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:31:06,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 20:31:06,643 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:06,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:06,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1732113068, now seen corresponding path program 1 times [2022-04-27 20:31:06,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:06,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447415990] [2022-04-27 20:31:06,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:06,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:06,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:06,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {548#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {542#true} is VALID [2022-04-27 20:31:06,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {542#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {542#true} is VALID [2022-04-27 20:31:06,701 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {542#true} {542#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {542#true} is VALID [2022-04-27 20:31:06,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {542#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {548#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:06,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {548#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {542#true} is VALID [2022-04-27 20:31:06,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {542#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {542#true} is VALID [2022-04-27 20:31:06,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {542#true} {542#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {542#true} is VALID [2022-04-27 20:31:06,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {542#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {542#true} is VALID [2022-04-27 20:31:06,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {542#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, 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_2, main_~lk7~0=v_main_~lk7~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_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {542#true} is VALID [2022-04-27 20:31:06,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {542#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {542#true} is VALID [2022-04-27 20:31:06,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {542#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk8~0, main_~lk7~0] {542#true} is VALID [2022-04-27 20:31:06,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {542#true} [182] L58-->L58-2: Formula: (and (= v_main_~lk1~0_3 1) (not (= v_main_~p1~0_2 0))) InVars {main_~p1~0=v_main_~p1~0_2} OutVars{main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3} AuxVars[] AssignedVars[main_~lk1~0] {547#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:31:06,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {547#(not (= main_~p1~0 0))} [184] L58-2-->L62-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {547#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:31:06,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {547#(not (= main_~p1~0 0))} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {547#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:31:06,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {547#(not (= main_~p1~0 0))} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {547#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:31:06,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {547#(not (= main_~p1~0 0))} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {547#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:31:06,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {547#(not (= main_~p1~0 0))} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 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_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {547#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:31:06,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {547#(not (= main_~p1~0 0))} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {547#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:31:06,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {547#(not (= main_~p1~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {547#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:31:06,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {547#(not (= main_~p1~0 0))} [199] L86-1-->L92-1: Formula: (= 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[] {543#false} is VALID [2022-04-27 20:31:06,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {543#false} [202] L92-1-->L98: Formula: (not (= v_main_~p2~0_4 0)) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[] {543#false} is VALID [2022-04-27 20:31:06,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {543#false} [206] L98-->L128-1: Formula: (not (= v_main_~lk2~0_4 1)) InVars {main_~lk2~0=v_main_~lk2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_4} AuxVars[] AssignedVars[] {543#false} is VALID [2022-04-27 20:31:06,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {543#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {543#false} is VALID [2022-04-27 20:31:06,707 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:06,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:06,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447415990] [2022-04-27 20:31:06,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447415990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:06,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:06,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:06,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612521480] [2022-04-27 20:31:06,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:06,709 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:31:06,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:06,709 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:31:06,727 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:31:06,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:06,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:06,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:06,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:06,728 INFO L87 Difference]: Start difference. First operand 59 states and 102 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:31:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:06,843 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2022-04-27 20:31:06,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:06,843 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:31:06,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:06,843 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:31:06,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2022-04-27 20:31:06,845 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:31:06,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2022-04-27 20:31:06,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 104 transitions. [2022-04-27 20:31:06,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:06,923 INFO L225 Difference]: With dead ends: 64 [2022-04-27 20:31:06,923 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 20:31:06,923 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:06,924 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 105 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:06,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 93 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:06,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 20:31:06,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-04-27 20:31:06,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:06,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 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:06,929 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 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:06,929 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 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:06,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:06,931 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2022-04-27 20:31:06,931 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 105 transitions. [2022-04-27 20:31:06,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:06,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:06,932 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 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 64 states. [2022-04-27 20:31:06,932 INFO L87 Difference]: Start difference. First operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 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 64 states. [2022-04-27 20:31:06,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:06,934 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2022-04-27 20:31:06,934 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 105 transitions. [2022-04-27 20:31:06,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:06,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:06,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:06,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:06,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 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:06,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 104 transitions. [2022-04-27 20:31:06,936 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 104 transitions. Word has length 20 [2022-04-27 20:31:06,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:06,936 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 104 transitions. [2022-04-27 20:31:06,937 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:06,937 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2022-04-27 20:31:06,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 20:31:06,937 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:06,937 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:31:06,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 20:31:06,938 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:06,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:06,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1861195787, now seen corresponding path program 1 times [2022-04-27 20:31:06,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:06,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321884283] [2022-04-27 20:31:06,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:06,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:06,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:07,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {808#true} is VALID [2022-04-27 20:31:07,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {808#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {808#true} is VALID [2022-04-27 20:31:07,007 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {808#true} {808#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {808#true} is VALID [2022-04-27 20:31:07,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {808#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:07,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {808#true} is VALID [2022-04-27 20:31:07,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {808#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {808#true} is VALID [2022-04-27 20:31:07,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {808#true} {808#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {808#true} is VALID [2022-04-27 20:31:07,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {808#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {808#true} is VALID [2022-04-27 20:31:07,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {808#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, 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_2, main_~lk7~0=v_main_~lk7~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_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {808#true} is VALID [2022-04-27 20:31:07,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {808#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {808#true} is VALID [2022-04-27 20:31:07,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {808#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk8~0, main_~lk7~0] {808#true} is VALID [2022-04-27 20:31:07,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {808#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {808#true} is VALID [2022-04-27 20:31:07,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {808#true} [184] L58-2-->L62-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {813#(= main_~lk2~0 1)} is VALID [2022-04-27 20:31:07,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {813#(= main_~lk2~0 1)} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {813#(= main_~lk2~0 1)} is VALID [2022-04-27 20:31:07,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {813#(= main_~lk2~0 1)} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {813#(= main_~lk2~0 1)} is VALID [2022-04-27 20:31:07,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {813#(= main_~lk2~0 1)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {813#(= main_~lk2~0 1)} is VALID [2022-04-27 20:31:07,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {813#(= main_~lk2~0 1)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 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_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {813#(= main_~lk2~0 1)} is VALID [2022-04-27 20:31:07,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {813#(= main_~lk2~0 1)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {813#(= main_~lk2~0 1)} is VALID [2022-04-27 20:31:07,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {813#(= main_~lk2~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {813#(= main_~lk2~0 1)} is VALID [2022-04-27 20:31:07,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {813#(= main_~lk2~0 1)} [199] L86-1-->L92-1: Formula: (= 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[] {813#(= main_~lk2~0 1)} is VALID [2022-04-27 20:31:07,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {813#(= main_~lk2~0 1)} [202] L92-1-->L98: Formula: (not (= v_main_~p2~0_4 0)) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[] {813#(= main_~lk2~0 1)} is VALID [2022-04-27 20:31:07,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {813#(= main_~lk2~0 1)} [206] L98-->L128-1: Formula: (not (= v_main_~lk2~0_4 1)) InVars {main_~lk2~0=v_main_~lk2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_4} AuxVars[] AssignedVars[] {809#false} is VALID [2022-04-27 20:31:07,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {809#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {809#false} is VALID [2022-04-27 20:31:07,013 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:07,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:07,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321884283] [2022-04-27 20:31:07,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321884283] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:07,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:07,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:07,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359211618] [2022-04-27 20:31:07,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:07,014 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:31:07,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:07,014 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:31:07,024 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:31:07,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:07,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:07,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:07,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:07,025 INFO L87 Difference]: Start difference. First operand 62 states and 104 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:31:07,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:07,146 INFO L93 Difference]: Finished difference Result 111 states and 190 transitions. [2022-04-27 20:31:07,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:07,146 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:31:07,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:07,147 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:31:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-04-27 20:31:07,148 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:31:07,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-04-27 20:31:07,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 102 transitions. [2022-04-27 20:31:07,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:07,221 INFO L225 Difference]: With dead ends: 111 [2022-04-27 20:31:07,221 INFO L226 Difference]: Without dead ends: 111 [2022-04-27 20:31:07,222 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:07,222 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:07,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 65 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:07,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-27 20:31:07,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 81. [2022-04-27 20:31:07,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:07,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 81 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 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:07,227 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 81 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 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:07,227 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 81 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 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:07,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:07,230 INFO L93 Difference]: Finished difference Result 111 states and 190 transitions. [2022-04-27 20:31:07,230 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 190 transitions. [2022-04-27 20:31:07,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:07,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:07,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 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 111 states. [2022-04-27 20:31:07,231 INFO L87 Difference]: Start difference. First operand has 81 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 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 111 states. [2022-04-27 20:31:07,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:07,234 INFO L93 Difference]: Finished difference Result 111 states and 190 transitions. [2022-04-27 20:31:07,234 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 190 transitions. [2022-04-27 20:31:07,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:07,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:07,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:07,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:07,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 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:07,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 137 transitions. [2022-04-27 20:31:07,236 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 137 transitions. Word has length 20 [2022-04-27 20:31:07,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:07,236 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 137 transitions. [2022-04-27 20:31:07,237 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:07,237 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 137 transitions. [2022-04-27 20:31:07,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 20:31:07,237 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:07,237 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:31:07,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 20:31:07,237 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:07,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:07,238 INFO L85 PathProgramCache]: Analyzing trace with hash 64244428, now seen corresponding path program 1 times [2022-04-27 20:31:07,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:07,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190086600] [2022-04-27 20:31:07,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:07,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:07,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:07,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {1240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {1234#true} is VALID [2022-04-27 20:31:07,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {1234#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1234#true} is VALID [2022-04-27 20:31:07,280 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1234#true} {1234#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1234#true} is VALID [2022-04-27 20:31:07,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {1234#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:07,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {1240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {1234#true} is VALID [2022-04-27 20:31:07,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {1234#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1234#true} is VALID [2022-04-27 20:31:07,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1234#true} {1234#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1234#true} is VALID [2022-04-27 20:31:07,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {1234#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1234#true} is VALID [2022-04-27 20:31:07,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {1234#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, 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_2, main_~lk7~0=v_main_~lk7~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_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1234#true} is VALID [2022-04-27 20:31:07,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {1234#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {1234#true} is VALID [2022-04-27 20:31:07,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {1234#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk8~0, main_~lk7~0] {1234#true} is VALID [2022-04-27 20:31:07,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {1234#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {1234#true} is VALID [2022-04-27 20:31:07,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {1234#true} [185] L58-2-->L62-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[] {1239#(= main_~p2~0 0)} is VALID [2022-04-27 20:31:07,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {1239#(= main_~p2~0 0)} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {1239#(= main_~p2~0 0)} is VALID [2022-04-27 20:31:07,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {1239#(= main_~p2~0 0)} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {1239#(= main_~p2~0 0)} is VALID [2022-04-27 20:31:07,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {1239#(= main_~p2~0 0)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {1239#(= main_~p2~0 0)} is VALID [2022-04-27 20:31:07,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {1239#(= main_~p2~0 0)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 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_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {1239#(= main_~p2~0 0)} is VALID [2022-04-27 20:31:07,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {1239#(= main_~p2~0 0)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {1239#(= main_~p2~0 0)} is VALID [2022-04-27 20:31:07,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {1239#(= main_~p2~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {1239#(= main_~p2~0 0)} is VALID [2022-04-27 20:31:07,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {1239#(= main_~p2~0 0)} [199] L86-1-->L92-1: Formula: (= 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[] {1239#(= main_~p2~0 0)} is VALID [2022-04-27 20:31:07,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {1239#(= main_~p2~0 0)} [202] L92-1-->L98: Formula: (not (= v_main_~p2~0_4 0)) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[] {1235#false} is VALID [2022-04-27 20:31:07,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {1235#false} [206] L98-->L128-1: Formula: (not (= v_main_~lk2~0_4 1)) InVars {main_~lk2~0=v_main_~lk2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_4} AuxVars[] AssignedVars[] {1235#false} is VALID [2022-04-27 20:31:07,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {1235#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1235#false} is VALID [2022-04-27 20:31:07,287 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:07,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:07,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190086600] [2022-04-27 20:31:07,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190086600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:07,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:07,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:07,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843200055] [2022-04-27 20:31:07,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:07,288 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:31:07,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:07,288 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:31:07,299 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:31:07,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:07,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:07,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:07,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:07,300 INFO L87 Difference]: Start difference. First operand 81 states and 137 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:31:07,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:07,416 INFO L93 Difference]: Finished difference Result 113 states and 188 transitions. [2022-04-27 20:31:07,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:07,416 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:31:07,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:07,418 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:31:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-27 20:31:07,419 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:31:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-27 20:31:07,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-27 20:31:07,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:07,509 INFO L225 Difference]: With dead ends: 113 [2022-04-27 20:31:07,509 INFO L226 Difference]: Without dead ends: 113 [2022-04-27 20:31:07,510 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:07,515 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:07,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 81 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:07,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-27 20:31:07,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2022-04-27 20:31:07,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:07,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 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:31:07,534 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 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:31:07,534 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 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:31:07,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:07,536 INFO L93 Difference]: Finished difference Result 113 states and 188 transitions. [2022-04-27 20:31:07,536 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 188 transitions. [2022-04-27 20:31:07,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:07,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:07,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 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 113 states. [2022-04-27 20:31:07,537 INFO L87 Difference]: Start difference. First operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 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 113 states. [2022-04-27 20:31:07,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:07,541 INFO L93 Difference]: Finished difference Result 113 states and 188 transitions. [2022-04-27 20:31:07,541 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 188 transitions. [2022-04-27 20:31:07,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:07,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:07,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:07,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 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:31:07,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 187 transitions. [2022-04-27 20:31:07,544 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 187 transitions. Word has length 20 [2022-04-27 20:31:07,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:07,544 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 187 transitions. [2022-04-27 20:31:07,545 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:07,545 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 187 transitions. [2022-04-27 20:31:07,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 20:31:07,545 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:07,545 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:07,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 20:31:07,545 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:07,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:07,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1862526652, now seen corresponding path program 1 times [2022-04-27 20:31:07,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:07,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770744084] [2022-04-27 20:31:07,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:07,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:07,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:07,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {1702#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {1696#true} is VALID [2022-04-27 20:31:07,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {1696#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1696#true} is VALID [2022-04-27 20:31:07,581 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1696#true} {1696#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1696#true} is VALID [2022-04-27 20:31:07,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {1696#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1702#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:07,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {1702#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {1696#true} is VALID [2022-04-27 20:31:07,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {1696#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1696#true} is VALID [2022-04-27 20:31:07,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1696#true} {1696#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1696#true} is VALID [2022-04-27 20:31:07,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {1696#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1696#true} is VALID [2022-04-27 20:31:07,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {1696#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, 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_2, main_~lk7~0=v_main_~lk7~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_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1696#true} is VALID [2022-04-27 20:31:07,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {1696#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {1696#true} is VALID [2022-04-27 20:31:07,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {1696#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk8~0, main_~lk7~0] {1696#true} is VALID [2022-04-27 20:31:07,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {1696#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {1696#true} is VALID [2022-04-27 20:31:07,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {1696#true} [184] L58-2-->L62-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {1701#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:31:07,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {1701#(not (= main_~p2~0 0))} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {1701#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:31:07,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {1701#(not (= main_~p2~0 0))} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {1701#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:31:07,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {1701#(not (= main_~p2~0 0))} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {1701#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:31:07,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {1701#(not (= main_~p2~0 0))} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 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_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {1701#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:31:07,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {1701#(not (= main_~p2~0 0))} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {1701#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:31:07,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {1701#(not (= main_~p2~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {1701#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:31:07,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {1701#(not (= main_~p2~0 0))} [199] L86-1-->L92-1: Formula: (= 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[] {1701#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:31:07,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {1701#(not (= main_~p2~0 0))} [203] L92-1-->L97-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[] {1697#false} is VALID [2022-04-27 20:31:07,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {1697#false} [208] L97-1-->L103: Formula: (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} AuxVars[] AssignedVars[] {1697#false} is VALID [2022-04-27 20:31:07,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {1697#false} [210] L103-->L128-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {1697#false} is VALID [2022-04-27 20:31:07,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {1697#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1697#false} is VALID [2022-04-27 20:31:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:31:07,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:07,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770744084] [2022-04-27 20:31:07,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770744084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:07,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:07,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:07,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257911186] [2022-04-27 20:31:07,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:07,587 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:07,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:07,587 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:07,598 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:07,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:07,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:07,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:07,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:07,599 INFO L87 Difference]: Start difference. First operand 111 states and 187 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:07,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:07,704 INFO L93 Difference]: Finished difference Result 115 states and 188 transitions. [2022-04-27 20:31:07,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:07,704 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:07,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:07,705 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:07,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-04-27 20:31:07,706 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:07,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-04-27 20:31:07,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 102 transitions. [2022-04-27 20:31:07,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:07,770 INFO L225 Difference]: With dead ends: 115 [2022-04-27 20:31:07,770 INFO L226 Difference]: Without dead ends: 115 [2022-04-27 20:31:07,770 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:07,771 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 104 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:07,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 90 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:07,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-27 20:31:07,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2022-04-27 20:31:07,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:07,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 113 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 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:31:07,774 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 113 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 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:31:07,775 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 113 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 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:31:07,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:07,777 INFO L93 Difference]: Finished difference Result 115 states and 188 transitions. [2022-04-27 20:31:07,777 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 188 transitions. [2022-04-27 20:31:07,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:07,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:07,778 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 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 115 states. [2022-04-27 20:31:07,778 INFO L87 Difference]: Start difference. First operand has 113 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 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 115 states. [2022-04-27 20:31:07,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:07,780 INFO L93 Difference]: Finished difference Result 115 states and 188 transitions. [2022-04-27 20:31:07,780 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 188 transitions. [2022-04-27 20:31:07,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:07,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:07,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:07,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:07,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 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:31:07,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 187 transitions. [2022-04-27 20:31:07,783 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 187 transitions. Word has length 21 [2022-04-27 20:31:07,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:07,783 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 187 transitions. [2022-04-27 20:31:07,783 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:07,783 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 187 transitions. [2022-04-27 20:31:07,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 20:31:07,783 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:07,784 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:07,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 20:31:07,784 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:07,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:07,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1991609371, now seen corresponding path program 1 times [2022-04-27 20:31:07,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:07,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131367398] [2022-04-27 20:31:07,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:07,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:07,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:07,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {2172#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {2166#true} is VALID [2022-04-27 20:31:07,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {2166#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2166#true} is VALID [2022-04-27 20:31:07,817 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2166#true} {2166#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2166#true} is VALID [2022-04-27 20:31:07,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {2166#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2172#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:07,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {2172#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {2166#true} is VALID [2022-04-27 20:31:07,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {2166#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2166#true} is VALID [2022-04-27 20:31:07,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2166#true} {2166#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2166#true} is VALID [2022-04-27 20:31:07,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {2166#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2166#true} is VALID [2022-04-27 20:31:07,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {2166#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, 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_2, main_~lk7~0=v_main_~lk7~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_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {2166#true} is VALID [2022-04-27 20:31:07,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {2166#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {2166#true} is VALID [2022-04-27 20:31:07,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {2166#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk8~0, main_~lk7~0] {2166#true} is VALID [2022-04-27 20:31:07,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {2166#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {2166#true} is VALID [2022-04-27 20:31:07,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {2166#true} [185] L58-2-->L62-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[] {2166#true} is VALID [2022-04-27 20:31:07,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {2166#true} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {2171#(= main_~lk3~0 1)} is VALID [2022-04-27 20:31:07,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {2171#(= main_~lk3~0 1)} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {2171#(= main_~lk3~0 1)} is VALID [2022-04-27 20:31:07,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {2171#(= main_~lk3~0 1)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {2171#(= main_~lk3~0 1)} is VALID [2022-04-27 20:31:07,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {2171#(= main_~lk3~0 1)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 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_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {2171#(= main_~lk3~0 1)} is VALID [2022-04-27 20:31:07,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {2171#(= main_~lk3~0 1)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {2171#(= main_~lk3~0 1)} is VALID [2022-04-27 20:31:07,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {2171#(= main_~lk3~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {2171#(= main_~lk3~0 1)} is VALID [2022-04-27 20:31:07,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {2171#(= main_~lk3~0 1)} [199] L86-1-->L92-1: Formula: (= 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[] {2171#(= main_~lk3~0 1)} is VALID [2022-04-27 20:31:07,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {2171#(= main_~lk3~0 1)} [203] L92-1-->L97-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[] {2171#(= main_~lk3~0 1)} is VALID [2022-04-27 20:31:07,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {2171#(= main_~lk3~0 1)} [208] L97-1-->L103: Formula: (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} AuxVars[] AssignedVars[] {2171#(= main_~lk3~0 1)} is VALID [2022-04-27 20:31:07,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {2171#(= main_~lk3~0 1)} [210] L103-->L128-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {2167#false} is VALID [2022-04-27 20:31:07,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {2167#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2167#false} is VALID [2022-04-27 20:31:07,822 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:07,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:07,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131367398] [2022-04-27 20:31:07,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131367398] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:07,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:07,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:07,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322354513] [2022-04-27 20:31:07,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:07,823 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:07,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:07,823 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:07,838 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:07,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:07,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:07,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:07,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:07,839 INFO L87 Difference]: Start difference. First operand 113 states and 187 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:07,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:07,942 INFO L93 Difference]: Finished difference Result 203 states and 340 transitions. [2022-04-27 20:31:07,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:07,942 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:07,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:07,942 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:07,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-04-27 20:31:07,944 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:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-04-27 20:31:07,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 98 transitions. [2022-04-27 20:31:08,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:08,008 INFO L225 Difference]: With dead ends: 203 [2022-04-27 20:31:08,008 INFO L226 Difference]: Without dead ends: 203 [2022-04-27 20:31:08,009 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:08,009 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 120 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:08,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 64 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:08,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-04-27 20:31:08,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 153. [2022-04-27 20:31:08,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:08,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand has 153 states, 149 states have (on average 1.6644295302013423) internal successors, (248), 149 states have internal predecessors, (248), 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:08,013 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand has 153 states, 149 states have (on average 1.6644295302013423) internal successors, (248), 149 states have internal predecessors, (248), 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:08,013 INFO L87 Difference]: Start difference. First operand 203 states. Second operand has 153 states, 149 states have (on average 1.6644295302013423) internal successors, (248), 149 states have internal predecessors, (248), 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:08,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:08,017 INFO L93 Difference]: Finished difference Result 203 states and 340 transitions. [2022-04-27 20:31:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 340 transitions. [2022-04-27 20:31:08,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:08,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:08,018 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 149 states have (on average 1.6644295302013423) internal successors, (248), 149 states have internal predecessors, (248), 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 203 states. [2022-04-27 20:31:08,018 INFO L87 Difference]: Start difference. First operand has 153 states, 149 states have (on average 1.6644295302013423) internal successors, (248), 149 states have internal predecessors, (248), 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 203 states. [2022-04-27 20:31:08,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:08,022 INFO L93 Difference]: Finished difference Result 203 states and 340 transitions. [2022-04-27 20:31:08,022 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 340 transitions. [2022-04-27 20:31:08,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:08,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:08,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:08,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:08,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 149 states have (on average 1.6644295302013423) internal successors, (248), 149 states have internal predecessors, (248), 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:08,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 251 transitions. [2022-04-27 20:31:08,026 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 251 transitions. Word has length 21 [2022-04-27 20:31:08,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:08,026 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 251 transitions. [2022-04-27 20:31:08,026 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:08,026 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 251 transitions. [2022-04-27 20:31:08,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 20:31:08,026 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:08,026 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:08,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 20:31:08,027 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:08,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:08,027 INFO L85 PathProgramCache]: Analyzing trace with hash 194658012, now seen corresponding path program 1 times [2022-04-27 20:31:08,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:08,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523661062] [2022-04-27 20:31:08,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:08,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:08,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:08,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {2946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {2940#true} is VALID [2022-04-27 20:31:08,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {2940#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2940#true} is VALID [2022-04-27 20:31:08,056 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2940#true} {2940#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2940#true} is VALID [2022-04-27 20:31:08,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {2940#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:08,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {2946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {2940#true} is VALID [2022-04-27 20:31:08,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {2940#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2940#true} is VALID [2022-04-27 20:31:08,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2940#true} {2940#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2940#true} is VALID [2022-04-27 20:31:08,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {2940#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2940#true} is VALID [2022-04-27 20:31:08,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {2940#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, 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_2, main_~lk7~0=v_main_~lk7~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_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {2940#true} is VALID [2022-04-27 20:31:08,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {2940#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {2940#true} is VALID [2022-04-27 20:31:08,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {2940#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk8~0, main_~lk7~0] {2940#true} is VALID [2022-04-27 20:31:08,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {2940#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {2940#true} is VALID [2022-04-27 20:31:08,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {2940#true} [185] L58-2-->L62-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[] {2940#true} is VALID [2022-04-27 20:31:08,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {2940#true} [187] L62-1-->L66-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[] {2945#(= main_~p3~0 0)} is VALID [2022-04-27 20:31:08,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {2945#(= main_~p3~0 0)} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {2945#(= main_~p3~0 0)} is VALID [2022-04-27 20:31:08,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {2945#(= main_~p3~0 0)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {2945#(= main_~p3~0 0)} is VALID [2022-04-27 20:31:08,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {2945#(= main_~p3~0 0)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 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_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {2945#(= main_~p3~0 0)} is VALID [2022-04-27 20:31:08,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {2945#(= main_~p3~0 0)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {2945#(= main_~p3~0 0)} is VALID [2022-04-27 20:31:08,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {2945#(= main_~p3~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {2945#(= main_~p3~0 0)} is VALID [2022-04-27 20:31:08,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {2945#(= main_~p3~0 0)} [199] L86-1-->L92-1: Formula: (= 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[] {2945#(= main_~p3~0 0)} is VALID [2022-04-27 20:31:08,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {2945#(= main_~p3~0 0)} [203] L92-1-->L97-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[] {2945#(= main_~p3~0 0)} is VALID [2022-04-27 20:31:08,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {2945#(= main_~p3~0 0)} [208] L97-1-->L103: Formula: (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} AuxVars[] AssignedVars[] {2941#false} is VALID [2022-04-27 20:31:08,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {2941#false} [210] L103-->L128-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {2941#false} is VALID [2022-04-27 20:31:08,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {2941#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2941#false} is VALID [2022-04-27 20:31:08,060 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:08,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:08,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523661062] [2022-04-27 20:31:08,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523661062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:08,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:08,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:08,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999051330] [2022-04-27 20:31:08,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:08,061 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:08,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:08,061 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:08,072 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:08,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:08,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:08,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:08,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:08,072 INFO L87 Difference]: Start difference. First operand 153 states and 251 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:08,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:08,181 INFO L93 Difference]: Finished difference Result 211 states and 340 transitions. [2022-04-27 20:31:08,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:08,181 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:08,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:08,181 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:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2022-04-27 20:31:08,182 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:08,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2022-04-27 20:31:08,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 101 transitions. [2022-04-27 20:31:08,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:08,246 INFO L225 Difference]: With dead ends: 211 [2022-04-27 20:31:08,246 INFO L226 Difference]: Without dead ends: 211 [2022-04-27 20:31:08,247 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:08,247 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:08,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 83 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:08,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-04-27 20:31:08,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2022-04-27 20:31:08,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:08,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 states. Second operand has 209 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 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:08,251 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand has 209 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 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:08,252 INFO L87 Difference]: Start difference. First operand 211 states. Second operand has 209 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 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:08,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:08,256 INFO L93 Difference]: Finished difference Result 211 states and 340 transitions. [2022-04-27 20:31:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 340 transitions. [2022-04-27 20:31:08,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:08,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:08,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 209 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 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 211 states. [2022-04-27 20:31:08,257 INFO L87 Difference]: Start difference. First operand has 209 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 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 211 states. [2022-04-27 20:31:08,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:08,261 INFO L93 Difference]: Finished difference Result 211 states and 340 transitions. [2022-04-27 20:31:08,261 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 340 transitions. [2022-04-27 20:31:08,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:08,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:08,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:08,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:08,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 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:08,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 339 transitions. [2022-04-27 20:31:08,266 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 339 transitions. Word has length 21 [2022-04-27 20:31:08,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:08,266 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 339 transitions. [2022-04-27 20:31:08,267 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:08,267 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 339 transitions. [2022-04-27 20:31:08,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 20:31:08,267 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:08,267 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:08,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 20:31:08,267 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:08,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:08,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1610380584, now seen corresponding path program 1 times [2022-04-27 20:31:08,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:08,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854390652] [2022-04-27 20:31:08,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:08,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:08,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:08,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {3800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {3794#true} is VALID [2022-04-27 20:31:08,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {3794#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3794#true} is VALID [2022-04-27 20:31:08,294 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3794#true} {3794#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3794#true} is VALID [2022-04-27 20:31:08,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {3794#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:08,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {3800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {3794#true} is VALID [2022-04-27 20:31:08,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {3794#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3794#true} is VALID [2022-04-27 20:31:08,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3794#true} {3794#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3794#true} is VALID [2022-04-27 20:31:08,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {3794#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3794#true} is VALID [2022-04-27 20:31:08,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {3794#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, 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_2, main_~lk7~0=v_main_~lk7~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_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {3794#true} is VALID [2022-04-27 20:31:08,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {3794#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {3794#true} is VALID [2022-04-27 20:31:08,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {3794#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk8~0, main_~lk7~0] {3794#true} is VALID [2022-04-27 20:31:08,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {3794#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {3794#true} is VALID [2022-04-27 20:31:08,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {3794#true} [185] L58-2-->L62-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[] {3794#true} is VALID [2022-04-27 20:31:08,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {3794#true} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {3799#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:31:08,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {3799#(not (= main_~p3~0 0))} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {3799#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:31:08,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {3799#(not (= main_~p3~0 0))} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {3799#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:31:08,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {3799#(not (= main_~p3~0 0))} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 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_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {3799#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:31:08,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {3799#(not (= main_~p3~0 0))} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {3799#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:31:08,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {3799#(not (= main_~p3~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {3799#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:31:08,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {3799#(not (= main_~p3~0 0))} [199] L86-1-->L92-1: Formula: (= 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[] {3799#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:31:08,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {3799#(not (= main_~p3~0 0))} [203] L92-1-->L97-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[] {3799#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:31:08,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {3799#(not (= main_~p3~0 0))} [209] L97-1-->L102-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[] {3795#false} is VALID [2022-04-27 20:31:08,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {3795#false} [212] L102-1-->L108: Formula: (not (= v_main_~p4~0_4 0)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {3795#false} is VALID [2022-04-27 20:31:08,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {3795#false} [214] L108-->L128-1: Formula: (not (= v_main_~lk4~0_4 1)) InVars {main_~lk4~0=v_main_~lk4~0_4} OutVars{main_~lk4~0=v_main_~lk4~0_4} AuxVars[] AssignedVars[] {3795#false} is VALID [2022-04-27 20:31:08,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {3795#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3795#false} is VALID [2022-04-27 20:31:08,305 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:08,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:08,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854390652] [2022-04-27 20:31:08,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854390652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:08,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:08,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:08,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31925924] [2022-04-27 20:31:08,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:08,306 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:08,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:08,306 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:08,316 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:08,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:08,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:08,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:08,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:08,317 INFO L87 Difference]: Start difference. First operand 209 states and 339 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:08,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:08,413 INFO L93 Difference]: Finished difference Result 215 states and 340 transitions. [2022-04-27 20:31:08,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:08,413 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:08,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:08,413 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:08,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-27 20:31:08,414 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:08,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-27 20:31:08,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 100 transitions. [2022-04-27 20:31:08,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:08,488 INFO L225 Difference]: With dead ends: 215 [2022-04-27 20:31:08,488 INFO L226 Difference]: Without dead ends: 215 [2022-04-27 20:31:08,488 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:08,489 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 87 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.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:08,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 87 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:08,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-04-27 20:31:08,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2022-04-27 20:31:08,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:08,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 209 states have internal predecessors, (336), 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:08,492 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 209 states have internal predecessors, (336), 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:08,493 INFO L87 Difference]: Start difference. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 209 states have internal predecessors, (336), 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:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:08,497 INFO L93 Difference]: Finished difference Result 215 states and 340 transitions. [2022-04-27 20:31:08,497 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 340 transitions. [2022-04-27 20:31:08,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:08,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:08,498 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 209 states have internal predecessors, (336), 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 215 states. [2022-04-27 20:31:08,498 INFO L87 Difference]: Start difference. First operand has 213 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 209 states have internal predecessors, (336), 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 215 states. [2022-04-27 20:31:08,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:08,501 INFO L93 Difference]: Finished difference Result 215 states and 340 transitions. [2022-04-27 20:31:08,501 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 340 transitions. [2022-04-27 20:31:08,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:08,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:08,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:08,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:08,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 209 states have internal predecessors, (336), 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:08,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 339 transitions. [2022-04-27 20:31:08,505 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 339 transitions. Word has length 22 [2022-04-27 20:31:08,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:08,505 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 339 transitions. [2022-04-27 20:31:08,505 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:08,505 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 339 transitions. [2022-04-27 20:31:08,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 20:31:08,506 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:08,506 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:08,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 20:31:08,506 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:08,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:08,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1739463303, now seen corresponding path program 1 times [2022-04-27 20:31:08,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:08,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865482672] [2022-04-27 20:31:08,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:08,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:08,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:08,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {4670#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {4664#true} is VALID [2022-04-27 20:31:08,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {4664#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4664#true} is VALID [2022-04-27 20:31:08,537 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4664#true} {4664#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4664#true} is VALID [2022-04-27 20:31:08,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {4664#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4670#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:08,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {4670#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {4664#true} is VALID [2022-04-27 20:31:08,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {4664#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4664#true} is VALID [2022-04-27 20:31:08,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4664#true} {4664#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4664#true} is VALID [2022-04-27 20:31:08,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {4664#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4664#true} is VALID [2022-04-27 20:31:08,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {4664#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, 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_2, main_~lk7~0=v_main_~lk7~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_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {4664#true} is VALID [2022-04-27 20:31:08,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {4664#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {4664#true} is VALID [2022-04-27 20:31:08,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {4664#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk8~0, main_~lk7~0] {4664#true} is VALID [2022-04-27 20:31:08,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {4664#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {4664#true} is VALID [2022-04-27 20:31:08,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {4664#true} [185] L58-2-->L62-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[] {4664#true} is VALID [2022-04-27 20:31:08,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {4664#true} [187] L62-1-->L66-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[] {4664#true} is VALID [2022-04-27 20:31:08,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {4664#true} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {4669#(= main_~lk4~0 1)} is VALID [2022-04-27 20:31:08,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {4669#(= main_~lk4~0 1)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {4669#(= main_~lk4~0 1)} is VALID [2022-04-27 20:31:08,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {4669#(= main_~lk4~0 1)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 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_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {4669#(= main_~lk4~0 1)} is VALID [2022-04-27 20:31:08,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {4669#(= main_~lk4~0 1)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {4669#(= main_~lk4~0 1)} is VALID [2022-04-27 20:31:08,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {4669#(= main_~lk4~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {4669#(= main_~lk4~0 1)} is VALID [2022-04-27 20:31:08,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {4669#(= main_~lk4~0 1)} [199] L86-1-->L92-1: Formula: (= 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[] {4669#(= main_~lk4~0 1)} is VALID [2022-04-27 20:31:08,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {4669#(= main_~lk4~0 1)} [203] L92-1-->L97-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[] {4669#(= main_~lk4~0 1)} is VALID [2022-04-27 20:31:08,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {4669#(= main_~lk4~0 1)} [209] L97-1-->L102-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[] {4669#(= main_~lk4~0 1)} is VALID [2022-04-27 20:31:08,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {4669#(= main_~lk4~0 1)} [212] L102-1-->L108: Formula: (not (= v_main_~p4~0_4 0)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {4669#(= main_~lk4~0 1)} is VALID [2022-04-27 20:31:08,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {4669#(= main_~lk4~0 1)} [214] L108-->L128-1: Formula: (not (= v_main_~lk4~0_4 1)) InVars {main_~lk4~0=v_main_~lk4~0_4} OutVars{main_~lk4~0=v_main_~lk4~0_4} AuxVars[] AssignedVars[] {4665#false} is VALID [2022-04-27 20:31:08,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {4665#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4665#false} is VALID [2022-04-27 20:31:08,541 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:08,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:08,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865482672] [2022-04-27 20:31:08,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865482672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:08,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:08,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:08,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471061712] [2022-04-27 20:31:08,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:08,542 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:08,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:08,542 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:08,553 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:08,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:08,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:08,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:08,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:08,554 INFO L87 Difference]: Start difference. First operand 213 states and 339 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:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:08,654 INFO L93 Difference]: Finished difference Result 379 states and 608 transitions. [2022-04-27 20:31:08,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:08,655 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:08,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:08,655 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:08,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-27 20:31:08,656 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:08,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-27 20:31:08,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-27 20:31:08,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:08,716 INFO L225 Difference]: With dead ends: 379 [2022-04-27 20:31:08,716 INFO L226 Difference]: Without dead ends: 379 [2022-04-27 20:31:08,717 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:08,717 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 113 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:08,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 63 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:08,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-04-27 20:31:08,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 297. [2022-04-27 20:31:08,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:08,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.5699658703071673) internal successors, (460), 293 states have internal predecessors, (460), 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:08,722 INFO L74 IsIncluded]: Start isIncluded. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.5699658703071673) internal successors, (460), 293 states have internal predecessors, (460), 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:08,722 INFO L87 Difference]: Start difference. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.5699658703071673) internal successors, (460), 293 states have internal predecessors, (460), 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:08,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:08,728 INFO L93 Difference]: Finished difference Result 379 states and 608 transitions. [2022-04-27 20:31:08,729 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 608 transitions. [2022-04-27 20:31:08,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:08,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:08,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 297 states, 293 states have (on average 1.5699658703071673) internal successors, (460), 293 states have internal predecessors, (460), 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 379 states. [2022-04-27 20:31:08,730 INFO L87 Difference]: Start difference. First operand has 297 states, 293 states have (on average 1.5699658703071673) internal successors, (460), 293 states have internal predecessors, (460), 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 379 states. [2022-04-27 20:31:08,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:08,736 INFO L93 Difference]: Finished difference Result 379 states and 608 transitions. [2022-04-27 20:31:08,736 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 608 transitions. [2022-04-27 20:31:08,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:08,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:08,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:08,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:08,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 293 states have (on average 1.5699658703071673) internal successors, (460), 293 states have internal predecessors, (460), 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:08,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 463 transitions. [2022-04-27 20:31:08,742 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 463 transitions. Word has length 22 [2022-04-27 20:31:08,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:08,742 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 463 transitions. [2022-04-27 20:31:08,742 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:08,742 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 463 transitions. [2022-04-27 20:31:08,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 20:31:08,743 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:08,743 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:08,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 20:31:08,743 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:08,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:08,743 INFO L85 PathProgramCache]: Analyzing trace with hash -57488056, now seen corresponding path program 1 times [2022-04-27 20:31:08,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:08,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859926897] [2022-04-27 20:31:08,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:08,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:08,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:08,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {6116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {6110#true} is VALID [2022-04-27 20:31:08,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {6110#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6110#true} is VALID [2022-04-27 20:31:08,775 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6110#true} {6110#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6110#true} is VALID [2022-04-27 20:31:08,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {6110#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:08,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {6116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {6110#true} is VALID [2022-04-27 20:31:08,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {6110#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6110#true} is VALID [2022-04-27 20:31:08,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6110#true} {6110#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6110#true} is VALID [2022-04-27 20:31:08,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {6110#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6110#true} is VALID [2022-04-27 20:31:08,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {6110#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, 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_2, main_~lk7~0=v_main_~lk7~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_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {6110#true} is VALID [2022-04-27 20:31:08,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {6110#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {6110#true} is VALID [2022-04-27 20:31:08,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {6110#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk8~0, main_~lk7~0] {6110#true} is VALID [2022-04-27 20:31:08,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {6110#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {6110#true} is VALID [2022-04-27 20:31:08,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {6110#true} [185] L58-2-->L62-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[] {6110#true} is VALID [2022-04-27 20:31:08,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {6110#true} [187] L62-1-->L66-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[] {6110#true} is VALID [2022-04-27 20:31:08,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {6110#true} [189] L66-1-->L70-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[] {6115#(= main_~p4~0 0)} is VALID [2022-04-27 20:31:08,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {6115#(= main_~p4~0 0)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {6115#(= main_~p4~0 0)} is VALID [2022-04-27 20:31:08,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {6115#(= main_~p4~0 0)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 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_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {6115#(= main_~p4~0 0)} is VALID [2022-04-27 20:31:08,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {6115#(= main_~p4~0 0)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {6115#(= main_~p4~0 0)} is VALID [2022-04-27 20:31:08,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {6115#(= main_~p4~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {6115#(= main_~p4~0 0)} is VALID [2022-04-27 20:31:08,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {6115#(= main_~p4~0 0)} [199] L86-1-->L92-1: Formula: (= 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[] {6115#(= main_~p4~0 0)} is VALID [2022-04-27 20:31:08,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {6115#(= main_~p4~0 0)} [203] L92-1-->L97-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[] {6115#(= main_~p4~0 0)} is VALID [2022-04-27 20:31:08,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {6115#(= main_~p4~0 0)} [209] L97-1-->L102-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[] {6115#(= main_~p4~0 0)} is VALID [2022-04-27 20:31:08,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {6115#(= main_~p4~0 0)} [212] L102-1-->L108: Formula: (not (= v_main_~p4~0_4 0)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {6111#false} is VALID [2022-04-27 20:31:08,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {6111#false} [214] L108-->L128-1: Formula: (not (= v_main_~lk4~0_4 1)) InVars {main_~lk4~0=v_main_~lk4~0_4} OutVars{main_~lk4~0=v_main_~lk4~0_4} AuxVars[] AssignedVars[] {6111#false} is VALID [2022-04-27 20:31:08,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {6111#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6111#false} is VALID [2022-04-27 20:31:08,787 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:08,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:08,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859926897] [2022-04-27 20:31:08,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859926897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:08,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:08,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:08,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290848280] [2022-04-27 20:31:08,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:08,788 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:08,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:08,788 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:08,799 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:08,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:08,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:08,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:08,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:08,800 INFO L87 Difference]: Start difference. First operand 297 states and 463 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:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:08,907 INFO L93 Difference]: Finished difference Result 403 states and 616 transitions. [2022-04-27 20:31:08,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:08,908 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:08,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:08,908 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:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-27 20:31:08,909 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:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-27 20:31:08,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-27 20:31:08,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:08,974 INFO L225 Difference]: With dead ends: 403 [2022-04-27 20:31:08,974 INFO L226 Difference]: Without dead ends: 403 [2022-04-27 20:31:08,974 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:08,975 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:08,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 85 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:08,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-04-27 20:31:08,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2022-04-27 20:31:08,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:08,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5415617128463477) internal successors, (612), 397 states have internal predecessors, (612), 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:08,981 INFO L74 IsIncluded]: Start isIncluded. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5415617128463477) internal successors, (612), 397 states have internal predecessors, (612), 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:08,981 INFO L87 Difference]: Start difference. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5415617128463477) internal successors, (612), 397 states have internal predecessors, (612), 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:08,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:08,990 INFO L93 Difference]: Finished difference Result 403 states and 616 transitions. [2022-04-27 20:31:08,991 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 616 transitions. [2022-04-27 20:31:08,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:08,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:08,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 401 states, 397 states have (on average 1.5415617128463477) internal successors, (612), 397 states have internal predecessors, (612), 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 403 states. [2022-04-27 20:31:08,992 INFO L87 Difference]: Start difference. First operand has 401 states, 397 states have (on average 1.5415617128463477) internal successors, (612), 397 states have internal predecessors, (612), 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 403 states. [2022-04-27 20:31:09,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:09,000 INFO L93 Difference]: Finished difference Result 403 states and 616 transitions. [2022-04-27 20:31:09,000 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 616 transitions. [2022-04-27 20:31:09,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:09,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:09,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:09,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 397 states have (on average 1.5415617128463477) internal successors, (612), 397 states have internal predecessors, (612), 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:09,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 615 transitions. [2022-04-27 20:31:09,007 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 615 transitions. Word has length 22 [2022-04-27 20:31:09,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:09,008 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 615 transitions. [2022-04-27 20:31:09,008 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:09,008 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 615 transitions. [2022-04-27 20:31:09,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 20:31:09,008 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:09,008 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, 1] [2022-04-27 20:31:09,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 20:31:09,009 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:09,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:09,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1911180104, now seen corresponding path program 1 times [2022-04-27 20:31:09,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:09,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139061279] [2022-04-27 20:31:09,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:09,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:09,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:09,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {7738#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {7732#true} is VALID [2022-04-27 20:31:09,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {7732#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7732#true} is VALID [2022-04-27 20:31:09,049 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7732#true} {7732#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7732#true} is VALID [2022-04-27 20:31:09,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {7732#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7738#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:09,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {7738#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {7732#true} is VALID [2022-04-27 20:31:09,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {7732#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7732#true} is VALID [2022-04-27 20:31:09,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7732#true} {7732#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7732#true} is VALID [2022-04-27 20:31:09,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {7732#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7732#true} is VALID [2022-04-27 20:31:09,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {7732#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, 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_2, main_~lk7~0=v_main_~lk7~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_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {7732#true} is VALID [2022-04-27 20:31:09,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {7732#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {7732#true} is VALID [2022-04-27 20:31:09,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {7732#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk8~0, main_~lk7~0] {7732#true} is VALID [2022-04-27 20:31:09,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {7732#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {7732#true} is VALID [2022-04-27 20:31:09,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {7732#true} [185] L58-2-->L62-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[] {7732#true} is VALID [2022-04-27 20:31:09,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {7732#true} [187] L62-1-->L66-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[] {7732#true} is VALID [2022-04-27 20:31:09,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {7732#true} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {7737#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:31:09,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {7737#(not (= main_~p4~0 0))} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {7737#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:31:09,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {7737#(not (= main_~p4~0 0))} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 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_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {7737#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:31:09,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {7737#(not (= main_~p4~0 0))} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {7737#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:31:09,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {7737#(not (= main_~p4~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {7737#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:31:09,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {7737#(not (= main_~p4~0 0))} [199] L86-1-->L92-1: Formula: (= 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[] {7737#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:31:09,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {7737#(not (= main_~p4~0 0))} [203] L92-1-->L97-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[] {7737#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:31:09,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {7737#(not (= main_~p4~0 0))} [209] L97-1-->L102-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[] {7737#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:31:09,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {7737#(not (= main_~p4~0 0))} [213] L102-1-->L107-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[] {7733#false} is VALID [2022-04-27 20:31:09,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {7733#false} [216] L107-1-->L113: Formula: (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} AuxVars[] AssignedVars[] {7733#false} is VALID [2022-04-27 20:31:09,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {7733#false} [218] L113-->L128-1: Formula: (not (= v_main_~lk5~0_4 1)) InVars {main_~lk5~0=v_main_~lk5~0_4} OutVars{main_~lk5~0=v_main_~lk5~0_4} AuxVars[] AssignedVars[] {7733#false} is VALID [2022-04-27 20:31:09,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {7733#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7733#false} is VALID [2022-04-27 20:31:09,055 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:09,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:09,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139061279] [2022-04-27 20:31:09,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139061279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:09,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:09,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:09,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544154606] [2022-04-27 20:31:09,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:09,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-27 20:31:09,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:09,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:09,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:09,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:09,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:09,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:09,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:09,068 INFO L87 Difference]: Start difference. First operand 401 states and 615 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:09,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:09,173 INFO L93 Difference]: Finished difference Result 411 states and 616 transitions. [2022-04-27 20:31:09,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:09,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-27 20:31:09,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:09,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-04-27 20:31:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-04-27 20:31:09,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 98 transitions. [2022-04-27 20:31:09,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:09,237 INFO L225 Difference]: With dead ends: 411 [2022-04-27 20:31:09,237 INFO L226 Difference]: Without dead ends: 411 [2022-04-27 20:31:09,237 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:09,238 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 102 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:09,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 84 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:09,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-04-27 20:31:09,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2022-04-27 20:31:09,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:09,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.511111111111111) internal successors, (612), 405 states have internal predecessors, (612), 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:09,244 INFO L74 IsIncluded]: Start isIncluded. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.511111111111111) internal successors, (612), 405 states have internal predecessors, (612), 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:09,244 INFO L87 Difference]: Start difference. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.511111111111111) internal successors, (612), 405 states have internal predecessors, (612), 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:09,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:09,251 INFO L93 Difference]: Finished difference Result 411 states and 616 transitions. [2022-04-27 20:31:09,251 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 616 transitions. [2022-04-27 20:31:09,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:09,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:09,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 409 states, 405 states have (on average 1.511111111111111) internal successors, (612), 405 states have internal predecessors, (612), 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 411 states. [2022-04-27 20:31:09,253 INFO L87 Difference]: Start difference. First operand has 409 states, 405 states have (on average 1.511111111111111) internal successors, (612), 405 states have internal predecessors, (612), 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 411 states. [2022-04-27 20:31:09,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:09,260 INFO L93 Difference]: Finished difference Result 411 states and 616 transitions. [2022-04-27 20:31:09,260 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 616 transitions. [2022-04-27 20:31:09,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:09,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:09,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:09,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:09,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 405 states have (on average 1.511111111111111) internal successors, (612), 405 states have internal predecessors, (612), 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:09,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 615 transitions. [2022-04-27 20:31:09,268 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 615 transitions. Word has length 23 [2022-04-27 20:31:09,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:09,268 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 615 transitions. [2022-04-27 20:31:09,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 615 transitions. [2022-04-27 20:31:09,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 20:31:09,269 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:09,269 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, 1] [2022-04-27 20:31:09,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 20:31:09,269 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:09,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:09,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1782097385, now seen corresponding path program 1 times [2022-04-27 20:31:09,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:09,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588619896] [2022-04-27 20:31:09,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:09,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:09,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:09,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {9392#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {9386#true} is VALID [2022-04-27 20:31:09,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {9386#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9386#true} is VALID [2022-04-27 20:31:09,296 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9386#true} {9386#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9386#true} is VALID [2022-04-27 20:31:09,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {9386#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9392#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:09,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {9392#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {9386#true} is VALID [2022-04-27 20:31:09,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {9386#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9386#true} is VALID [2022-04-27 20:31:09,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9386#true} {9386#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9386#true} is VALID [2022-04-27 20:31:09,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {9386#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9386#true} is VALID [2022-04-27 20:31:09,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {9386#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, 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_2, main_~lk7~0=v_main_~lk7~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_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {9386#true} is VALID [2022-04-27 20:31:09,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {9386#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {9386#true} is VALID [2022-04-27 20:31:09,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {9386#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk8~0, main_~lk7~0] {9386#true} is VALID [2022-04-27 20:31:09,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {9386#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {9386#true} is VALID [2022-04-27 20:31:09,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {9386#true} [185] L58-2-->L62-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[] {9386#true} is VALID [2022-04-27 20:31:09,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {9386#true} [187] L62-1-->L66-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[] {9386#true} is VALID [2022-04-27 20:31:09,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {9386#true} [189] L66-1-->L70-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[] {9386#true} is VALID [2022-04-27 20:31:09,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {9386#true} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {9391#(= main_~lk5~0 1)} is VALID [2022-04-27 20:31:09,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {9391#(= main_~lk5~0 1)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 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_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {9391#(= main_~lk5~0 1)} is VALID [2022-04-27 20:31:09,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {9391#(= main_~lk5~0 1)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {9391#(= main_~lk5~0 1)} is VALID [2022-04-27 20:31:09,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {9391#(= main_~lk5~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {9391#(= main_~lk5~0 1)} is VALID [2022-04-27 20:31:09,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {9391#(= main_~lk5~0 1)} [199] L86-1-->L92-1: Formula: (= 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[] {9391#(= main_~lk5~0 1)} is VALID [2022-04-27 20:31:09,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {9391#(= main_~lk5~0 1)} [203] L92-1-->L97-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[] {9391#(= main_~lk5~0 1)} is VALID [2022-04-27 20:31:09,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {9391#(= main_~lk5~0 1)} [209] L97-1-->L102-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[] {9391#(= main_~lk5~0 1)} is VALID [2022-04-27 20:31:09,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {9391#(= main_~lk5~0 1)} [213] L102-1-->L107-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[] {9391#(= main_~lk5~0 1)} is VALID [2022-04-27 20:31:09,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {9391#(= main_~lk5~0 1)} [216] L107-1-->L113: Formula: (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} AuxVars[] AssignedVars[] {9391#(= main_~lk5~0 1)} is VALID [2022-04-27 20:31:09,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {9391#(= main_~lk5~0 1)} [218] L113-->L128-1: Formula: (not (= v_main_~lk5~0_4 1)) InVars {main_~lk5~0=v_main_~lk5~0_4} OutVars{main_~lk5~0=v_main_~lk5~0_4} AuxVars[] AssignedVars[] {9387#false} is VALID [2022-04-27 20:31:09,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {9387#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9387#false} is VALID [2022-04-27 20:31:09,301 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:09,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:09,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588619896] [2022-04-27 20:31:09,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588619896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:09,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:09,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:09,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248142135] [2022-04-27 20:31:09,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:09,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-27 20:31:09,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:09,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:09,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:09,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:09,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:09,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:09,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:09,313 INFO L87 Difference]: Start difference. First operand 409 states and 615 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:09,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:09,427 INFO L93 Difference]: Finished difference Result 715 states and 1080 transitions. [2022-04-27 20:31:09,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:09,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-27 20:31:09,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:09,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:09,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-04-27 20:31:09,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:09,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-04-27 20:31:09,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 90 transitions. [2022-04-27 20:31:09,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:09,494 INFO L225 Difference]: With dead ends: 715 [2022-04-27 20:31:09,495 INFO L226 Difference]: Without dead ends: 715 [2022-04-27 20:31:09,495 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:09,495 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:09,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 62 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:09,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-04-27 20:31:09,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 585. [2022-04-27 20:31:09,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:09,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.4664371772805507) internal successors, (852), 581 states have internal predecessors, (852), 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:09,504 INFO L74 IsIncluded]: Start isIncluded. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.4664371772805507) internal successors, (852), 581 states have internal predecessors, (852), 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:09,505 INFO L87 Difference]: Start difference. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.4664371772805507) internal successors, (852), 581 states have internal predecessors, (852), 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:09,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:09,520 INFO L93 Difference]: Finished difference Result 715 states and 1080 transitions. [2022-04-27 20:31:09,520 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1080 transitions. [2022-04-27 20:31:09,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:09,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:09,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 585 states, 581 states have (on average 1.4664371772805507) internal successors, (852), 581 states have internal predecessors, (852), 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 715 states. [2022-04-27 20:31:09,522 INFO L87 Difference]: Start difference. First operand has 585 states, 581 states have (on average 1.4664371772805507) internal successors, (852), 581 states have internal predecessors, (852), 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 715 states. [2022-04-27 20:31:09,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:09,538 INFO L93 Difference]: Finished difference Result 715 states and 1080 transitions. [2022-04-27 20:31:09,538 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1080 transitions. [2022-04-27 20:31:09,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:09,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:09,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:09,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:09,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 581 states have (on average 1.4664371772805507) internal successors, (852), 581 states have internal predecessors, (852), 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:09,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 855 transitions. [2022-04-27 20:31:09,551 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 855 transitions. Word has length 23 [2022-04-27 20:31:09,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:09,551 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 855 transitions. [2022-04-27 20:31:09,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:09,551 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 855 transitions. [2022-04-27 20:31:09,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 20:31:09,552 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:09,552 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, 1] [2022-04-27 20:31:09,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 20:31:09,552 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:09,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:09,552 INFO L85 PathProgramCache]: Analyzing trace with hash 715918552, now seen corresponding path program 1 times [2022-04-27 20:31:09,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:09,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423840015] [2022-04-27 20:31:09,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:09,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:09,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:09,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {12134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {12128#true} is VALID [2022-04-27 20:31:09,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {12128#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12128#true} is VALID [2022-04-27 20:31:09,580 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12128#true} {12128#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12128#true} is VALID [2022-04-27 20:31:09,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {12128#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:09,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {12134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {12128#true} is VALID [2022-04-27 20:31:09,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {12128#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12128#true} is VALID [2022-04-27 20:31:09,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12128#true} {12128#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12128#true} is VALID [2022-04-27 20:31:09,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {12128#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12128#true} is VALID [2022-04-27 20:31:09,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {12128#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, 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_2, main_~lk7~0=v_main_~lk7~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_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {12128#true} is VALID [2022-04-27 20:31:09,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {12128#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {12128#true} is VALID [2022-04-27 20:31:09,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {12128#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk8~0, main_~lk7~0] {12128#true} is VALID [2022-04-27 20:31:09,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {12128#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {12128#true} is VALID [2022-04-27 20:31:09,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {12128#true} [185] L58-2-->L62-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[] {12128#true} is VALID [2022-04-27 20:31:09,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {12128#true} [187] L62-1-->L66-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[] {12128#true} is VALID [2022-04-27 20:31:09,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {12128#true} [189] L66-1-->L70-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[] {12128#true} is VALID [2022-04-27 20:31:09,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {12128#true} [191] L70-1-->L74-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[] {12133#(= main_~p5~0 0)} is VALID [2022-04-27 20:31:09,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {12133#(= main_~p5~0 0)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 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_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {12133#(= main_~p5~0 0)} is VALID [2022-04-27 20:31:09,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {12133#(= main_~p5~0 0)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {12133#(= main_~p5~0 0)} is VALID [2022-04-27 20:31:09,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {12133#(= main_~p5~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {12133#(= main_~p5~0 0)} is VALID [2022-04-27 20:31:09,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {12133#(= main_~p5~0 0)} [199] L86-1-->L92-1: Formula: (= 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[] {12133#(= main_~p5~0 0)} is VALID [2022-04-27 20:31:09,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {12133#(= main_~p5~0 0)} [203] L92-1-->L97-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[] {12133#(= main_~p5~0 0)} is VALID [2022-04-27 20:31:09,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {12133#(= main_~p5~0 0)} [209] L97-1-->L102-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[] {12133#(= main_~p5~0 0)} is VALID [2022-04-27 20:31:09,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {12133#(= main_~p5~0 0)} [213] L102-1-->L107-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[] {12133#(= main_~p5~0 0)} is VALID [2022-04-27 20:31:09,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {12133#(= main_~p5~0 0)} [216] L107-1-->L113: Formula: (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} AuxVars[] AssignedVars[] {12129#false} is VALID [2022-04-27 20:31:09,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {12129#false} [218] L113-->L128-1: Formula: (not (= v_main_~lk5~0_4 1)) InVars {main_~lk5~0=v_main_~lk5~0_4} OutVars{main_~lk5~0=v_main_~lk5~0_4} AuxVars[] AssignedVars[] {12129#false} is VALID [2022-04-27 20:31:09,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {12129#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12129#false} is VALID [2022-04-27 20:31:09,584 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:09,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:09,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423840015] [2022-04-27 20:31:09,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423840015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:09,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:09,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:09,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217509774] [2022-04-27 20:31:09,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:09,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-27 20:31:09,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:09,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:09,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:09,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:09,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:09,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:09,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:09,597 INFO L87 Difference]: Start difference. First operand 585 states and 855 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:09,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:09,713 INFO L93 Difference]: Finished difference Result 779 states and 1112 transitions. [2022-04-27 20:31:09,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:09,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-27 20:31:09,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:09,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:09,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-04-27 20:31:09,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:09,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-04-27 20:31:09,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 97 transitions. [2022-04-27 20:31:09,771 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:31:09,790 INFO L225 Difference]: With dead ends: 779 [2022-04-27 20:31:09,790 INFO L226 Difference]: Without dead ends: 779 [2022-04-27 20:31:09,790 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:09,791 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 94 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:09,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 87 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:09,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-04-27 20:31:09,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 777. [2022-04-27 20:31:09,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:09,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4333764553686934) internal successors, (1108), 773 states have internal predecessors, (1108), 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:09,801 INFO L74 IsIncluded]: Start isIncluded. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4333764553686934) internal successors, (1108), 773 states have internal predecessors, (1108), 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:09,802 INFO L87 Difference]: Start difference. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4333764553686934) internal successors, (1108), 773 states have internal predecessors, (1108), 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:09,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:09,821 INFO L93 Difference]: Finished difference Result 779 states and 1112 transitions. [2022-04-27 20:31:09,821 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1112 transitions. [2022-04-27 20:31:09,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:09,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:09,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 777 states, 773 states have (on average 1.4333764553686934) internal successors, (1108), 773 states have internal predecessors, (1108), 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 779 states. [2022-04-27 20:31:09,823 INFO L87 Difference]: Start difference. First operand has 777 states, 773 states have (on average 1.4333764553686934) internal successors, (1108), 773 states have internal predecessors, (1108), 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 779 states. [2022-04-27 20:31:09,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:09,843 INFO L93 Difference]: Finished difference Result 779 states and 1112 transitions. [2022-04-27 20:31:09,843 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1112 transitions. [2022-04-27 20:31:09,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:09,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:09,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:09,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 773 states have (on average 1.4333764553686934) internal successors, (1108), 773 states have internal predecessors, (1108), 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:09,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1111 transitions. [2022-04-27 20:31:09,864 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1111 transitions. Word has length 23 [2022-04-27 20:31:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:09,864 INFO L495 AbstractCegarLoop]: Abstraction has 777 states and 1111 transitions. [2022-04-27 20:31:09,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:09,864 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1111 transitions. [2022-04-27 20:31:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 20:31:09,865 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:09,865 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, 1, 1] [2022-04-27 20:31:09,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 20:31:09,865 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:09,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:09,865 INFO L85 PathProgramCache]: Analyzing trace with hash 589588388, now seen corresponding path program 1 times [2022-04-27 20:31:09,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:09,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135093244] [2022-04-27 20:31:09,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:09,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:09,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:09,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {15260#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {15254#true} is VALID [2022-04-27 20:31:09,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {15254#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15254#true} is VALID [2022-04-27 20:31:09,892 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15254#true} {15254#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15254#true} is VALID [2022-04-27 20:31:09,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {15254#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15260#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:09,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {15260#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {15254#true} is VALID [2022-04-27 20:31:09,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {15254#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15254#true} is VALID [2022-04-27 20:31:09,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15254#true} {15254#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15254#true} is VALID [2022-04-27 20:31:09,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {15254#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15254#true} is VALID [2022-04-27 20:31:09,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {15254#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, 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_2, main_~lk7~0=v_main_~lk7~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_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {15254#true} is VALID [2022-04-27 20:31:09,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {15254#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {15254#true} is VALID [2022-04-27 20:31:09,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {15254#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk8~0, main_~lk7~0] {15254#true} is VALID [2022-04-27 20:31:09,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {15254#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {15254#true} is VALID [2022-04-27 20:31:09,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {15254#true} [185] L58-2-->L62-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[] {15254#true} is VALID [2022-04-27 20:31:09,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {15254#true} [187] L62-1-->L66-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[] {15254#true} is VALID [2022-04-27 20:31:09,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {15254#true} [189] L66-1-->L70-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[] {15254#true} is VALID [2022-04-27 20:31:09,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {15254#true} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {15259#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:31:09,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {15259#(not (= main_~p5~0 0))} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 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_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {15259#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:31:09,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {15259#(not (= main_~p5~0 0))} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {15259#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:31:09,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {15259#(not (= main_~p5~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {15259#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:31:09,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {15259#(not (= main_~p5~0 0))} [199] L86-1-->L92-1: Formula: (= 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[] {15259#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:31:09,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {15259#(not (= main_~p5~0 0))} [203] L92-1-->L97-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[] {15259#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:31:09,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {15259#(not (= main_~p5~0 0))} [209] L97-1-->L102-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[] {15259#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:31:09,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {15259#(not (= main_~p5~0 0))} [213] L102-1-->L107-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[] {15259#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:31:09,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {15259#(not (= main_~p5~0 0))} [217] L107-1-->L112-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[] {15255#false} is VALID [2022-04-27 20:31:09,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {15255#false} [220] L112-1-->L118: Formula: (not (= v_main_~p6~0_5 0)) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {15255#false} is VALID [2022-04-27 20:31:09,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {15255#false} [222] L118-->L128-1: Formula: (not (= v_main_~lk6~0_1 1)) InVars {main_~lk6~0=v_main_~lk6~0_1} OutVars{main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[] {15255#false} is VALID [2022-04-27 20:31:09,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {15255#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15255#false} is VALID [2022-04-27 20:31:09,896 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:09,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:09,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135093244] [2022-04-27 20:31:09,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135093244] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:09,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:09,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:09,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112907987] [2022-04-27 20:31:09,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:09,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-27 20:31:09,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:09,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:09,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:09,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:09,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:09,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:09,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:09,909 INFO L87 Difference]: Start difference. First operand 777 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:10,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:10,025 INFO L93 Difference]: Finished difference Result 795 states and 1112 transitions. [2022-04-27 20:31:10,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:10,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-27 20:31:10,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:10,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-04-27 20:31:10,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-04-27 20:31:10,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 96 transitions. [2022-04-27 20:31:10,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:10,100 INFO L225 Difference]: With dead ends: 795 [2022-04-27 20:31:10,100 INFO L226 Difference]: Without dead ends: 795 [2022-04-27 20:31:10,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:10,101 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 101 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:10,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 81 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:10,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-04-27 20:31:10,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 793. [2022-04-27 20:31:10,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:10,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4043092522179974) internal successors, (1108), 789 states have internal predecessors, (1108), 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:10,111 INFO L74 IsIncluded]: Start isIncluded. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4043092522179974) internal successors, (1108), 789 states have internal predecessors, (1108), 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:10,112 INFO L87 Difference]: Start difference. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4043092522179974) internal successors, (1108), 789 states have internal predecessors, (1108), 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:10,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:10,131 INFO L93 Difference]: Finished difference Result 795 states and 1112 transitions. [2022-04-27 20:31:10,131 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1112 transitions. [2022-04-27 20:31:10,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:10,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:10,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 793 states, 789 states have (on average 1.4043092522179974) internal successors, (1108), 789 states have internal predecessors, (1108), 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 795 states. [2022-04-27 20:31:10,134 INFO L87 Difference]: Start difference. First operand has 793 states, 789 states have (on average 1.4043092522179974) internal successors, (1108), 789 states have internal predecessors, (1108), 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 795 states. [2022-04-27 20:31:10,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:10,154 INFO L93 Difference]: Finished difference Result 795 states and 1112 transitions. [2022-04-27 20:31:10,154 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1112 transitions. [2022-04-27 20:31:10,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:10,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:10,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:10,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 789 states have (on average 1.4043092522179974) internal successors, (1108), 789 states have internal predecessors, (1108), 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:10,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1111 transitions. [2022-04-27 20:31:10,175 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1111 transitions. Word has length 24 [2022-04-27 20:31:10,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:10,176 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 1111 transitions. [2022-04-27 20:31:10,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1111 transitions. [2022-04-27 20:31:10,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 20:31:10,176 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:10,176 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, 1, 1] [2022-04-27 20:31:10,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 20:31:10,177 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:10,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:10,177 INFO L85 PathProgramCache]: Analyzing trace with hash 718671107, now seen corresponding path program 1 times [2022-04-27 20:31:10,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:10,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019313372] [2022-04-27 20:31:10,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:10,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:10,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:10,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {18450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {18444#true} is VALID [2022-04-27 20:31:10,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {18444#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18444#true} is VALID [2022-04-27 20:31:10,206 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18444#true} {18444#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18444#true} is VALID [2022-04-27 20:31:10,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {18444#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:10,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {18450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {18444#true} is VALID [2022-04-27 20:31:10,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {18444#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18444#true} is VALID [2022-04-27 20:31:10,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18444#true} {18444#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18444#true} is VALID [2022-04-27 20:31:10,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {18444#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18444#true} is VALID [2022-04-27 20:31:10,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {18444#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, 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_2, main_~lk7~0=v_main_~lk7~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_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {18444#true} is VALID [2022-04-27 20:31:10,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {18444#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {18444#true} is VALID [2022-04-27 20:31:10,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {18444#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk8~0, main_~lk7~0] {18444#true} is VALID [2022-04-27 20:31:10,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {18444#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {18444#true} is VALID [2022-04-27 20:31:10,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {18444#true} [185] L58-2-->L62-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[] {18444#true} is VALID [2022-04-27 20:31:10,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {18444#true} [187] L62-1-->L66-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[] {18444#true} is VALID [2022-04-27 20:31:10,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {18444#true} [189] L66-1-->L70-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[] {18444#true} is VALID [2022-04-27 20:31:10,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {18444#true} [191] L70-1-->L74-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[] {18444#true} is VALID [2022-04-27 20:31:10,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {18444#true} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 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_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {18449#(= main_~lk6~0 1)} is VALID [2022-04-27 20:31:10,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {18449#(= main_~lk6~0 1)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {18449#(= main_~lk6~0 1)} is VALID [2022-04-27 20:31:10,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {18449#(= main_~lk6~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {18449#(= main_~lk6~0 1)} is VALID [2022-04-27 20:31:10,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {18449#(= main_~lk6~0 1)} [199] L86-1-->L92-1: Formula: (= 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[] {18449#(= main_~lk6~0 1)} is VALID [2022-04-27 20:31:10,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {18449#(= main_~lk6~0 1)} [203] L92-1-->L97-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[] {18449#(= main_~lk6~0 1)} is VALID [2022-04-27 20:31:10,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {18449#(= main_~lk6~0 1)} [209] L97-1-->L102-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[] {18449#(= main_~lk6~0 1)} is VALID [2022-04-27 20:31:10,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {18449#(= main_~lk6~0 1)} [213] L102-1-->L107-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[] {18449#(= main_~lk6~0 1)} is VALID [2022-04-27 20:31:10,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {18449#(= main_~lk6~0 1)} [217] L107-1-->L112-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[] {18449#(= main_~lk6~0 1)} is VALID [2022-04-27 20:31:10,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {18449#(= main_~lk6~0 1)} [220] L112-1-->L118: Formula: (not (= v_main_~p6~0_5 0)) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {18449#(= main_~lk6~0 1)} is VALID [2022-04-27 20:31:10,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {18449#(= main_~lk6~0 1)} [222] L118-->L128-1: Formula: (not (= v_main_~lk6~0_1 1)) InVars {main_~lk6~0=v_main_~lk6~0_1} OutVars{main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[] {18445#false} is VALID [2022-04-27 20:31:10,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {18445#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18445#false} is VALID [2022-04-27 20:31:10,210 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:10,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:10,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019313372] [2022-04-27 20:31:10,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019313372] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:10,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:10,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:10,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105676376] [2022-04-27 20:31:10,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:10,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-27 20:31:10,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:10,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:10,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:10,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:10,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:10,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:10,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:10,223 INFO L87 Difference]: Start difference. First operand 793 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:10,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:10,364 INFO L93 Difference]: Finished difference Result 1355 states and 1896 transitions. [2022-04-27 20:31:10,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:10,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-27 20:31:10,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:10,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:10,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-04-27 20:31:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:10,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-04-27 20:31:10,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 86 transitions. [2022-04-27 20:31:10,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:10,460 INFO L225 Difference]: With dead ends: 1355 [2022-04-27 20:31:10,460 INFO L226 Difference]: Without dead ends: 1355 [2022-04-27 20:31:10,460 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:10,461 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 99 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 61 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.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:10,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 61 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:10,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-04-27 20:31:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1161. [2022-04-27 20:31:10,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:10,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.3586862575626621) internal successors, (1572), 1157 states have internal predecessors, (1572), 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:10,476 INFO L74 IsIncluded]: Start isIncluded. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.3586862575626621) internal successors, (1572), 1157 states have internal predecessors, (1572), 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:10,477 INFO L87 Difference]: Start difference. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.3586862575626621) internal successors, (1572), 1157 states have internal predecessors, (1572), 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:10,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:10,523 INFO L93 Difference]: Finished difference Result 1355 states and 1896 transitions. [2022-04-27 20:31:10,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1896 transitions. [2022-04-27 20:31:10,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:10,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:10,526 INFO L74 IsIncluded]: Start isIncluded. First operand has 1161 states, 1157 states have (on average 1.3586862575626621) internal successors, (1572), 1157 states have internal predecessors, (1572), 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 1355 states. [2022-04-27 20:31:10,527 INFO L87 Difference]: Start difference. First operand has 1161 states, 1157 states have (on average 1.3586862575626621) internal successors, (1572), 1157 states have internal predecessors, (1572), 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 1355 states. [2022-04-27 20:31:10,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:10,573 INFO L93 Difference]: Finished difference Result 1355 states and 1896 transitions. [2022-04-27 20:31:10,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1896 transitions. [2022-04-27 20:31:10,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:10,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:10,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:10,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:10,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1157 states have (on average 1.3586862575626621) internal successors, (1572), 1157 states have internal predecessors, (1572), 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:10,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1575 transitions. [2022-04-27 20:31:10,612 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1575 transitions. Word has length 24 [2022-04-27 20:31:10,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:10,612 INFO L495 AbstractCegarLoop]: Abstraction has 1161 states and 1575 transitions. [2022-04-27 20:31:10,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:10,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1575 transitions. [2022-04-27 20:31:10,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 20:31:10,614 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:10,614 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, 1, 1] [2022-04-27 20:31:10,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 20:31:10,614 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:10,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:10,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1078280252, now seen corresponding path program 1 times [2022-04-27 20:31:10,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:10,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748308355] [2022-04-27 20:31:10,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:10,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:10,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:10,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {23688#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {23682#true} is VALID [2022-04-27 20:31:10,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {23682#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23682#true} is VALID [2022-04-27 20:31:10,644 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23682#true} {23682#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23682#true} is VALID [2022-04-27 20:31:10,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {23682#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23688#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:10,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {23688#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {23682#true} is VALID [2022-04-27 20:31:10,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {23682#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23682#true} is VALID [2022-04-27 20:31:10,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23682#true} {23682#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23682#true} is VALID [2022-04-27 20:31:10,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {23682#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23682#true} is VALID [2022-04-27 20:31:10,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {23682#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, 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_2, main_~lk7~0=v_main_~lk7~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_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {23682#true} is VALID [2022-04-27 20:31:10,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {23682#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {23682#true} is VALID [2022-04-27 20:31:10,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {23682#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk8~0, main_~lk7~0] {23682#true} is VALID [2022-04-27 20:31:10,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {23682#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {23682#true} is VALID [2022-04-27 20:31:10,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {23682#true} [185] L58-2-->L62-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[] {23682#true} is VALID [2022-04-27 20:31:10,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {23682#true} [187] L62-1-->L66-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[] {23682#true} is VALID [2022-04-27 20:31:10,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {23682#true} [189] L66-1-->L70-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[] {23682#true} is VALID [2022-04-27 20:31:10,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {23682#true} [191] L70-1-->L74-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[] {23682#true} is VALID [2022-04-27 20:31:10,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {23682#true} [193] L74-1-->L78-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[] {23687#(= main_~p6~0 0)} is VALID [2022-04-27 20:31:10,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {23687#(= main_~p6~0 0)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {23687#(= main_~p6~0 0)} is VALID [2022-04-27 20:31:10,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {23687#(= main_~p6~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {23687#(= main_~p6~0 0)} is VALID [2022-04-27 20:31:10,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {23687#(= main_~p6~0 0)} [199] L86-1-->L92-1: Formula: (= 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[] {23687#(= main_~p6~0 0)} is VALID [2022-04-27 20:31:10,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {23687#(= main_~p6~0 0)} [203] L92-1-->L97-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[] {23687#(= main_~p6~0 0)} is VALID [2022-04-27 20:31:10,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {23687#(= main_~p6~0 0)} [209] L97-1-->L102-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[] {23687#(= main_~p6~0 0)} is VALID [2022-04-27 20:31:10,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {23687#(= main_~p6~0 0)} [213] L102-1-->L107-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[] {23687#(= main_~p6~0 0)} is VALID [2022-04-27 20:31:10,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {23687#(= main_~p6~0 0)} [217] L107-1-->L112-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[] {23687#(= main_~p6~0 0)} is VALID [2022-04-27 20:31:10,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {23687#(= main_~p6~0 0)} [220] L112-1-->L118: Formula: (not (= v_main_~p6~0_5 0)) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {23683#false} is VALID [2022-04-27 20:31:10,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {23683#false} [222] L118-->L128-1: Formula: (not (= v_main_~lk6~0_1 1)) InVars {main_~lk6~0=v_main_~lk6~0_1} OutVars{main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[] {23683#false} is VALID [2022-04-27 20:31:10,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {23683#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23683#false} is VALID [2022-04-27 20:31:10,648 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:10,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:10,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748308355] [2022-04-27 20:31:10,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748308355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:10,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:10,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:10,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883034728] [2022-04-27 20:31:10,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:10,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-27 20:31:10,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:10,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:10,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:10,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:10,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:10,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:10,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:10,661 INFO L87 Difference]: Start difference. First operand 1161 states and 1575 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:10,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:10,807 INFO L93 Difference]: Finished difference Result 1515 states and 1992 transitions. [2022-04-27 20:31:10,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:10,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-27 20:31:10,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:10,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:10,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-27 20:31:10,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:10,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-27 20:31:10,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 95 transitions. [2022-04-27 20:31:10,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:10,920 INFO L225 Difference]: With dead ends: 1515 [2022-04-27 20:31:10,920 INFO L226 Difference]: Without dead ends: 1515 [2022-04-27 20:31:10,920 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:10,921 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:10,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 89 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:10,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2022-04-27 20:31:10,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1513. [2022-04-27 20:31:10,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:10,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.317428760768721) internal successors, (1988), 1509 states have internal predecessors, (1988), 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:10,943 INFO L74 IsIncluded]: Start isIncluded. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.317428760768721) internal successors, (1988), 1509 states have internal predecessors, (1988), 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:10,944 INFO L87 Difference]: Start difference. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.317428760768721) internal successors, (1988), 1509 states have internal predecessors, (1988), 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:11,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:11,001 INFO L93 Difference]: Finished difference Result 1515 states and 1992 transitions. [2022-04-27 20:31:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1992 transitions. [2022-04-27 20:31:11,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:11,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:11,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 1513 states, 1509 states have (on average 1.317428760768721) internal successors, (1988), 1509 states have internal predecessors, (1988), 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 1515 states. [2022-04-27 20:31:11,005 INFO L87 Difference]: Start difference. First operand has 1513 states, 1509 states have (on average 1.317428760768721) internal successors, (1988), 1509 states have internal predecessors, (1988), 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 1515 states. [2022-04-27 20:31:11,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:11,061 INFO L93 Difference]: Finished difference Result 1515 states and 1992 transitions. [2022-04-27 20:31:11,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1992 transitions. [2022-04-27 20:31:11,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:11,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:11,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:11,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:11,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1509 states have (on average 1.317428760768721) internal successors, (1988), 1509 states have internal predecessors, (1988), 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:11,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1991 transitions. [2022-04-27 20:31:11,119 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1991 transitions. Word has length 24 [2022-04-27 20:31:11,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:11,119 INFO L495 AbstractCegarLoop]: Abstraction has 1513 states and 1991 transitions. [2022-04-27 20:31:11,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:11,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1991 transitions. [2022-04-27 20:31:11,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 20:31:11,121 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:11,121 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, 1, 1, 1] [2022-04-27 20:31:11,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 20:31:11,121 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:11,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:11,121 INFO L85 PathProgramCache]: Analyzing trace with hash 804000436, now seen corresponding path program 1 times [2022-04-27 20:31:11,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:11,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818774734] [2022-04-27 20:31:11,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:11,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:11,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:11,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {29758#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {29752#true} is VALID [2022-04-27 20:31:11,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {29752#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29752#true} is VALID [2022-04-27 20:31:11,143 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29752#true} {29752#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29752#true} is VALID [2022-04-27 20:31:11,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {29752#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29758#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:11,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {29758#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {29752#true} is VALID [2022-04-27 20:31:11,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {29752#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29752#true} is VALID [2022-04-27 20:31:11,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29752#true} {29752#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29752#true} is VALID [2022-04-27 20:31:11,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {29752#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29752#true} is VALID [2022-04-27 20:31:11,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {29752#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, 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_2, main_~lk7~0=v_main_~lk7~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_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {29752#true} is VALID [2022-04-27 20:31:11,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {29752#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {29752#true} is VALID [2022-04-27 20:31:11,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {29752#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk8~0, main_~lk7~0] {29752#true} is VALID [2022-04-27 20:31:11,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {29752#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {29752#true} is VALID [2022-04-27 20:31:11,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {29752#true} [185] L58-2-->L62-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[] {29752#true} is VALID [2022-04-27 20:31:11,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {29752#true} [187] L62-1-->L66-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[] {29752#true} is VALID [2022-04-27 20:31:11,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {29752#true} [189] L66-1-->L70-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[] {29752#true} is VALID [2022-04-27 20:31:11,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {29752#true} [191] L70-1-->L74-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[] {29752#true} is VALID [2022-04-27 20:31:11,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {29752#true} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 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_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {29757#(not (= main_~p6~0 0))} is VALID [2022-04-27 20:31:11,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {29757#(not (= main_~p6~0 0))} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {29757#(not (= main_~p6~0 0))} is VALID [2022-04-27 20:31:11,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {29757#(not (= main_~p6~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {29757#(not (= main_~p6~0 0))} is VALID [2022-04-27 20:31:11,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {29757#(not (= main_~p6~0 0))} [199] L86-1-->L92-1: Formula: (= 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[] {29757#(not (= main_~p6~0 0))} is VALID [2022-04-27 20:31:11,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {29757#(not (= main_~p6~0 0))} [203] L92-1-->L97-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[] {29757#(not (= main_~p6~0 0))} is VALID [2022-04-27 20:31:11,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {29757#(not (= main_~p6~0 0))} [209] L97-1-->L102-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[] {29757#(not (= main_~p6~0 0))} is VALID [2022-04-27 20:31:11,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {29757#(not (= main_~p6~0 0))} [213] L102-1-->L107-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[] {29757#(not (= main_~p6~0 0))} is VALID [2022-04-27 20:31:11,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {29757#(not (= main_~p6~0 0))} [217] L107-1-->L112-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[] {29757#(not (= main_~p6~0 0))} is VALID [2022-04-27 20:31:11,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {29757#(not (= main_~p6~0 0))} [221] L112-1-->L117-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {29753#false} is VALID [2022-04-27 20:31:11,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {29753#false} [224] L117-1-->L123: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {29753#false} is VALID [2022-04-27 20:31:11,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {29753#false} [226] L123-->L128-1: Formula: (not (= v_main_~lk7~0_2 1)) InVars {main_~lk7~0=v_main_~lk7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_2} AuxVars[] AssignedVars[] {29753#false} is VALID [2022-04-27 20:31:11,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {29753#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29753#false} is VALID [2022-04-27 20:31:11,147 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:11,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:11,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818774734] [2022-04-27 20:31:11,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818774734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:11,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:11,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:11,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187916873] [2022-04-27 20:31:11,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:11,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 25 [2022-04-27 20:31:11,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:11,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:11,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:11,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:11,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:11,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:11,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:11,160 INFO L87 Difference]: Start difference. First operand 1513 states and 1991 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:11,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:11,326 INFO L93 Difference]: Finished difference Result 1547 states and 1992 transitions. [2022-04-27 20:31:11,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:11,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 25 [2022-04-27 20:31:11,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:11,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:11,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-27 20:31:11,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:11,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-27 20:31:11,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-27 20:31:11,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:11,465 INFO L225 Difference]: With dead ends: 1547 [2022-04-27 20:31:11,465 INFO L226 Difference]: Without dead ends: 1547 [2022-04-27 20:31:11,465 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:11,466 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:11,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 78 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:11,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2022-04-27 20:31:11,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1545. [2022-04-27 20:31:11,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:11,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.2900713822193381) internal successors, (1988), 1541 states have internal predecessors, (1988), 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:11,484 INFO L74 IsIncluded]: Start isIncluded. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.2900713822193381) internal successors, (1988), 1541 states have internal predecessors, (1988), 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:11,484 INFO L87 Difference]: Start difference. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.2900713822193381) internal successors, (1988), 1541 states have internal predecessors, (1988), 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:11,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:11,547 INFO L93 Difference]: Finished difference Result 1547 states and 1992 transitions. [2022-04-27 20:31:11,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 1992 transitions. [2022-04-27 20:31:11,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:11,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:11,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 1545 states, 1541 states have (on average 1.2900713822193381) internal successors, (1988), 1541 states have internal predecessors, (1988), 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 1547 states. [2022-04-27 20:31:11,551 INFO L87 Difference]: Start difference. First operand has 1545 states, 1541 states have (on average 1.2900713822193381) internal successors, (1988), 1541 states have internal predecessors, (1988), 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 1547 states. [2022-04-27 20:31:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:11,614 INFO L93 Difference]: Finished difference Result 1547 states and 1992 transitions. [2022-04-27 20:31:11,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 1992 transitions. [2022-04-27 20:31:11,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:11,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:11,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:11,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:11,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1541 states have (on average 1.2900713822193381) internal successors, (1988), 1541 states have internal predecessors, (1988), 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:11,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1991 transitions. [2022-04-27 20:31:11,681 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1991 transitions. Word has length 25 [2022-04-27 20:31:11,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:11,681 INFO L495 AbstractCegarLoop]: Abstraction has 1545 states and 1991 transitions. [2022-04-27 20:31:11,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:11,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1991 transitions. [2022-04-27 20:31:11,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 20:31:11,682 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:11,682 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, 1, 1, 1] [2022-04-27 20:31:11,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 20:31:11,683 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:11,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:11,683 INFO L85 PathProgramCache]: Analyzing trace with hash 933083155, now seen corresponding path program 1 times [2022-04-27 20:31:11,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:11,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304407463] [2022-04-27 20:31:11,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:11,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:11,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:11,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {35956#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {35950#true} is VALID [2022-04-27 20:31:11,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {35950#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35950#true} is VALID [2022-04-27 20:31:11,706 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35950#true} {35950#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35950#true} is VALID [2022-04-27 20:31:11,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {35950#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35956#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:11,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {35956#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {35950#true} is VALID [2022-04-27 20:31:11,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {35950#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35950#true} is VALID [2022-04-27 20:31:11,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35950#true} {35950#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35950#true} is VALID [2022-04-27 20:31:11,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {35950#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35950#true} is VALID [2022-04-27 20:31:11,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {35950#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, 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_2, main_~lk7~0=v_main_~lk7~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_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {35950#true} is VALID [2022-04-27 20:31:11,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {35950#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {35950#true} is VALID [2022-04-27 20:31:11,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {35950#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk8~0, main_~lk7~0] {35950#true} is VALID [2022-04-27 20:31:11,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {35950#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {35950#true} is VALID [2022-04-27 20:31:11,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {35950#true} [185] L58-2-->L62-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[] {35950#true} is VALID [2022-04-27 20:31:11,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {35950#true} [187] L62-1-->L66-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[] {35950#true} is VALID [2022-04-27 20:31:11,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {35950#true} [189] L66-1-->L70-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[] {35950#true} is VALID [2022-04-27 20:31:11,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {35950#true} [191] L70-1-->L74-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[] {35950#true} is VALID [2022-04-27 20:31:11,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {35950#true} [193] L74-1-->L78-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[] {35950#true} is VALID [2022-04-27 20:31:11,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {35950#true} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {35955#(= main_~lk7~0 1)} is VALID [2022-04-27 20:31:11,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {35955#(= main_~lk7~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {35955#(= main_~lk7~0 1)} is VALID [2022-04-27 20:31:11,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {35955#(= main_~lk7~0 1)} [199] L86-1-->L92-1: Formula: (= 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[] {35955#(= main_~lk7~0 1)} is VALID [2022-04-27 20:31:11,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {35955#(= main_~lk7~0 1)} [203] L92-1-->L97-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[] {35955#(= main_~lk7~0 1)} is VALID [2022-04-27 20:31:11,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {35955#(= main_~lk7~0 1)} [209] L97-1-->L102-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[] {35955#(= main_~lk7~0 1)} is VALID [2022-04-27 20:31:11,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {35955#(= main_~lk7~0 1)} [213] L102-1-->L107-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[] {35955#(= main_~lk7~0 1)} is VALID [2022-04-27 20:31:11,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {35955#(= main_~lk7~0 1)} [217] L107-1-->L112-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[] {35955#(= main_~lk7~0 1)} is VALID [2022-04-27 20:31:11,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {35955#(= main_~lk7~0 1)} [221] L112-1-->L117-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {35955#(= main_~lk7~0 1)} is VALID [2022-04-27 20:31:11,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {35955#(= main_~lk7~0 1)} [224] L117-1-->L123: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {35955#(= main_~lk7~0 1)} is VALID [2022-04-27 20:31:11,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {35955#(= main_~lk7~0 1)} [226] L123-->L128-1: Formula: (not (= v_main_~lk7~0_2 1)) InVars {main_~lk7~0=v_main_~lk7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_2} AuxVars[] AssignedVars[] {35951#false} is VALID [2022-04-27 20:31:11,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {35951#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35951#false} is VALID [2022-04-27 20:31:11,710 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:11,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:11,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304407463] [2022-04-27 20:31:11,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304407463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:11,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:11,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:11,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105289665] [2022-04-27 20:31:11,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:11,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 25 [2022-04-27 20:31:11,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:11,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:11,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:11,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:11,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:11,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:11,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:11,725 INFO L87 Difference]: Start difference. First operand 1545 states and 1991 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:11,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:11,990 INFO L93 Difference]: Finished difference Result 2571 states and 3272 transitions. [2022-04-27 20:31:11,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:11,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 25 [2022-04-27 20:31:11,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:11,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:11,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-04-27 20:31:11,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-04-27 20:31:11,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 82 transitions. [2022-04-27 20:31:12,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:12,196 INFO L225 Difference]: With dead ends: 2571 [2022-04-27 20:31:12,196 INFO L226 Difference]: Without dead ends: 2571 [2022-04-27 20:31:12,196 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:12,197 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 92 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:12,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 60 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:12,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2022-04-27 20:31:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2313. [2022-04-27 20:31:12,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:12,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2490255521870939) internal successors, (2884), 2309 states have internal predecessors, (2884), 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:12,225 INFO L74 IsIncluded]: Start isIncluded. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2490255521870939) internal successors, (2884), 2309 states have internal predecessors, (2884), 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:12,226 INFO L87 Difference]: Start difference. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2490255521870939) internal successors, (2884), 2309 states have internal predecessors, (2884), 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:12,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:12,373 INFO L93 Difference]: Finished difference Result 2571 states and 3272 transitions. [2022-04-27 20:31:12,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3272 transitions. [2022-04-27 20:31:12,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:12,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:12,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 2313 states, 2309 states have (on average 1.2490255521870939) internal successors, (2884), 2309 states have internal predecessors, (2884), 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 2571 states. [2022-04-27 20:31:12,379 INFO L87 Difference]: Start difference. First operand has 2313 states, 2309 states have (on average 1.2490255521870939) internal successors, (2884), 2309 states have internal predecessors, (2884), 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 2571 states. [2022-04-27 20:31:12,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:12,533 INFO L93 Difference]: Finished difference Result 2571 states and 3272 transitions. [2022-04-27 20:31:12,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3272 transitions. [2022-04-27 20:31:12,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:12,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:12,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:12,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:12,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2309 states have (on average 1.2490255521870939) internal successors, (2884), 2309 states have internal predecessors, (2884), 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:12,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 2887 transitions. [2022-04-27 20:31:12,671 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 2887 transitions. Word has length 25 [2022-04-27 20:31:12,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:12,671 INFO L495 AbstractCegarLoop]: Abstraction has 2313 states and 2887 transitions. [2022-04-27 20:31:12,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:12,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 2887 transitions. [2022-04-27 20:31:12,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 20:31:12,673 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:12,673 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, 1, 1, 1] [2022-04-27 20:31:12,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 20:31:12,673 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:12,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:12,674 INFO L85 PathProgramCache]: Analyzing trace with hash -863868204, now seen corresponding path program 1 times [2022-04-27 20:31:12,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:12,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178214144] [2022-04-27 20:31:12,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:12,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:12,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:12,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {45994#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {45988#true} is VALID [2022-04-27 20:31:12,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {45988#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45988#true} is VALID [2022-04-27 20:31:12,695 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45988#true} {45988#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45988#true} is VALID [2022-04-27 20:31:12,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {45988#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45994#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:12,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {45994#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {45988#true} is VALID [2022-04-27 20:31:12,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {45988#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45988#true} is VALID [2022-04-27 20:31:12,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45988#true} {45988#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45988#true} is VALID [2022-04-27 20:31:12,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {45988#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45988#true} is VALID [2022-04-27 20:31:12,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {45988#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, 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_2, main_~lk7~0=v_main_~lk7~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_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {45988#true} is VALID [2022-04-27 20:31:12,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {45988#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {45988#true} is VALID [2022-04-27 20:31:12,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {45988#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk8~0, main_~lk7~0] {45988#true} is VALID [2022-04-27 20:31:12,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {45988#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {45988#true} is VALID [2022-04-27 20:31:12,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {45988#true} [185] L58-2-->L62-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[] {45988#true} is VALID [2022-04-27 20:31:12,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {45988#true} [187] L62-1-->L66-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[] {45988#true} is VALID [2022-04-27 20:31:12,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {45988#true} [189] L66-1-->L70-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[] {45988#true} is VALID [2022-04-27 20:31:12,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {45988#true} [191] L70-1-->L74-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[] {45988#true} is VALID [2022-04-27 20:31:12,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {45988#true} [193] L74-1-->L78-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[] {45988#true} is VALID [2022-04-27 20:31:12,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {45988#true} [195] L78-1-->L82-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {45993#(= main_~p7~0 0)} is VALID [2022-04-27 20:31:12,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {45993#(= main_~p7~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {45993#(= main_~p7~0 0)} is VALID [2022-04-27 20:31:12,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {45993#(= main_~p7~0 0)} [199] L86-1-->L92-1: Formula: (= 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[] {45993#(= main_~p7~0 0)} is VALID [2022-04-27 20:31:12,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {45993#(= main_~p7~0 0)} [203] L92-1-->L97-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[] {45993#(= main_~p7~0 0)} is VALID [2022-04-27 20:31:12,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {45993#(= main_~p7~0 0)} [209] L97-1-->L102-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[] {45993#(= main_~p7~0 0)} is VALID [2022-04-27 20:31:12,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {45993#(= main_~p7~0 0)} [213] L102-1-->L107-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[] {45993#(= main_~p7~0 0)} is VALID [2022-04-27 20:31:12,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {45993#(= main_~p7~0 0)} [217] L107-1-->L112-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[] {45993#(= main_~p7~0 0)} is VALID [2022-04-27 20:31:12,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {45993#(= main_~p7~0 0)} [221] L112-1-->L117-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {45993#(= main_~p7~0 0)} is VALID [2022-04-27 20:31:12,699 INFO L290 TraceCheckUtils]: 22: Hoare triple {45993#(= main_~p7~0 0)} [224] L117-1-->L123: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {45989#false} is VALID [2022-04-27 20:31:12,699 INFO L290 TraceCheckUtils]: 23: Hoare triple {45989#false} [226] L123-->L128-1: Formula: (not (= v_main_~lk7~0_2 1)) InVars {main_~lk7~0=v_main_~lk7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_2} AuxVars[] AssignedVars[] {45989#false} is VALID [2022-04-27 20:31:12,699 INFO L290 TraceCheckUtils]: 24: Hoare triple {45989#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45989#false} is VALID [2022-04-27 20:31:12,699 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:12,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:12,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178214144] [2022-04-27 20:31:12,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178214144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:12,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:12,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:12,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302140898] [2022-04-27 20:31:12,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:12,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 25 [2022-04-27 20:31:12,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:12,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:12,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:12,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:12,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:12,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:12,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:12,713 INFO L87 Difference]: Start difference. First operand 2313 states and 2887 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:13,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:13,014 INFO L93 Difference]: Finished difference Result 2955 states and 3528 transitions. [2022-04-27 20:31:13,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:13,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 25 [2022-04-27 20:31:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:13,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:13,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-04-27 20:31:13,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-04-27 20:31:13,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 93 transitions. [2022-04-27 20:31:13,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:13,290 INFO L225 Difference]: With dead ends: 2955 [2022-04-27 20:31:13,290 INFO L226 Difference]: Without dead ends: 2955 [2022-04-27 20:31:13,290 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:13,291 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:13,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 91 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:13,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-04-27 20:31:13,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2953. [2022-04-27 20:31:13,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:13,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.1949813496100372) internal successors, (3524), 2949 states have internal predecessors, (3524), 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:13,323 INFO L74 IsIncluded]: Start isIncluded. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.1949813496100372) internal successors, (3524), 2949 states have internal predecessors, (3524), 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:13,326 INFO L87 Difference]: Start difference. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.1949813496100372) internal successors, (3524), 2949 states have internal predecessors, (3524), 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:13,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:13,520 INFO L93 Difference]: Finished difference Result 2955 states and 3528 transitions. [2022-04-27 20:31:13,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3528 transitions. [2022-04-27 20:31:13,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:13,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:13,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 2953 states, 2949 states have (on average 1.1949813496100372) internal successors, (3524), 2949 states have internal predecessors, (3524), 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 2955 states. [2022-04-27 20:31:13,527 INFO L87 Difference]: Start difference. First operand has 2953 states, 2949 states have (on average 1.1949813496100372) internal successors, (3524), 2949 states have internal predecessors, (3524), 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 2955 states. [2022-04-27 20:31:13,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:13,718 INFO L93 Difference]: Finished difference Result 2955 states and 3528 transitions. [2022-04-27 20:31:13,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3528 transitions. [2022-04-27 20:31:13,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:13,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:13,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:13,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:13,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2949 states have (on average 1.1949813496100372) internal successors, (3524), 2949 states have internal predecessors, (3524), 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:13,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 3527 transitions. [2022-04-27 20:31:13,930 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 3527 transitions. Word has length 25 [2022-04-27 20:31:13,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:13,930 INFO L495 AbstractCegarLoop]: Abstraction has 2953 states and 3527 transitions. [2022-04-27 20:31:13,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:13,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 3527 transitions. [2022-04-27 20:31:13,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 20:31:13,932 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:13,932 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, 1, 1, 1, 1] [2022-04-27 20:31:13,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-27 20:31:13,932 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:13,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:13,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1139160544, now seen corresponding path program 1 times [2022-04-27 20:31:13,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:13,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285229430] [2022-04-27 20:31:13,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:13,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:13,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:13,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {57824#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {57818#true} is VALID [2022-04-27 20:31:13,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {57818#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57818#true} is VALID [2022-04-27 20:31:13,962 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57818#true} {57818#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57818#true} is VALID [2022-04-27 20:31:13,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {57818#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57824#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:13,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {57824#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {57818#true} is VALID [2022-04-27 20:31:13,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {57818#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57818#true} is VALID [2022-04-27 20:31:13,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57818#true} {57818#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57818#true} is VALID [2022-04-27 20:31:13,963 INFO L272 TraceCheckUtils]: 4: Hoare triple {57818#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57818#true} is VALID [2022-04-27 20:31:13,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {57818#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, 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_2, main_~lk7~0=v_main_~lk7~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_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {57818#true} is VALID [2022-04-27 20:31:13,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {57818#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {57818#true} is VALID [2022-04-27 20:31:13,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {57818#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk8~0, main_~lk7~0] {57818#true} is VALID [2022-04-27 20:31:13,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {57818#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {57818#true} is VALID [2022-04-27 20:31:13,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {57818#true} [185] L58-2-->L62-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[] {57818#true} is VALID [2022-04-27 20:31:13,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {57818#true} [187] L62-1-->L66-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[] {57818#true} is VALID [2022-04-27 20:31:13,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {57818#true} [189] L66-1-->L70-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[] {57818#true} is VALID [2022-04-27 20:31:13,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {57818#true} [191] L70-1-->L74-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[] {57818#true} is VALID [2022-04-27 20:31:13,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {57818#true} [193] L74-1-->L78-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[] {57818#true} is VALID [2022-04-27 20:31:13,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {57818#true} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {57823#(not (= main_~p7~0 0))} is VALID [2022-04-27 20:31:13,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {57823#(not (= main_~p7~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {57823#(not (= main_~p7~0 0))} is VALID [2022-04-27 20:31:13,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {57823#(not (= main_~p7~0 0))} [199] L86-1-->L92-1: Formula: (= 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[] {57823#(not (= main_~p7~0 0))} is VALID [2022-04-27 20:31:13,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {57823#(not (= main_~p7~0 0))} [203] L92-1-->L97-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[] {57823#(not (= main_~p7~0 0))} is VALID [2022-04-27 20:31:13,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {57823#(not (= main_~p7~0 0))} [209] L97-1-->L102-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[] {57823#(not (= main_~p7~0 0))} is VALID [2022-04-27 20:31:13,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {57823#(not (= main_~p7~0 0))} [213] L102-1-->L107-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[] {57823#(not (= main_~p7~0 0))} is VALID [2022-04-27 20:31:13,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {57823#(not (= main_~p7~0 0))} [217] L107-1-->L112-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[] {57823#(not (= main_~p7~0 0))} is VALID [2022-04-27 20:31:13,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {57823#(not (= main_~p7~0 0))} [221] L112-1-->L117-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {57823#(not (= main_~p7~0 0))} is VALID [2022-04-27 20:31:13,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {57823#(not (= main_~p7~0 0))} [225] L117-1-->L122-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {57819#false} is VALID [2022-04-27 20:31:13,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {57819#false} [228] L122-1-->L128: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {57819#false} is VALID [2022-04-27 20:31:13,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {57819#false} [230] L128-->L128-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {57819#false} is VALID [2022-04-27 20:31:13,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {57819#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57819#false} is VALID [2022-04-27 20:31:13,970 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:13,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:13,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285229430] [2022-04-27 20:31:13,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285229430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:13,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:13,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:13,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964345697] [2022-04-27 20:31:13,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:13,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-27 20:31:13,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:13,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:13,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:13,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:13,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:13,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:13,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:13,986 INFO L87 Difference]: Start difference. First operand 2953 states and 3527 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:14,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:14,304 INFO L93 Difference]: Finished difference Result 3019 states and 3528 transitions. [2022-04-27 20:31:14,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:14,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-27 20:31:14,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-04-27 20:31:14,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-04-27 20:31:14,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 92 transitions. [2022-04-27 20:31:14,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:14,589 INFO L225 Difference]: With dead ends: 3019 [2022-04-27 20:31:14,589 INFO L226 Difference]: Without dead ends: 3019 [2022-04-27 20:31:14,590 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:14,590 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 99 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:14,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 75 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:14,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2022-04-27 20:31:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 3017. [2022-04-27 20:31:14,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:14,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.1695984069034184) internal successors, (3524), 3013 states have internal predecessors, (3524), 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:14,619 INFO L74 IsIncluded]: Start isIncluded. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.1695984069034184) internal successors, (3524), 3013 states have internal predecessors, (3524), 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:14,621 INFO L87 Difference]: Start difference. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.1695984069034184) internal successors, (3524), 3013 states have internal predecessors, (3524), 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:14,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:14,833 INFO L93 Difference]: Finished difference Result 3019 states and 3528 transitions. [2022-04-27 20:31:14,833 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3528 transitions. [2022-04-27 20:31:14,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:14,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:14,838 INFO L74 IsIncluded]: Start isIncluded. First operand has 3017 states, 3013 states have (on average 1.1695984069034184) internal successors, (3524), 3013 states have internal predecessors, (3524), 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 3019 states. [2022-04-27 20:31:14,841 INFO L87 Difference]: Start difference. First operand has 3017 states, 3013 states have (on average 1.1695984069034184) internal successors, (3524), 3013 states have internal predecessors, (3524), 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 3019 states. [2022-04-27 20:31:15,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:15,051 INFO L93 Difference]: Finished difference Result 3019 states and 3528 transitions. [2022-04-27 20:31:15,051 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3528 transitions. [2022-04-27 20:31:15,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:15,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:15,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:15,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:15,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3017 states, 3013 states have (on average 1.1695984069034184) internal successors, (3524), 3013 states have internal predecessors, (3524), 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:15,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 3527 transitions. [2022-04-27 20:31:15,274 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 3527 transitions. Word has length 26 [2022-04-27 20:31:15,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:15,274 INFO L495 AbstractCegarLoop]: Abstraction has 3017 states and 3527 transitions. [2022-04-27 20:31:15,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:15,275 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 3527 transitions. [2022-04-27 20:31:15,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 20:31:15,276 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:15,276 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, 1, 1, 1, 1] [2022-04-27 20:31:15,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-27 20:31:15,277 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:15,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:15,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1010077825, now seen corresponding path program 1 times [2022-04-27 20:31:15,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:15,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298181414] [2022-04-27 20:31:15,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:15,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:15,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:15,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {69910#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {69904#true} is VALID [2022-04-27 20:31:15,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {69904#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69904#true} is VALID [2022-04-27 20:31:15,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69904#true} {69904#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69904#true} is VALID [2022-04-27 20:31:15,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {69904#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69910#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:15,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {69910#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {69904#true} is VALID [2022-04-27 20:31:15,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {69904#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69904#true} is VALID [2022-04-27 20:31:15,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69904#true} {69904#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69904#true} is VALID [2022-04-27 20:31:15,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {69904#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69904#true} is VALID [2022-04-27 20:31:15,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {69904#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, 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_2, main_~lk7~0=v_main_~lk7~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_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {69904#true} is VALID [2022-04-27 20:31:15,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {69904#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {69904#true} is VALID [2022-04-27 20:31:15,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {69904#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk8~0, main_~lk7~0] {69904#true} is VALID [2022-04-27 20:31:15,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {69904#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {69904#true} is VALID [2022-04-27 20:31:15,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {69904#true} [185] L58-2-->L62-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[] {69904#true} is VALID [2022-04-27 20:31:15,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {69904#true} [187] L62-1-->L66-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[] {69904#true} is VALID [2022-04-27 20:31:15,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {69904#true} [189] L66-1-->L70-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[] {69904#true} is VALID [2022-04-27 20:31:15,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {69904#true} [191] L70-1-->L74-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[] {69904#true} is VALID [2022-04-27 20:31:15,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {69904#true} [193] L74-1-->L78-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[] {69904#true} is VALID [2022-04-27 20:31:15,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {69904#true} [195] L78-1-->L82-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {69904#true} is VALID [2022-04-27 20:31:15,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {69904#true} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {69909#(= main_~lk8~0 1)} is VALID [2022-04-27 20:31:15,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {69909#(= main_~lk8~0 1)} [199] L86-1-->L92-1: Formula: (= 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[] {69909#(= main_~lk8~0 1)} is VALID [2022-04-27 20:31:15,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {69909#(= main_~lk8~0 1)} [203] L92-1-->L97-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[] {69909#(= main_~lk8~0 1)} is VALID [2022-04-27 20:31:15,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {69909#(= main_~lk8~0 1)} [209] L97-1-->L102-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[] {69909#(= main_~lk8~0 1)} is VALID [2022-04-27 20:31:15,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {69909#(= main_~lk8~0 1)} [213] L102-1-->L107-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[] {69909#(= main_~lk8~0 1)} is VALID [2022-04-27 20:31:15,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {69909#(= main_~lk8~0 1)} [217] L107-1-->L112-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[] {69909#(= main_~lk8~0 1)} is VALID [2022-04-27 20:31:15,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {69909#(= main_~lk8~0 1)} [221] L112-1-->L117-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {69909#(= main_~lk8~0 1)} is VALID [2022-04-27 20:31:15,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {69909#(= main_~lk8~0 1)} [225] L117-1-->L122-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {69909#(= main_~lk8~0 1)} is VALID [2022-04-27 20:31:15,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {69909#(= main_~lk8~0 1)} [228] L122-1-->L128: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {69909#(= main_~lk8~0 1)} is VALID [2022-04-27 20:31:15,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {69909#(= main_~lk8~0 1)} [230] L128-->L128-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {69905#false} is VALID [2022-04-27 20:31:15,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {69905#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69905#false} is VALID [2022-04-27 20:31:15,314 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:15,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:15,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298181414] [2022-04-27 20:31:15,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298181414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:15,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:15,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:15,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188551418] [2022-04-27 20:31:15,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:15,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-27 20:31:15,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:15,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:15,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:15,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:15,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:15,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:15,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:15,333 INFO L87 Difference]: Start difference. First operand 3017 states and 3527 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:16,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:16,001 INFO L93 Difference]: Finished difference Result 4873 states and 5511 transitions. [2022-04-27 20:31:16,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:16,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-27 20:31:16,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:16,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:16,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-04-27 20:31:16,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:16,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-04-27 20:31:16,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2022-04-27 20:31:16,068 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:31:16,694 INFO L225 Difference]: With dead ends: 4873 [2022-04-27 20:31:16,694 INFO L226 Difference]: Without dead ends: 4873 [2022-04-27 20:31:16,695 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:16,695 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 84 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:16,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 58 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:16,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2022-04-27 20:31:16,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 4617. [2022-04-27 20:31:16,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:16,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1385215694775634) internal successors, (5252), 4613 states have internal predecessors, (5252), 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:16,757 INFO L74 IsIncluded]: Start isIncluded. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1385215694775634) internal successors, (5252), 4613 states have internal predecessors, (5252), 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:16,760 INFO L87 Difference]: Start difference. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1385215694775634) internal successors, (5252), 4613 states have internal predecessors, (5252), 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:17,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:17,341 INFO L93 Difference]: Finished difference Result 4873 states and 5511 transitions. [2022-04-27 20:31:17,341 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 5511 transitions. [2022-04-27 20:31:17,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:17,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:17,349 INFO L74 IsIncluded]: Start isIncluded. First operand has 4617 states, 4613 states have (on average 1.1385215694775634) internal successors, (5252), 4613 states have internal predecessors, (5252), 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 4873 states. [2022-04-27 20:31:17,352 INFO L87 Difference]: Start difference. First operand has 4617 states, 4613 states have (on average 1.1385215694775634) internal successors, (5252), 4613 states have internal predecessors, (5252), 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 4873 states. [2022-04-27 20:31:17,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:17,924 INFO L93 Difference]: Finished difference Result 4873 states and 5511 transitions. [2022-04-27 20:31:17,924 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 5511 transitions. [2022-04-27 20:31:17,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:17,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:17,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:17,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:17,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4617 states, 4613 states have (on average 1.1385215694775634) internal successors, (5252), 4613 states have internal predecessors, (5252), 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:18,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4617 states to 4617 states and 5255 transitions. [2022-04-27 20:31:18,502 INFO L78 Accepts]: Start accepts. Automaton has 4617 states and 5255 transitions. Word has length 26 [2022-04-27 20:31:18,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:18,502 INFO L495 AbstractCegarLoop]: Abstraction has 4617 states and 5255 transitions. [2022-04-27 20:31:18,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:18,502 INFO L276 IsEmpty]: Start isEmpty. Operand 4617 states and 5255 transitions. [2022-04-27 20:31:18,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 20:31:18,505 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:18,505 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, 1, 1, 1, 1] [2022-04-27 20:31:18,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-27 20:31:18,506 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:18,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:18,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1487938112, now seen corresponding path program 1 times [2022-04-27 20:31:18,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:18,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911029841] [2022-04-27 20:31:18,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:18,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:18,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:18,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {89158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {89152#true} is VALID [2022-04-27 20:31:18,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {89152#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89152#true} is VALID [2022-04-27 20:31:18,533 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {89152#true} {89152#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89152#true} is VALID [2022-04-27 20:31:18,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {89152#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:18,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {89158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {89152#true} is VALID [2022-04-27 20:31:18,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {89152#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89152#true} is VALID [2022-04-27 20:31:18,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89152#true} {89152#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89152#true} is VALID [2022-04-27 20:31:18,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {89152#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89152#true} is VALID [2022-04-27 20:31:18,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {89152#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, 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_2, main_~lk7~0=v_main_~lk7~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_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {89152#true} is VALID [2022-04-27 20:31:18,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {89152#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {89152#true} is VALID [2022-04-27 20:31:18,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {89152#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk8~0, main_~lk7~0] {89152#true} is VALID [2022-04-27 20:31:18,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {89152#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {89152#true} is VALID [2022-04-27 20:31:18,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {89152#true} [185] L58-2-->L62-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[] {89152#true} is VALID [2022-04-27 20:31:18,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {89152#true} [187] L62-1-->L66-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[] {89152#true} is VALID [2022-04-27 20:31:18,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {89152#true} [189] L66-1-->L70-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[] {89152#true} is VALID [2022-04-27 20:31:18,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {89152#true} [191] L70-1-->L74-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[] {89152#true} is VALID [2022-04-27 20:31:18,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {89152#true} [193] L74-1-->L78-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[] {89152#true} is VALID [2022-04-27 20:31:18,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {89152#true} [195] L78-1-->L82-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {89152#true} is VALID [2022-04-27 20:31:18,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {89152#true} [197] L82-1-->L86-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {89157#(= main_~p8~0 0)} is VALID [2022-04-27 20:31:18,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {89157#(= main_~p8~0 0)} [199] L86-1-->L92-1: Formula: (= 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[] {89157#(= main_~p8~0 0)} is VALID [2022-04-27 20:31:18,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {89157#(= main_~p8~0 0)} [203] L92-1-->L97-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[] {89157#(= main_~p8~0 0)} is VALID [2022-04-27 20:31:18,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {89157#(= main_~p8~0 0)} [209] L97-1-->L102-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[] {89157#(= main_~p8~0 0)} is VALID [2022-04-27 20:31:18,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {89157#(= main_~p8~0 0)} [213] L102-1-->L107-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[] {89157#(= main_~p8~0 0)} is VALID [2022-04-27 20:31:18,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {89157#(= main_~p8~0 0)} [217] L107-1-->L112-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[] {89157#(= main_~p8~0 0)} is VALID [2022-04-27 20:31:18,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {89157#(= main_~p8~0 0)} [221] L112-1-->L117-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {89157#(= main_~p8~0 0)} is VALID [2022-04-27 20:31:18,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {89157#(= main_~p8~0 0)} [225] L117-1-->L122-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {89157#(= main_~p8~0 0)} is VALID [2022-04-27 20:31:18,536 INFO L290 TraceCheckUtils]: 23: Hoare triple {89157#(= main_~p8~0 0)} [228] L122-1-->L128: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {89153#false} is VALID [2022-04-27 20:31:18,536 INFO L290 TraceCheckUtils]: 24: Hoare triple {89153#false} [230] L128-->L128-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {89153#false} is VALID [2022-04-27 20:31:18,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {89153#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89153#false} is VALID [2022-04-27 20:31:18,537 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:18,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:18,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911029841] [2022-04-27 20:31:18,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911029841] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:18,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:18,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:18,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087310694] [2022-04-27 20:31:18,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:18,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-27 20:31:18,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:18,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:18,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:18,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:18,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:18,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:18,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:18,551 INFO L87 Difference]: Start difference. First operand 4617 states and 5255 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:19,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:19,446 INFO L93 Difference]: Finished difference Result 5767 states and 6150 transitions. [2022-04-27 20:31:19,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:19,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-27 20:31:19,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:19,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-04-27 20:31:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-04-27 20:31:19,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 89 transitions. [2022-04-27 20:31:19,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:19,500 INFO L225 Difference]: With dead ends: 5767 [2022-04-27 20:31:19,500 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 20:31:19,500 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:19,501 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:19,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 92 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:19,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 20:31:19,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 20:31:19,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:19,501 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:19,501 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:19,501 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:19,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:19,501 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 20:31:19,502 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 20:31:19,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:19,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:19,502 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:19,502 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:19,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:19,502 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 20:31:19,502 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 20:31:19,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:19,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:19,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:19,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:19,502 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:19,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 20:31:19,502 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-27 20:31:19,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:19,502 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 20:31:19,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:19,503 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 20:31:19,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:19,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 20:31:19,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-27 20:31:19,519 INFO L356 BasicCegarLoop]: Path program histogram: [1, 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:19,520 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 20:31:19,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 08:31:19 BasicIcfg [2022-04-27 20:31:19,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 20:31:19,522 INFO L158 Benchmark]: Toolchain (without parser) took 14656.75ms. Allocated memory was 207.6MB in the beginning and 302.0MB in the end (delta: 94.4MB). Free memory was 158.0MB in the beginning and 143.3MB in the end (delta: 14.7MB). Peak memory consumption was 108.7MB. Max. memory is 8.0GB. [2022-04-27 20:31:19,523 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 207.6MB. Free memory is still 173.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 20:31:19,523 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.71ms. Allocated memory is still 207.6MB. Free memory was 157.8MB in the beginning and 183.4MB in the end (delta: -25.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 20:31:19,523 INFO L158 Benchmark]: Boogie Preprocessor took 38.38ms. Allocated memory is still 207.6MB. Free memory was 183.4MB in the beginning and 181.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 20:31:19,523 INFO L158 Benchmark]: RCFGBuilder took 286.82ms. Allocated memory is still 207.6MB. Free memory was 181.8MB in the beginning and 168.4MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 20:31:19,523 INFO L158 Benchmark]: IcfgTransformer took 26.51ms. Allocated memory is still 207.6MB. Free memory was 168.4MB in the beginning and 166.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 20:31:19,523 INFO L158 Benchmark]: TraceAbstraction took 14077.40ms. Allocated memory was 207.6MB in the beginning and 302.0MB in the end (delta: 94.4MB). Free memory was 165.7MB in the beginning and 143.3MB in the end (delta: 22.4MB). Peak memory consumption was 117.2MB. Max. memory is 8.0GB. [2022-04-27 20:31:19,524 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 207.6MB. Free memory is still 173.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 222.71ms. Allocated memory is still 207.6MB. Free memory was 157.8MB in the beginning and 183.4MB in the end (delta: -25.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.38ms. Allocated memory is still 207.6MB. Free memory was 183.4MB in the beginning and 181.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 286.82ms. Allocated memory is still 207.6MB. Free memory was 181.8MB in the beginning and 168.4MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 26.51ms. Allocated memory is still 207.6MB. Free memory was 168.4MB in the beginning and 166.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 14077.40ms. Allocated memory was 207.6MB in the beginning and 302.0MB in the end (delta: 94.4MB). Free memory was 165.7MB in the beginning and 143.3MB in the end (delta: 22.4MB). Peak memory consumption was 117.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 135]: 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, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2368 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2368 mSDsluCounter, 1785 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 163 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1134 IncrementalHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 1622 mSDtfsCounter, 1134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4617occurred in iteration=22, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 1046 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 521 NumberOfCodeBlocks, 521 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 498 ConstructedInterpolants, 0 QuantifiedInterpolants, 1076 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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:19,546 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...