/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_15-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 21:20:25,234 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 21:20:25,236 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 21:20:25,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 21:20:25,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 21:20:25,275 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 21:20:25,276 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 21:20:25,277 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 21:20:25,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 21:20:25,278 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 21:20:25,279 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 21:20:25,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 21:20:25,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 21:20:25,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 21:20:25,281 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 21:20:25,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 21:20:25,282 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 21:20:25,283 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 21:20:25,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 21:20:25,291 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 21:20:25,293 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 21:20:25,296 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 21:20:25,296 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 21:20:25,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 21:20:25,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 21:20:25,302 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 21:20:25,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 21:20:25,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 21:20:25,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 21:20:25,303 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 21:20:25,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 21:20:25,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 21:20:25,306 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 21:20:25,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 21:20:25,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 21:20:25,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 21:20:25,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 21:20:25,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 21:20:25,307 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 21:20:25,307 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 21:20:25,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 21:20:25,309 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 21:20:25,309 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 21:20:25,323 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 21:20:25,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 21:20:25,324 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 21:20:25,325 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 21:20:25,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 21:20:25,325 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 21:20:25,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 21:20:25,325 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 21:20:25,325 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 21:20:25,325 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 21:20:25,326 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 21:20:25,326 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 21:20:25,326 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 21:20:25,326 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 21:20:25,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 21:20:25,326 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 21:20:25,326 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 21:20:25,326 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 21:20:25,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 21:20:25,326 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 21:20:25,326 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 21:20:25,327 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 21:20:25,327 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-07 21:20:25,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 21:20:25,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 21:20:25,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 21:20:25,541 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 21:20:25,542 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 21:20:25,542 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_15-1.c [2022-04-07 21:20:25,592 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eab826919/ba53d69814a846879cb1fd93060b9438/FLAG34be1a89a [2022-04-07 21:20:25,959 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 21:20:25,959 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-1.c [2022-04-07 21:20:25,967 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eab826919/ba53d69814a846879cb1fd93060b9438/FLAG34be1a89a [2022-04-07 21:20:25,978 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eab826919/ba53d69814a846879cb1fd93060b9438 [2022-04-07 21:20:25,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 21:20:25,981 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 21:20:25,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 21:20:25,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 21:20:25,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 21:20:25,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 09:20:25" (1/1) ... [2022-04-07 21:20:25,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44e44eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:25, skipping insertion in model container [2022-04-07 21:20:25,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 09:20:25" (1/1) ... [2022-04-07 21:20:25,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 21:20:26,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 21:20:26,176 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_15-1.c[5654,5667] [2022-04-07 21:20:26,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 21:20:26,196 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 21:20:26,231 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_15-1.c[5654,5667] [2022-04-07 21:20:26,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 21:20:26,240 INFO L208 MainTranslator]: Completed translation [2022-04-07 21:20:26,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:26 WrapperNode [2022-04-07 21:20:26,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 21:20:26,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 21:20:26,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 21:20:26,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 21:20:26,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:26" (1/1) ... [2022-04-07 21:20:26,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:26" (1/1) ... [2022-04-07 21:20:26,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:26" (1/1) ... [2022-04-07 21:20:26,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:26" (1/1) ... [2022-04-07 21:20:26,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:26" (1/1) ... [2022-04-07 21:20:26,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:26" (1/1) ... [2022-04-07 21:20:26,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:26" (1/1) ... [2022-04-07 21:20:26,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 21:20:26,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 21:20:26,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 21:20:26,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 21:20:26,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:26" (1/1) ... [2022-04-07 21:20:26,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 21:20:26,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 21:20:26,316 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-07 21:20:26,321 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-07 21:20:26,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 21:20:26,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 21:20:26,340 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 21:20:26,341 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 21:20:26,341 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 21:20:26,341 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 21:20:26,341 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 21:20:26,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 21:20:26,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 21:20:26,342 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 21:20:26,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 21:20:26,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 21:20:26,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 21:20:26,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 21:20:26,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 21:20:26,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 21:20:26,395 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 21:20:26,396 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 21:20:26,645 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 21:20:26,650 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 21:20:26,650 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 21:20:26,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:20:26 BoogieIcfgContainer [2022-04-07 21:20:26,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 21:20:26,652 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 21:20:26,652 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 21:20:26,657 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 21:20:26,659 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:20:26" (1/1) ... [2022-04-07 21:20:26,660 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 21:20:26,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 09:20:26 BasicIcfg [2022-04-07 21:20:26,714 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 21:20:26,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 21:20:26,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 21:20:26,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 21:20:26,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 09:20:25" (1/4) ... [2022-04-07 21:20:26,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175efac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 09:20:26, skipping insertion in model container [2022-04-07 21:20:26,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:26" (2/4) ... [2022-04-07 21:20:26,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175efac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 09:20:26, skipping insertion in model container [2022-04-07 21:20:26,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:20:26" (3/4) ... [2022-04-07 21:20:26,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175efac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 09:20:26, skipping insertion in model container [2022-04-07 21:20:26,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 09:20:26" (4/4) ... [2022-04-07 21:20:26,720 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_15-1.cJordan [2022-04-07 21:20:26,723 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 21:20:26,723 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 21:20:26,748 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 21:20:26,752 INFO L340 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 [2022-04-07 21:20:26,752 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 21:20:26,763 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 55 states have internal predecessors, (103), 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-07 21:20:26,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 21:20:26,768 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:26,768 INFO L499 BasicCegarLoop]: 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-07 21:20:26,769 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:26,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:26,772 INFO L85 PathProgramCache]: Analyzing trace with hash 539653987, now seen corresponding path program 1 times [2022-04-07 21:20:26,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:26,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080922235] [2022-04-07 21:20:26,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:26,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:26,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:26,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {69#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {63#true} is VALID [2022-04-07 21:20:26,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63#true} is VALID [2022-04-07 21:20:26,952 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63#true} {63#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63#true} is VALID [2022-04-07 21:20:26,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {63#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:26,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {69#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {63#true} is VALID [2022-04-07 21:20:26,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {63#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63#true} is VALID [2022-04-07 21:20:26,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63#true} {63#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63#true} is VALID [2022-04-07 21:20:26,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {63#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63#true} is VALID [2022-04-07 21:20:26,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {63#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~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_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {63#true} is VALID [2022-04-07 21:20:26,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {63#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {63#true} is VALID [2022-04-07 21:20:26,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {63#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {63#true} is VALID [2022-04-07 21:20:26,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {63#true} [301] L93-->L93-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] {68#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:26,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#(= main_~lk1~0 1)} [304] L93-2-->L97-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[] {68#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:26,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {68#(= main_~lk1~0 1)} [305] L97-1-->L101-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] {68#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:26,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {68#(= main_~lk1~0 1)} [307] L101-1-->L105-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] {68#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:26,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {68#(= main_~lk1~0 1)} [309] L105-1-->L109-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] {68#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:26,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {68#(= main_~lk1~0 1)} [311] L109-1-->L113-1: Formula: (and (not (= v_main_~p6~0_2 0)) (= v_main_~lk6~0_3 1)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[main_~lk6~0] {68#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:26,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {68#(= main_~lk1~0 1)} [313] L113-1-->L117-1: Formula: (and (= v_main_~lk7~0_3 1) (not (= v_main_~p7~0_2 0))) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_3, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_~lk7~0] {68#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:26,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {68#(= main_~lk1~0 1)} [315] L117-1-->L121-1: Formula: (and (not (= v_main_~p8~0_2 0)) (= v_main_~lk8~0_3 1)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2, main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[main_~lk8~0] {68#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:26,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {68#(= main_~lk1~0 1)} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {68#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:26,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {68#(= main_~lk1~0 1)} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {68#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:26,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {68#(= main_~lk1~0 1)} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {68#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:26,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {68#(= main_~lk1~0 1)} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {68#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:26,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {68#(= main_~lk1~0 1)} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {68#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:26,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {68#(= main_~lk1~0 1)} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {68#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:26,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {68#(= main_~lk1~0 1)} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {68#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:26,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {68#(= main_~lk1~0 1)} [331] L149-1-->L156: 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[] {68#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:26,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {68#(= main_~lk1~0 1)} [333] L156-->L226-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[] {64#false} is VALID [2022-04-07 21:20:26,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {64#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {64#false} is VALID [2022-04-07 21:20:26,964 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-07 21:20:26,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:26,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080922235] [2022-04-07 21:20:26,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080922235] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:26,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:26,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:26,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233363965] [2022-04-07 21:20:26,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:26,970 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-07 21:20:26,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:26,974 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-07 21:20:27,001 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-07 21:20:27,001 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:27,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:27,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:27,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:27,017 INFO L87 Difference]: Start difference. First operand has 60 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 55 states have internal predecessors, (103), 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 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-07 21:20:27,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:27,404 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2022-04-07 21:20:27,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:27,404 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-07 21:20:27,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:27,405 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-07 21:20:27,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-07 21:20:27,413 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-07 21:20:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-07 21:20:27,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 205 transitions. [2022-04-07 21:20:27,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:27,601 INFO L225 Difference]: With dead ends: 111 [2022-04-07 21:20:27,601 INFO L226 Difference]: Without dead ends: 103 [2022-04-07 21:20:27,603 INFO L912 BasicCegarLoop]: 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-07 21:20:27,607 INFO L913 BasicCegarLoop]: 109 mSDtfsCounter, 260 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:27,608 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 118 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 21:20:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-07 21:20:27,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2022-04-07 21:20:27,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:27,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:27,638 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:27,639 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:27,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:27,645 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2022-04-07 21:20:27,648 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2022-04-07 21:20:27,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:27,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:27,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 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 103 states. [2022-04-07 21:20:27,651 INFO L87 Difference]: Start difference. First operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 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 103 states. [2022-04-07 21:20:27,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:27,660 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2022-04-07 21:20:27,660 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2022-04-07 21:20:27,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:27,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:27,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:27,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:27,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:27,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 130 transitions. [2022-04-07 21:20:27,665 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 130 transitions. Word has length 26 [2022-04-07 21:20:27,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:27,665 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 130 transitions. [2022-04-07 21:20:27,665 INFO L479 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-07 21:20:27,665 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 130 transitions. [2022-04-07 21:20:27,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 21:20:27,666 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:27,666 INFO L499 BasicCegarLoop]: 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-07 21:20:27,666 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 21:20:27,666 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:27,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:27,667 INFO L85 PathProgramCache]: Analyzing trace with hash 539655041, now seen corresponding path program 1 times [2022-04-07 21:20:27,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:27,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536464022] [2022-04-07 21:20:27,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:27,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:27,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:27,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {469#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {463#true} is VALID [2022-04-07 21:20:27,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {463#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {463#true} is VALID [2022-04-07 21:20:27,740 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {463#true} {463#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {463#true} is VALID [2022-04-07 21:20:27,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {463#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {469#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:27,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {469#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {463#true} is VALID [2022-04-07 21:20:27,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {463#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {463#true} is VALID [2022-04-07 21:20:27,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {463#true} {463#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {463#true} is VALID [2022-04-07 21:20:27,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {463#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {463#true} is VALID [2022-04-07 21:20:27,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {463#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~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_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {463#true} is VALID [2022-04-07 21:20:27,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {463#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {463#true} is VALID [2022-04-07 21:20:27,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {463#true} is VALID [2022-04-07 21:20:27,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {463#true} [301] L93-->L93-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] {468#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:27,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {468#(not (= main_~p1~0 0))} [304] L93-2-->L97-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[] {468#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:27,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {468#(not (= main_~p1~0 0))} [305] L97-1-->L101-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] {468#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:27,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {468#(not (= main_~p1~0 0))} [307] L101-1-->L105-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] {468#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:27,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {468#(not (= main_~p1~0 0))} [309] L105-1-->L109-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] {468#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:27,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {468#(not (= main_~p1~0 0))} [311] L109-1-->L113-1: Formula: (and (not (= v_main_~p6~0_2 0)) (= v_main_~lk6~0_3 1)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[main_~lk6~0] {468#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:27,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {468#(not (= main_~p1~0 0))} [313] L113-1-->L117-1: Formula: (and (= v_main_~lk7~0_3 1) (not (= v_main_~p7~0_2 0))) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_3, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_~lk7~0] {468#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:27,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {468#(not (= main_~p1~0 0))} [315] L117-1-->L121-1: Formula: (and (not (= v_main_~p8~0_2 0)) (= v_main_~lk8~0_3 1)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2, main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[main_~lk8~0] {468#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:27,746 INFO L290 TraceCheckUtils]: 16: Hoare triple {468#(not (= main_~p1~0 0))} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {468#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:27,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {468#(not (= main_~p1~0 0))} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {468#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:27,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {468#(not (= main_~p1~0 0))} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {468#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:27,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {468#(not (= main_~p1~0 0))} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {468#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:27,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {468#(not (= main_~p1~0 0))} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {468#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:27,747 INFO L290 TraceCheckUtils]: 21: Hoare triple {468#(not (= main_~p1~0 0))} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {468#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:27,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {468#(not (= main_~p1~0 0))} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {468#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:27,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {468#(not (= main_~p1~0 0))} [332] L149-1-->L155-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[] {464#false} is VALID [2022-04-07 21:20:27,748 INFO L290 TraceCheckUtils]: 24: Hoare triple {464#false} [336] L155-1-->L226-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[] {464#false} is VALID [2022-04-07 21:20:27,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {464#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {464#false} is VALID [2022-04-07 21:20:27,749 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-07 21:20:27,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:27,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536464022] [2022-04-07 21:20:27,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536464022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:27,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:27,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:27,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122699810] [2022-04-07 21:20:27,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:27,751 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-07 21:20:27,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:27,751 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-07 21:20:27,769 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-07 21:20:27,769 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:27,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:27,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:27,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:27,771 INFO L87 Difference]: Start difference. First operand 71 states and 130 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-07 21:20:28,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:28,001 INFO L93 Difference]: Finished difference Result 104 states and 189 transitions. [2022-04-07 21:20:28,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:28,002 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-07 21:20:28,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:28,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-07 21:20:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-07 21:20:28,004 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-07 21:20:28,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-07 21:20:28,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 190 transitions. [2022-04-07 21:20:28,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:28,127 INFO L225 Difference]: With dead ends: 104 [2022-04-07 21:20:28,127 INFO L226 Difference]: Without dead ends: 104 [2022-04-07 21:20:28,130 INFO L912 BasicCegarLoop]: 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-07 21:20:28,132 INFO L913 BasicCegarLoop]: 156 mSDtfsCounter, 200 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:28,133 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 163 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 21:20:28,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-07 21:20:28,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2022-04-07 21:20:28,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:28,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 102 states, 98 states have (on average 1.8877551020408163) internal successors, (185), 98 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:28,147 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 102 states, 98 states have (on average 1.8877551020408163) internal successors, (185), 98 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:28,147 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 102 states, 98 states have (on average 1.8877551020408163) internal successors, (185), 98 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:28,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:28,150 INFO L93 Difference]: Finished difference Result 104 states and 189 transitions. [2022-04-07 21:20:28,150 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 189 transitions. [2022-04-07 21:20:28,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:28,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:28,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 98 states have (on average 1.8877551020408163) internal successors, (185), 98 states have internal predecessors, (185), 2 states have call successors, (2), 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 104 states. [2022-04-07 21:20:28,151 INFO L87 Difference]: Start difference. First operand has 102 states, 98 states have (on average 1.8877551020408163) internal successors, (185), 98 states have internal predecessors, (185), 2 states have call successors, (2), 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 104 states. [2022-04-07 21:20:28,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:28,154 INFO L93 Difference]: Finished difference Result 104 states and 189 transitions. [2022-04-07 21:20:28,154 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 189 transitions. [2022-04-07 21:20:28,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:28,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:28,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:28,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:28,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 98 states have (on average 1.8877551020408163) internal successors, (185), 98 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 188 transitions. [2022-04-07 21:20:28,164 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 188 transitions. Word has length 26 [2022-04-07 21:20:28,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:28,165 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 188 transitions. [2022-04-07 21:20:28,165 INFO L479 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-07 21:20:28,165 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 188 transitions. [2022-04-07 21:20:28,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 21:20:28,170 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:28,170 INFO L499 BasicCegarLoop]: 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-07 21:20:28,170 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 21:20:28,170 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:28,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:28,171 INFO L85 PathProgramCache]: Analyzing trace with hash -457418366, now seen corresponding path program 1 times [2022-04-07 21:20:28,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:28,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509887859] [2022-04-07 21:20:28,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:28,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:28,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:28,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {889#true} is VALID [2022-04-07 21:20:28,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {889#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {889#true} is VALID [2022-04-07 21:20:28,250 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {889#true} {889#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {889#true} is VALID [2022-04-07 21:20:28,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {889#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:28,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {889#true} is VALID [2022-04-07 21:20:28,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {889#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {889#true} is VALID [2022-04-07 21:20:28,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {889#true} {889#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {889#true} is VALID [2022-04-07 21:20:28,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {889#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {889#true} is VALID [2022-04-07 21:20:28,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {889#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~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_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {889#true} is VALID [2022-04-07 21:20:28,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {889#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {889#true} is VALID [2022-04-07 21:20:28,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {889#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {889#true} is VALID [2022-04-07 21:20:28,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {889#true} [302] L93-->L93-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[] {894#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:28,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {894#(= main_~p1~0 0)} [304] L93-2-->L97-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[] {894#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:28,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {894#(= main_~p1~0 0)} [305] L97-1-->L101-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] {894#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:28,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {894#(= main_~p1~0 0)} [307] L101-1-->L105-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] {894#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:28,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {894#(= main_~p1~0 0)} [309] L105-1-->L109-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] {894#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:28,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {894#(= main_~p1~0 0)} [311] L109-1-->L113-1: Formula: (and (not (= v_main_~p6~0_2 0)) (= v_main_~lk6~0_3 1)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[main_~lk6~0] {894#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:28,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {894#(= main_~p1~0 0)} [313] L113-1-->L117-1: Formula: (and (= v_main_~lk7~0_3 1) (not (= v_main_~p7~0_2 0))) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_3, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_~lk7~0] {894#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:28,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {894#(= main_~p1~0 0)} [315] L117-1-->L121-1: Formula: (and (not (= v_main_~p8~0_2 0)) (= v_main_~lk8~0_3 1)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2, main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[main_~lk8~0] {894#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:28,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {894#(= main_~p1~0 0)} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {894#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:28,263 INFO L290 TraceCheckUtils]: 17: Hoare triple {894#(= main_~p1~0 0)} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {894#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:28,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {894#(= main_~p1~0 0)} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {894#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:28,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {894#(= main_~p1~0 0)} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {894#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:28,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {894#(= main_~p1~0 0)} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {894#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:28,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {894#(= main_~p1~0 0)} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {894#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:28,265 INFO L290 TraceCheckUtils]: 22: Hoare triple {894#(= main_~p1~0 0)} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {894#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:28,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {894#(= main_~p1~0 0)} [331] L149-1-->L156: 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[] {890#false} is VALID [2022-04-07 21:20:28,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {890#false} [333] L156-->L226-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[] {890#false} is VALID [2022-04-07 21:20:28,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {890#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {890#false} is VALID [2022-04-07 21:20:28,267 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-07 21:20:28,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:28,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509887859] [2022-04-07 21:20:28,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509887859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:28,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:28,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:28,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588067927] [2022-04-07 21:20:28,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:28,268 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-07 21:20:28,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:28,269 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-07 21:20:28,282 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-07 21:20:28,283 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:28,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:28,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:28,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:28,284 INFO L87 Difference]: Start difference. First operand 102 states and 188 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-07 21:20:28,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:28,483 INFO L93 Difference]: Finished difference Result 106 states and 189 transitions. [2022-04-07 21:20:28,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:28,484 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-07 21:20:28,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:28,484 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-07 21:20:28,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2022-04-07 21:20:28,486 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-07 21:20:28,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2022-04-07 21:20:28,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 188 transitions. [2022-04-07 21:20:28,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:28,625 INFO L225 Difference]: With dead ends: 106 [2022-04-07 21:20:28,625 INFO L226 Difference]: Without dead ends: 106 [2022-04-07 21:20:28,626 INFO L912 BasicCegarLoop]: 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-07 21:20:28,626 INFO L913 BasicCegarLoop]: 127 mSDtfsCounter, 224 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:28,627 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 134 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 21:20:28,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-07 21:20:28,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2022-04-07 21:20:28,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:28,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:28,630 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:28,631 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:28,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:28,634 INFO L93 Difference]: Finished difference Result 106 states and 189 transitions. [2022-04-07 21:20:28,634 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 189 transitions. [2022-04-07 21:20:28,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:28,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:28,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 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 106 states. [2022-04-07 21:20:28,635 INFO L87 Difference]: Start difference. First operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 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 106 states. [2022-04-07 21:20:28,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:28,638 INFO L93 Difference]: Finished difference Result 106 states and 189 transitions. [2022-04-07 21:20:28,638 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 189 transitions. [2022-04-07 21:20:28,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:28,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:28,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:28,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:28,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 188 transitions. [2022-04-07 21:20:28,642 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 188 transitions. Word has length 26 [2022-04-07 21:20:28,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:28,642 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 188 transitions. [2022-04-07 21:20:28,642 INFO L479 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-07 21:20:28,643 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 188 transitions. [2022-04-07 21:20:28,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 21:20:28,643 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:28,643 INFO L499 BasicCegarLoop]: 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-07 21:20:28,643 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 21:20:28,643 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:28,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:28,644 INFO L85 PathProgramCache]: Analyzing trace with hash -457417312, now seen corresponding path program 1 times [2022-04-07 21:20:28,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:28,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295324412] [2022-04-07 21:20:28,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:28,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 21:20:28,670 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 21:20:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 21:20:28,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 21:20:28,714 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 21:20:28,715 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 21:20:28,716 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 21:20:28,718 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-07 21:20:28,720 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 21:20:28,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 09:20:28 BasicIcfg [2022-04-07 21:20:28,748 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 21:20:28,749 INFO L158 Benchmark]: Toolchain (without parser) took 2768.44ms. Allocated memory was 197.1MB in the beginning and 243.3MB in the end (delta: 46.1MB). Free memory was 148.4MB in the beginning and 192.1MB in the end (delta: -43.7MB). Peak memory consumption was 2.0MB. Max. memory is 8.0GB. [2022-04-07 21:20:28,749 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 197.1MB. Free memory is still 164.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 21:20:28,750 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.53ms. Allocated memory is still 197.1MB. Free memory was 148.1MB in the beginning and 171.3MB in the end (delta: -23.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 21:20:28,750 INFO L158 Benchmark]: Boogie Preprocessor took 48.58ms. Allocated memory is still 197.1MB. Free memory was 171.3MB in the beginning and 169.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 21:20:28,750 INFO L158 Benchmark]: RCFGBuilder took 361.24ms. Allocated memory is still 197.1MB. Free memory was 169.2MB in the beginning and 152.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-04-07 21:20:28,750 INFO L158 Benchmark]: IcfgTransformer took 62.15ms. Allocated memory is still 197.1MB. Free memory was 152.4MB in the beginning and 149.6MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-07 21:20:28,751 INFO L158 Benchmark]: TraceAbstraction took 2032.79ms. Allocated memory was 197.1MB in the beginning and 243.3MB in the end (delta: 46.1MB). Free memory was 149.0MB in the beginning and 192.1MB in the end (delta: -43.0MB). Peak memory consumption was 4.4MB. Max. memory is 8.0GB. [2022-04-07 21:20:28,752 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 197.1MB. Free memory is still 164.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 258.53ms. Allocated memory is still 197.1MB. Free memory was 148.1MB in the beginning and 171.3MB in the end (delta: -23.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.58ms. Allocated memory is still 197.1MB. Free memory was 171.3MB in the beginning and 169.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 361.24ms. Allocated memory is still 197.1MB. Free memory was 169.2MB in the beginning and 152.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * IcfgTransformer took 62.15ms. Allocated memory is still 197.1MB. Free memory was 152.4MB in the beginning and 149.6MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2032.79ms. Allocated memory was 197.1MB in the beginning and 243.3MB in the end (delta: 46.1MB). Free memory was 149.0MB in the beginning and 192.1MB in the end (delta: -43.0MB). Peak memory consumption was 4.4MB. 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 - CounterExampleResult [Line: 233]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; VAL [p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L93] COND FALSE !(p1 != 0) VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L97] COND FALSE !(p2 != 0) VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L101] COND TRUE p3 != 0 [L102] lk3 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L105] COND TRUE p4 != 0 [L106] lk4 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L109] COND TRUE p5 != 0 [L110] lk5 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L113] COND TRUE p6 != 0 [L114] lk6 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L117] COND TRUE p7 != 0 [L118] lk7 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L121] COND TRUE p8 != 0 [L122] lk8 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L125] COND TRUE p9 != 0 [L126] lk9 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L129] COND FALSE !(p10 != 0) VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L133] COND TRUE p11 != 0 [L134] lk11 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=1, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L137] COND TRUE p12 != 0 [L138] lk12 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=1, lk12=1, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L141] COND TRUE p13 != 0 [L142] lk13 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=1, lk12=1, lk13=1, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L145] COND TRUE p14 != 0 [L146] lk14 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=1, lk12=1, lk13=1, lk14=1, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L149] COND TRUE p15 != 0 [L150] lk15 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=1, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L155] COND FALSE !(p1 != 0) VAL [cond=1, lk1=0, lk10=0, lk11=1, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L160] COND FALSE !(p2 != 0) VAL [cond=1, lk1=0, lk10=0, lk11=1, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L233] reach_error() VAL [cond=1, lk1=0, lk10=0, lk11=1, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 684 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 684 mSDsluCounter, 415 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 290 IncrementalHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 392 mSDtfsCounter, 290 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=3, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 36 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-07 21:20:28,784 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...