/usr/bin/java -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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-19 22:46:21,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-19 22:46:21,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-19 22:46:21,489 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-19 22:46:21,489 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-19 22:46:21,490 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-19 22:46:21,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-19 22:46:21,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-19 22:46:21,501 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-19 22:46:21,504 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-19 22:46:21,505 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-19 22:46:21,506 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-19 22:46:21,506 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-19 22:46:21,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-19 22:46:21,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-19 22:46:21,509 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-19 22:46:21,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-19 22:46:21,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-19 22:46:21,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-19 22:46:21,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-19 22:46:21,518 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-19 22:46:21,519 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-19 22:46:21,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-19 22:46:21,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-19 22:46:21,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-19 22:46:21,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-19 22:46:21,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-19 22:46:21,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-19 22:46:21,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-19 22:46:21,527 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-19 22:46:21,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-19 22:46:21,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-19 22:46:21,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-19 22:46:21,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-19 22:46:21,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-19 22:46:21,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-19 22:46:21,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-19 22:46:21,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-19 22:46:21,533 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-19 22:46:21,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-19 22:46:21,534 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-19 22:46:21,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-19 22:46:21,536 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-03-19 22:46:21,557 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-19 22:46:21,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-19 22:46:21,558 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-19 22:46:21,558 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-19 22:46:21,558 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-19 22:46:21,558 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-19 22:46:21,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-19 22:46:21,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-19 22:46:21,559 INFO L138 SettingsManager]: * Use SBE=true [2022-03-19 22:46:21,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-19 22:46:21,559 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-19 22:46:21,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-19 22:46:21,559 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-19 22:46:21,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-19 22:46:21,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-19 22:46:21,559 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-19 22:46:21,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-19 22:46:21,560 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-19 22:46:21,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-19 22:46:21,560 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-19 22:46:21,560 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-19 22:46:21,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-19 22:46:21,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-19 22:46:21,560 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-19 22:46:21,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 22:46:21,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-19 22:46:21,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-19 22:46:21,560 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-19 22:46:21,561 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-19 22:46:21,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-19 22:46:21,561 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-19 22:46:21,561 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-03-19 22:46:21,561 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-19 22:46:21,561 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-03-19 22:46:21,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-19 22:46:21,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-19 22:46:21,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-19 22:46:21,753 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-19 22:46:21,753 INFO L275 PluginConnector]: CDTParser initialized [2022-03-19 22:46:21,754 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c [2022-03-19 22:46:21,803 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/015d4644d/6dd52698079b4ad8aed87889a650a0fa/FLAGadba11904 [2022-03-19 22:46:22,081 INFO L306 CDTParser]: Found 1 translation units. [2022-03-19 22:46:22,082 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c [2022-03-19 22:46:22,086 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/015d4644d/6dd52698079b4ad8aed87889a650a0fa/FLAGadba11904 [2022-03-19 22:46:22,522 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/015d4644d/6dd52698079b4ad8aed87889a650a0fa [2022-03-19 22:46:22,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-19 22:46:22,525 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-19 22:46:22,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-19 22:46:22,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-19 22:46:22,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-19 22:46:22,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 10:46:22" (1/1) ... [2022-03-19 22:46:22,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e6cf16c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:46:22, skipping insertion in model container [2022-03-19 22:46:22,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 10:46:22" (1/1) ... [2022-03-19 22:46:22,538 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-19 22:46:22,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-19 22:46:22,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c[313,326] [2022-03-19 22:46:22,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 22:46:22,678 INFO L203 MainTranslator]: Completed pre-run [2022-03-19 22:46:22,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c[313,326] [2022-03-19 22:46:22,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 22:46:22,695 INFO L208 MainTranslator]: Completed translation [2022-03-19 22:46:22,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:46:22 WrapperNode [2022-03-19 22:46:22,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-19 22:46:22,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-19 22:46:22,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-19 22:46:22,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-19 22:46:22,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:46:22" (1/1) ... [2022-03-19 22:46:22,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:46:22" (1/1) ... [2022-03-19 22:46:22,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:46:22" (1/1) ... [2022-03-19 22:46:22,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:46:22" (1/1) ... [2022-03-19 22:46:22,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:46:22" (1/1) ... [2022-03-19 22:46:22,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:46:22" (1/1) ... [2022-03-19 22:46:22,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:46:22" (1/1) ... [2022-03-19 22:46:22,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-19 22:46:22,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-19 22:46:22,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-19 22:46:22,720 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-19 22:46:22,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:46:22" (1/1) ... [2022-03-19 22:46:22,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 22:46:22,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:46:22,747 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-03-19 22:46:22,749 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-03-19 22:46:22,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-19 22:46:22,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-19 22:46:22,785 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-19 22:46:22,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-19 22:46:22,785 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-19 22:46:22,785 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-19 22:46:22,785 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-19 22:46:22,785 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-19 22:46:22,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-19 22:46:22,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-19 22:46:22,786 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-19 22:46:22,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-19 22:46:22,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-19 22:46:22,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-19 22:46:22,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-19 22:46:22,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-19 22:46:22,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-19 22:46:22,836 INFO L234 CfgBuilder]: Building ICFG [2022-03-19 22:46:22,837 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-19 22:46:22,941 INFO L275 CfgBuilder]: Performing block encoding [2022-03-19 22:46:22,945 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-19 22:46:22,945 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-19 22:46:22,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 10:46:22 BoogieIcfgContainer [2022-03-19 22:46:22,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-19 22:46:22,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-19 22:46:22,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-19 22:46:22,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-19 22:46:22,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 10:46:22" (1/3) ... [2022-03-19 22:46:22,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a519ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 10:46:22, skipping insertion in model container [2022-03-19 22:46:22,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:46:22" (2/3) ... [2022-03-19 22:46:22,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a519ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 10:46:22, skipping insertion in model container [2022-03-19 22:46:22,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 10:46:22" (3/3) ... [2022-03-19 22:46:22,953 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono1_1-2.c [2022-03-19 22:46:22,956 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-19 22:46:22,956 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-19 22:46:22,986 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-19 22:46:22,991 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-03-19 22:46:22,992 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-19 22:46:23,002 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 22:46:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-19 22:46:23,005 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:46:23,006 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:46:23,007 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:46:23,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:46:23,010 INFO L85 PathProgramCache]: Analyzing trace with hash 491760044, now seen corresponding path program 1 times [2022-03-19 22:46:23,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:46:23,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883223469] [2022-03-19 22:46:23,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:46:23,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:46:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:46:23,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:46:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:46:23,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:46:23,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:46:23,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883223469] [2022-03-19 22:46:23,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883223469] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 22:46:23,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 22:46:23,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-19 22:46:23,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963156741] [2022-03-19 22:46:23,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 22:46:23,139 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-19 22:46:23,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:46:23,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-19 22:46:23,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-19 22:46:23,159 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:46:23,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:46:23,201 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-03-19 22:46:23,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-19 22:46:23,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-03-19 22:46:23,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:46:23,208 INFO L225 Difference]: With dead ends: 30 [2022-03-19 22:46:23,208 INFO L226 Difference]: Without dead ends: 13 [2022-03-19 22:46:23,216 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-19 22:46:23,219 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 22:46:23,220 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 22:46:23,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-03-19 22:46:23,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-03-19 22:46:23,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:46:23,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-03-19 22:46:23,253 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-03-19 22:46:23,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:46:23,254 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-03-19 22:46:23,254 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:46:23,254 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-03-19 22:46:23,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-19 22:46:23,254 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:46:23,254 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:46:23,255 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-19 22:46:23,255 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:46:23,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:46:23,258 INFO L85 PathProgramCache]: Analyzing trace with hash 482524834, now seen corresponding path program 1 times [2022-03-19 22:46:23,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:46:23,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99208218] [2022-03-19 22:46:23,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:46:23,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:46:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:46:23,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:46:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:46:23,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:46:23,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:46:23,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99208218] [2022-03-19 22:46:23,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99208218] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 22:46:23,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 22:46:23,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 22:46:23,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905081273] [2022-03-19 22:46:23,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 22:46:23,393 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 22:46:23,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:46:23,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 22:46:23,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 22:46:23,394 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:46:23,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:46:23,436 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-03-19 22:46:23,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 22:46:23,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-03-19 22:46:23,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:46:23,438 INFO L225 Difference]: With dead ends: 22 [2022-03-19 22:46:23,438 INFO L226 Difference]: Without dead ends: 15 [2022-03-19 22:46:23,441 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-03-19 22:46:23,442 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 22:46:23,443 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 22:46:23,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-03-19 22:46:23,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-03-19 22:46:23,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:46:23,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-03-19 22:46:23,452 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-03-19 22:46:23,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:46:23,453 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-03-19 22:46:23,454 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:46:23,454 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-03-19 22:46:23,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-19 22:46:23,457 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:46:23,457 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:46:23,457 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-19 22:46:23,457 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:46:23,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:46:23,458 INFO L85 PathProgramCache]: Analyzing trace with hash 925229631, now seen corresponding path program 1 times [2022-03-19 22:46:23,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:46:23,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804762471] [2022-03-19 22:46:23,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:46:23,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:46:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:46:23,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:46:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:46:23,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:46:23,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:46:23,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804762471] [2022-03-19 22:46:23,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804762471] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:46:23,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868900773] [2022-03-19 22:46:23,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:46:23,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:46:23,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:46:23,560 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:46:23,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-19 22:46:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:46:23,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-19 22:46:23,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:46:23,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:46:23,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:46:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:46:23,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868900773] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:46:23,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:46:23,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 7] total 11 [2022-03-19 22:46:23,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866002692] [2022-03-19 22:46:23,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:46:23,809 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-19 22:46:23,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:46:23,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-19 22:46:23,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-19 22:46:23,810 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:46:23,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:46:23,933 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-03-19 22:46:23,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 22:46:23,933 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-03-19 22:46:23,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:46:23,934 INFO L225 Difference]: With dead ends: 25 [2022-03-19 22:46:23,934 INFO L226 Difference]: Without dead ends: 18 [2022-03-19 22:46:23,936 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-03-19 22:46:23,938 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 22:46:23,938 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 48 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 22:46:23,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-03-19 22:46:23,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-03-19 22:46:23,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:46:23,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-03-19 22:46:23,941 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2022-03-19 22:46:23,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:46:23,941 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-03-19 22:46:23,941 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:46:23,942 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-03-19 22:46:23,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-19 22:46:23,958 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:46:23,958 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:46:23,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-19 22:46:24,172 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:46:24,178 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:46:24,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:46:24,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1870024951, now seen corresponding path program 1 times [2022-03-19 22:46:24,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:46:24,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547238337] [2022-03-19 22:46:24,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:46:24,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:46:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:46:24,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:46:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:46:24,270 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:46:24,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:46:24,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547238337] [2022-03-19 22:46:24,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547238337] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:46:24,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861037707] [2022-03-19 22:46:24,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:46:24,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:46:24,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:46:24,272 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:46:24,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-19 22:46:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:46:24,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-19 22:46:24,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:46:24,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:46:24,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:46:24,447 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:46:24,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861037707] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:46:24,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:46:24,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-03-19 22:46:24,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622719642] [2022-03-19 22:46:24,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:46:24,448 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-19 22:46:24,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:46:24,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-19 22:46:24,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-03-19 22:46:24,449 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:46:24,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:46:24,664 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-03-19 22:46:24,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-19 22:46:24,665 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-19 22:46:24,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:46:24,665 INFO L225 Difference]: With dead ends: 34 [2022-03-19 22:46:24,665 INFO L226 Difference]: Without dead ends: 26 [2022-03-19 22:46:24,666 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2022-03-19 22:46:24,666 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 22:46:24,667 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 39 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 22:46:24,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-03-19 22:46:24,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-03-19 22:46:24,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:46:24,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-03-19 22:46:24,670 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 17 [2022-03-19 22:46:24,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:46:24,670 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-03-19 22:46:24,671 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:46:24,671 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-03-19 22:46:24,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-19 22:46:24,671 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:46:24,671 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:46:24,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-19 22:46:24,883 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-19 22:46:24,884 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:46:24,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:46:24,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1290036459, now seen corresponding path program 2 times [2022-03-19 22:46:24,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:46:24,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883336858] [2022-03-19 22:46:24,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:46:24,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:46:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:46:24,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:46:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:46:24,993 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:46:24,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:46:24,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883336858] [2022-03-19 22:46:24,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883336858] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:46:24,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936740492] [2022-03-19 22:46:24,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 22:46:24,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:46:24,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:46:24,995 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:46:25,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-19 22:46:25,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 22:46:25,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:46:25,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-19 22:46:25,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:46:25,147 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:46:25,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:46:25,427 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:46:25,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936740492] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:46:25,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:46:25,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 23 [2022-03-19 22:46:25,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71169378] [2022-03-19 22:46:25,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:46:25,428 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-19 22:46:25,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:46:25,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-19 22:46:25,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-03-19 22:46:25,429 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:46:26,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:46:26,596 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-03-19 22:46:26,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-19 22:46:26,597 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-03-19 22:46:26,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:46:26,598 INFO L225 Difference]: With dead ends: 47 [2022-03-19 22:46:26,598 INFO L226 Difference]: Without dead ends: 36 [2022-03-19 22:46:26,599 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=311, Invalid=1095, Unknown=0, NotChecked=0, Total=1406 [2022-03-19 22:46:26,599 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-19 22:46:26,600 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 71 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-19 22:46:26,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-03-19 22:46:26,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-03-19 22:46:26,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:46:26,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-03-19 22:46:26,605 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 25 [2022-03-19 22:46:26,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:46:26,605 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-03-19 22:46:26,605 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:46:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-03-19 22:46:26,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-19 22:46:26,606 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:46:26,606 INFO L499 BasicCegarLoop]: trace histogram [12, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:46:26,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-19 22:46:26,827 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:46:26,828 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:46:26,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:46:26,828 INFO L85 PathProgramCache]: Analyzing trace with hash -205570380, now seen corresponding path program 3 times [2022-03-19 22:46:26,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:46:26,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528928933] [2022-03-19 22:46:26,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:46:26,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:46:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:46:26,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:46:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:46:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 56 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-19 22:46:26,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:46:26,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528928933] [2022-03-19 22:46:26,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528928933] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:46:26,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703310965] [2022-03-19 22:46:26,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-19 22:46:26,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:46:26,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:46:26,980 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:46:26,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-19 22:46:27,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-03-19 22:46:27,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:46:27,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-19 22:46:27,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:46:27,403 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 77 proven. 25 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-03-19 22:46:27,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:46:27,870 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 77 proven. 25 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-03-19 22:46:27,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703310965] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:46:27,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:46:27,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 12] total 27 [2022-03-19 22:46:27,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980442636] [2022-03-19 22:46:27,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:46:27,871 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-19 22:46:27,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:46:27,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-19 22:46:27,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2022-03-19 22:46:27,872 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:46:30,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:46:30,908 INFO L93 Difference]: Finished difference Result 73 states and 99 transitions. [2022-03-19 22:46:30,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-19 22:46:30,909 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-03-19 22:46:30,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:46:30,910 INFO L225 Difference]: With dead ends: 73 [2022-03-19 22:46:30,910 INFO L226 Difference]: Without dead ends: 54 [2022-03-19 22:46:30,911 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=563, Invalid=2089, Unknown=0, NotChecked=0, Total=2652 [2022-03-19 22:46:30,912 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 64 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-19 22:46:30,912 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 61 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-19 22:46:30,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-03-19 22:46:30,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-03-19 22:46:30,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:46:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-03-19 22:46:30,917 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 35 [2022-03-19 22:46:30,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:46:30,917 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-03-19 22:46:30,918 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:46:30,918 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-03-19 22:46:30,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-19 22:46:30,918 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:46:30,918 INFO L499 BasicCegarLoop]: trace histogram [20, 12, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:46:30,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-19 22:46:31,123 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:46:31,123 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:46:31,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:46:31,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1196262066, now seen corresponding path program 4 times [2022-03-19 22:46:31,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:46:31,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642820182] [2022-03-19 22:46:31,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:46:31,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:46:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:46:31,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:46:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:46:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-03-19 22:46:31,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:46:31,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642820182] [2022-03-19 22:46:31,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642820182] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:46:31,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597554427] [2022-03-19 22:46:31,313 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-19 22:46:31,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:46:31,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:46:31,316 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:46:31,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-19 22:46:31,357 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-19 22:46:31,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:46:31,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-19 22:46:31,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:46:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-19 22:46:31,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:46:32,357 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-19 22:46:32,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597554427] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:46:32,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:46:32,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 19] total 37 [2022-03-19 22:46:32,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55900051] [2022-03-19 22:46:32,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:46:32,359 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-19 22:46:32,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:46:32,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-19 22:46:32,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=962, Unknown=0, NotChecked=0, Total=1332 [2022-03-19 22:46:32,360 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:47:00,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:47:00,108 INFO L93 Difference]: Finished difference Result 116 states and 147 transitions. [2022-03-19 22:47:00,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-19 22:47:00,109 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-03-19 22:47:00,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:47:00,109 INFO L225 Difference]: With dead ends: 116 [2022-03-19 22:47:00,110 INFO L226 Difference]: Without dead ends: 86 [2022-03-19 22:47:00,111 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 28.1s TimeCoverageRelationStatistics Valid=1061, Invalid=2845, Unknown=0, NotChecked=0, Total=3906 [2022-03-19 22:47:00,111 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-19 22:47:00,111 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 99 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-19 22:47:00,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-03-19 22:47:00,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-03-19 22:47:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 81 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:47:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-03-19 22:47:00,131 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 51 [2022-03-19 22:47:00,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:47:00,132 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-03-19 22:47:00,132 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:47:00,132 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-03-19 22:47:00,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-03-19 22:47:00,133 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:47:00,133 INFO L499 BasicCegarLoop]: trace histogram [37, 25, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:47:00,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-19 22:47:00,347 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:47:00,348 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:47:00,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:47:00,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1470206021, now seen corresponding path program 5 times [2022-03-19 22:47:00,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:47:00,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689942948] [2022-03-19 22:47:00,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:47:00,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:47:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:47:00,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:47:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:47:00,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 598 proven. 650 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-03-19 22:47:00,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:47:00,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689942948] [2022-03-19 22:47:00,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689942948] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:47:00,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269843280] [2022-03-19 22:47:00,886 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-19 22:47:00,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:47:00,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:47:00,888 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:47:00,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-19 22:47:09,340 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2022-03-19 22:47:09,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:47:09,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 66 conjunts are in the unsatisfiable core [2022-03-19 22:47:09,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:47:09,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 352 proven. 992 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-03-19 22:47:09,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:47:12,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 352 proven. 992 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-03-19 22:47:12,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269843280] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:47:12,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:47:12,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 34, 35] total 69 [2022-03-19 22:47:12,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788416824] [2022-03-19 22:47:12,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:47:12,014 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-03-19 22:47:12,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:47:12,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-03-19 22:47:12,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1251, Invalid=3441, Unknown=0, NotChecked=0, Total=4692 [2022-03-19 22:47:12,016 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:47:44,163 WARN L232 SmtUtils]: Spent 10.84s on a formula simplification. DAG size of input: 230 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:48:13,381 WARN L232 SmtUtils]: Spent 8.96s on a formula simplification. DAG size of input: 223 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:48:49,329 WARN L232 SmtUtils]: Spent 12.17s on a formula simplification. DAG size of input: 216 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:48:51,355 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (not (< .cse0 100000000)))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse1 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse4 100000000)) (< .cse4 10000000))) (let ((.cse5 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse9 100000000)) (< .cse9 10000000))) (let ((.cse10 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 13 c_main_~x~0) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ 33 c_main_~x~0) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (let ((.cse19 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse19 10000000) (not (< .cse19 100000000)))) (let ((.cse20 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< .cse24 10000000) (not (< .cse24 100000000)))) (let ((.cse25 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod c_main_~x~0 4294967296) 10000000) (let ((.cse26 (mod (+ c_main_~x~0 27) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse27 10000000) (not (< .cse27 100000000))))) is different from false [2022-03-19 22:48:53,394 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (not (< .cse0 100000000)))) (let ((.cse1 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse4 100000000)) (< .cse4 10000000))) (let ((.cse5 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse9 100000000)) (< .cse9 10000000))) (let ((.cse10 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 13 c_main_~x~0) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ 33 c_main_~x~0) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (let ((.cse19 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse19 10000000) (not (< .cse19 100000000)))) (let ((.cse20 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< .cse24 10000000) (not (< .cse24 100000000)))) (let ((.cse25 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (< (mod c_main_~x~0 4294967296) 10000000) (let ((.cse26 (mod (+ c_main_~x~0 27) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse27 10000000) (not (< .cse27 100000000))))) is different from false [2022-03-19 22:49:49,525 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (not (< .cse0 100000000)))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse1 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse8 100000000)) (< .cse8 10000000))) (let ((.cse9 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 13 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse12 100000000)) (< .cse12 10000000))) (let ((.cse13 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse16 10000000) (not (< .cse16 100000000)))) (let ((.cse17 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (let ((.cse21 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod c_main_~x~0 4294967296) 10000000) (let ((.cse24 (mod (+ c_main_~x~0 27) 4294967296))) (or (< .cse24 10000000) (not (< .cse24 100000000)))) (let ((.cse25 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse25 10000000) (not (< .cse25 100000000))))) is different from false [2022-03-19 22:50:44,586 WARN L232 SmtUtils]: Spent 24.14s on a formula simplification. DAG size of input: 200 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:51:23,575 WARN L232 SmtUtils]: Spent 10.04s on a formula simplification. DAG size of input: 189 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:51:52,261 WARN L232 SmtUtils]: Spent 5.40s on a formula simplification. DAG size of input: 188 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:52:49,766 WARN L232 SmtUtils]: Spent 25.96s on a formula simplification. DAG size of input: 207 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:54:11,946 WARN L232 SmtUtils]: Spent 30.19s on a formula simplification. DAG size of input: 214 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:54:13,978 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (not (< .cse0 100000000)))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse1 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse8 100000000)) (< .cse8 10000000))) (let ((.cse9 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 13 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse12 100000000)) (< .cse12 10000000))) (let ((.cse13 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse16 10000000) (not (< .cse16 100000000)))) (let ((.cse17 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (let ((.cse19 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod c_main_~x~0 4294967296) 10000000) (let ((.cse21 (mod (+ c_main_~x~0 27) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (let ((.cse22 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000))))) is different from false [2022-03-19 22:55:16,416 WARN L232 SmtUtils]: Spent 17.77s on a formula simplification. DAG size of input: 221 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:57:18,455 WARN L232 SmtUtils]: Spent 27.95s on a formula simplification. DAG size of input: 228 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:58:56,178 WARN L232 SmtUtils]: Spent 47.38s on a formula simplification. DAG size of input: 233 DAG size of output: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)