/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/loop-acceleration/phases_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-5d317bd [2022-03-18 11:54:29,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-18 11:54:29,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-18 11:54:29,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-18 11:54:29,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-18 11:54:29,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-18 11:54:29,370 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-18 11:54:29,371 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-18 11:54:29,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-18 11:54:29,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-18 11:54:29,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-18 11:54:29,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-18 11:54:29,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-18 11:54:29,381 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-18 11:54:29,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-18 11:54:29,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-18 11:54:29,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-18 11:54:29,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-18 11:54:29,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-18 11:54:29,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-18 11:54:29,394 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-18 11:54:29,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-18 11:54:29,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-18 11:54:29,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-18 11:54:29,400 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-18 11:54:29,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-18 11:54:29,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-18 11:54:29,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-18 11:54:29,403 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-18 11:54:29,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-18 11:54:29,404 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-18 11:54:29,404 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-18 11:54:29,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-18 11:54:29,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-18 11:54:29,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-18 11:54:29,406 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-18 11:54:29,406 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-18 11:54:29,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-18 11:54:29,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-18 11:54:29,407 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-18 11:54:29,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-18 11:54:29,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-18 11:54:29,411 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-18 11:54:29,433 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-18 11:54:29,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-18 11:54:29,433 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-18 11:54:29,433 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-18 11:54:29,435 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-18 11:54:29,435 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-18 11:54:29,435 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-18 11:54:29,435 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-18 11:54:29,435 INFO L138 SettingsManager]: * Use SBE=true [2022-03-18 11:54:29,436 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-18 11:54:29,436 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-18 11:54:29,436 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-18 11:54:29,436 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-18 11:54:29,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-18 11:54:29,436 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-18 11:54:29,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-18 11:54:29,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-18 11:54:29,437 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-18 11:54:29,437 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-18 11:54:29,438 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-18 11:54:29,438 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-18 11:54:29,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-18 11:54:29,438 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-18 11:54:29,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-18 11:54:29,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 11:54:29,438 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-18 11:54:29,438 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-18 11:54:29,438 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-18 11:54:29,438 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-18 11:54:29,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-18 11:54:29,439 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-18 11:54:29,439 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-03-18 11:54:29,439 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-18 11:54:29,439 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-18 11:54:29,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-18 11:54:29,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-18 11:54:29,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-18 11:54:29,600 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-18 11:54:29,600 INFO L275 PluginConnector]: CDTParser initialized [2022-03-18 11:54:29,601 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_1-2.c [2022-03-18 11:54:29,651 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebba93202/2d044456243941aa807eb0295608c264/FLAG0bc0c4a3c [2022-03-18 11:54:29,980 INFO L306 CDTParser]: Found 1 translation units. [2022-03-18 11:54:29,980 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-2.c [2022-03-18 11:54:29,985 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebba93202/2d044456243941aa807eb0295608c264/FLAG0bc0c4a3c [2022-03-18 11:54:29,993 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebba93202/2d044456243941aa807eb0295608c264 [2022-03-18 11:54:29,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-18 11:54:29,996 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-18 11:54:29,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-18 11:54:29,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-18 11:54:30,000 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-18 11:54:30,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 11:54:29" (1/1) ... [2022-03-18 11:54:30,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@303d20aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:54:30, skipping insertion in model container [2022-03-18 11:54:30,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 11:54:29" (1/1) ... [2022-03-18 11:54:30,006 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-18 11:54:30,016 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-18 11:54:30,127 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-2.c[322,335] [2022-03-18 11:54:30,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 11:54:30,137 INFO L203 MainTranslator]: Completed pre-run [2022-03-18 11:54:30,144 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-2.c[322,335] [2022-03-18 11:54:30,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 11:54:30,153 INFO L208 MainTranslator]: Completed translation [2022-03-18 11:54:30,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:54:30 WrapperNode [2022-03-18 11:54:30,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-18 11:54:30,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-18 11:54:30,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-18 11:54:30,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-18 11:54:30,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:54:30" (1/1) ... [2022-03-18 11:54:30,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:54:30" (1/1) ... [2022-03-18 11:54:30,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:54:30" (1/1) ... [2022-03-18 11:54:30,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:54:30" (1/1) ... [2022-03-18 11:54:30,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:54:30" (1/1) ... [2022-03-18 11:54:30,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:54:30" (1/1) ... [2022-03-18 11:54:30,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:54:30" (1/1) ... [2022-03-18 11:54:30,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-18 11:54:30,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-18 11:54:30,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-18 11:54:30,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-18 11:54:30,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:54:30" (1/1) ... [2022-03-18 11:54:30,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 11:54:30,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:54:30,201 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-18 11:54:30,205 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-18 11:54:30,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-18 11:54:30,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-18 11:54:30,234 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-18 11:54:30,234 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-18 11:54:30,234 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-18 11:54:30,234 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-18 11:54:30,234 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-18 11:54:30,234 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-18 11:54:30,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-18 11:54:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-18 11:54:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-18 11:54:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-18 11:54:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-18 11:54:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-18 11:54:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-18 11:54:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-18 11:54:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-18 11:54:30,274 INFO L234 CfgBuilder]: Building ICFG [2022-03-18 11:54:30,275 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-18 11:54:30,333 INFO L275 CfgBuilder]: Performing block encoding [2022-03-18 11:54:30,337 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-18 11:54:30,337 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-18 11:54:30,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 11:54:30 BoogieIcfgContainer [2022-03-18 11:54:30,338 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-18 11:54:30,339 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-18 11:54:30,339 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-18 11:54:30,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-18 11:54:30,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.03 11:54:29" (1/3) ... [2022-03-18 11:54:30,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9963391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 11:54:30, skipping insertion in model container [2022-03-18 11:54:30,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:54:30" (2/3) ... [2022-03-18 11:54:30,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9963391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 11:54:30, skipping insertion in model container [2022-03-18 11:54:30,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 11:54:30" (3/3) ... [2022-03-18 11:54:30,351 INFO L111 eAbstractionObserver]: Analyzing ICFG phases_1-2.c [2022-03-18 11:54:30,354 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-18 11:54:30,354 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-18 11:54:30,381 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-18 11:54:30,386 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-18 11:54:30,386 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-18 11:54:30,395 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-18 11:54:30,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-18 11:54:30,398 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:54:30,398 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:54:30,399 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:54:30,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:54:30,402 INFO L85 PathProgramCache]: Analyzing trace with hash 491760044, now seen corresponding path program 1 times [2022-03-18 11:54:30,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:54:30,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308653536] [2022-03-18 11:54:30,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:54:30,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:54:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:54:30,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:54:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:54:30,577 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-18 11:54:30,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:54:30,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308653536] [2022-03-18 11:54:30,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308653536] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 11:54:30,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 11:54:30,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-18 11:54:30,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823340769] [2022-03-18 11:54:30,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 11:54:30,583 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-18 11:54:30,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:54:30,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-18 11:54:30,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-18 11:54:30,631 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-18 11:54:30,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:54:30,667 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-03-18 11:54:30,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-18 11:54:30,669 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-18 11:54:30,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:54:30,672 INFO L225 Difference]: With dead ends: 30 [2022-03-18 11:54:30,673 INFO L226 Difference]: Without dead ends: 13 [2022-03-18 11:54:30,674 INFO L911 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-18 11:54:30,677 INFO L912 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-18 11:54:30,677 INFO L913 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-18 11:54:30,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-03-18 11:54:30,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-03-18 11:54:30,707 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-18 11:54:30,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-03-18 11:54:30,708 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-03-18 11:54:30,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:54:30,709 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-03-18 11:54:30,709 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-18 11:54:30,709 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-03-18 11:54:30,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-18 11:54:30,710 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:54:30,710 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:54:30,710 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-18 11:54:30,711 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:54:30,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:54:30,713 INFO L85 PathProgramCache]: Analyzing trace with hash 482524834, now seen corresponding path program 1 times [2022-03-18 11:54:30,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:54:30,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138904593] [2022-03-18 11:54:30,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:54:30,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:54:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:54:30,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:54:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:54:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:54:30,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:54:30,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138904593] [2022-03-18 11:54:30,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138904593] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 11:54:30,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 11:54:30,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 11:54:30,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133255796] [2022-03-18 11:54:30,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 11:54:30,824 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 11:54:30,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:54:30,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 11:54:30,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 11:54:30,825 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-18 11:54:30,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:54:30,861 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-03-18 11:54:30,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 11:54:30,861 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-18 11:54:30,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:54:30,862 INFO L225 Difference]: With dead ends: 22 [2022-03-18 11:54:30,862 INFO L226 Difference]: Without dead ends: 15 [2022-03-18 11:54:30,865 INFO L911 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-18 11:54:30,866 INFO L912 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-18 11:54:30,866 INFO L913 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-18 11:54:30,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-03-18 11:54:30,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-03-18 11:54:30,869 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-18 11:54:30,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-03-18 11:54:30,870 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-03-18 11:54:30,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:54:30,870 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-03-18 11:54:30,870 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-18 11:54:30,870 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-03-18 11:54:30,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-18 11:54:30,871 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:54:30,871 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:54:30,871 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-18 11:54:30,871 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:54:30,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:54:30,872 INFO L85 PathProgramCache]: Analyzing trace with hash 925229631, now seen corresponding path program 1 times [2022-03-18 11:54:30,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:54:30,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657221694] [2022-03-18 11:54:30,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:54:30,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:54:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:54:30,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:54:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:54:30,969 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-18 11:54:30,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:54:30,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657221694] [2022-03-18 11:54:30,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657221694] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:54:30,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601064132] [2022-03-18 11:54:30,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:54:30,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:54:30,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:54:30,973 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-18 11:54:30,974 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-18 11:54:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:54:31,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-18 11:54:31,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:54:31,061 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-18 11:54:31,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 11:54:31,116 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-18 11:54:31,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601064132] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 11:54:31,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 11:54:31,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-03-18 11:54:31,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225952231] [2022-03-18 11:54:31,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 11:54:31,117 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-18 11:54:31,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:54:31,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-18 11:54:31,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-03-18 11:54:31,118 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-18 11:54:31,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:54:31,229 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-03-18 11:54:31,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-18 11:54:31,230 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 13 [2022-03-18 11:54:31,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:54:31,231 INFO L225 Difference]: With dead ends: 26 [2022-03-18 11:54:31,231 INFO L226 Difference]: Without dead ends: 19 [2022-03-18 11:54:31,232 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-03-18 11:54:31,234 INFO L912 BasicCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 11:54:31,236 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 33 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 11:54:31,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-03-18 11:54:31,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-03-18 11:54:31,242 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-18 11:54:31,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-03-18 11:54:31,242 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2022-03-18 11:54:31,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:54:31,243 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-03-18 11:54:31,243 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-18 11:54:31,243 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-03-18 11:54:31,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-18 11:54:31,244 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:54:31,244 INFO L500 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:54:31,263 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-18 11:54:31,455 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-18 11:54:31,456 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:54:31,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:54:31,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1870024951, now seen corresponding path program 1 times [2022-03-18 11:54:31,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:54:31,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461326269] [2022-03-18 11:54:31,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:54:31,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:54:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:54:31,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:54:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:54:31,528 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-18 11:54:31,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:54:31,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461326269] [2022-03-18 11:54:31,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461326269] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:54:31,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922798983] [2022-03-18 11:54:31,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:54:31,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:54:31,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:54:31,530 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-18 11:54:31,531 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-18 11:54:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:54:31,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-18 11:54:31,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:54:31,699 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:54:31,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 11:54:31,772 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-18 11:54:31,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922798983] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 11:54:31,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 11:54:31,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 12 [2022-03-18 11:54:31,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506504563] [2022-03-18 11:54:31,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 11:54:31,774 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-18 11:54:31,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:54:31,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-18 11:54:31,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-03-18 11:54:31,776 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 11:54:31,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:54:31,908 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-03-18 11:54:31,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-18 11:54:31,908 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-18 11:54:31,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:54:31,909 INFO L225 Difference]: With dead ends: 34 [2022-03-18 11:54:31,909 INFO L226 Difference]: Without dead ends: 23 [2022-03-18 11:54:31,909 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-03-18 11:54:31,910 INFO L912 BasicCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 11:54:31,910 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 48 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 11:54:31,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-03-18 11:54:31,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-03-18 11:54:31,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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-18 11:54:31,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-03-18 11:54:31,914 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2022-03-18 11:54:31,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:54:31,914 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-03-18 11:54:31,914 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 11:54:31,914 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-03-18 11:54:31,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-18 11:54:31,915 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:54:31,915 INFO L500 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:54:31,933 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-18 11:54:32,127 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-18 11:54:32,128 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:54:32,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:54:32,128 INFO L85 PathProgramCache]: Analyzing trace with hash -555382060, now seen corresponding path program 2 times [2022-03-18 11:54:32,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:54:32,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501907861] [2022-03-18 11:54:32,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:54:32,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:54:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:54:32,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:54:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:54:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:54:32,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:54:32,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501907861] [2022-03-18 11:54:32,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501907861] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:54:32,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377637867] [2022-03-18 11:54:32,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 11:54:32,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:54:32,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:54:32,252 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-18 11:54:32,253 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-18 11:54:32,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 11:54:32,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 11:54:32,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-18 11:54:32,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:54:32,345 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:54:32,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 11:54:32,454 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:54:32,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377637867] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 11:54:32,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 11:54:32,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2022-03-18 11:54:32,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061588614] [2022-03-18 11:54:32,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 11:54:32,455 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-18 11:54:32,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:54:32,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-18 11:54:32,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-03-18 11:54:32,456 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 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-18 11:54:32,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:54:32,726 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-03-18 11:54:32,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-18 11:54:32,727 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 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 19 [2022-03-18 11:54:32,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:54:32,727 INFO L225 Difference]: With dead ends: 42 [2022-03-18 11:54:32,727 INFO L226 Difference]: Without dead ends: 32 [2022-03-18 11:54:32,728 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=309, Unknown=0, NotChecked=0, Total=462 [2022-03-18 11:54:32,728 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 11:54:32,728 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 44 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 11:54:32,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-03-18 11:54:32,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-03-18 11:54:32,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 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-18 11:54:32,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-03-18 11:54:32,733 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 19 [2022-03-18 11:54:32,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:54:32,733 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-03-18 11:54:32,733 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 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-18 11:54:32,733 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-03-18 11:54:32,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-18 11:54:32,734 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:54:32,734 INFO L500 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:54:32,752 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-18 11:54:32,943 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-18 11:54:32,944 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:54:32,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:54:32,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1819864638, now seen corresponding path program 3 times [2022-03-18 11:54:32,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:54:32,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322896252] [2022-03-18 11:54:32,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:54:32,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:54:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:54:33,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:54:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:54:33,087 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:54:33,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:54:33,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322896252] [2022-03-18 11:54:33,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322896252] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:54:33,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036245147] [2022-03-18 11:54:33,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-18 11:54:33,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:54:33,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:54:33,089 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-18 11:54:33,090 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-18 11:54:33,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-18 11:54:33,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 11:54:33,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-18 11:54:33,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:54:33,193 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-03-18 11:54:33,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 11:54:33,270 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-03-18 11:54:33,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036245147] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 11:54:33,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 11:54:33,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 17 [2022-03-18 11:54:33,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50083184] [2022-03-18 11:54:33,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 11:54:33,271 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-18 11:54:33,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:54:33,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-18 11:54:33,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-03-18 11:54:33,272 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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-18 11:54:33,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:54:33,616 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-03-18 11:54:33,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-18 11:54:33,617 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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 31 [2022-03-18 11:54:33,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:54:33,617 INFO L225 Difference]: With dead ends: 63 [2022-03-18 11:54:33,617 INFO L226 Difference]: Without dead ends: 53 [2022-03-18 11:54:33,618 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2022-03-18 11:54:33,618 INFO L912 BasicCegarLoop]: 11 mSDtfsCounter, 43 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 11:54:33,618 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 23 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 11:54:33,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-03-18 11:54:33,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2022-03-18 11:54:33,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 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-18 11:54:33,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-03-18 11:54:33,624 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 31 [2022-03-18 11:54:33,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:54:33,625 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-03-18 11:54:33,625 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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-18 11:54:33,625 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-03-18 11:54:33,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-18 11:54:33,625 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:54:33,625 INFO L500 BasicCegarLoop]: trace histogram [15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:54:33,644 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-18 11:54:33,839 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-18 11:54:33,839 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:54:33,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:54:33,840 INFO L85 PathProgramCache]: Analyzing trace with hash -934185075, now seen corresponding path program 4 times [2022-03-18 11:54:33,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:54:33,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626707851] [2022-03-18 11:54:33,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:54:33,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:54:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:54:34,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:54:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:54:34,034 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-18 11:54:34,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:54:34,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626707851] [2022-03-18 11:54:34,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626707851] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:54:34,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057869007] [2022-03-18 11:54:34,037 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-18 11:54:34,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:54:34,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:54:34,040 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-18 11:54:34,042 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-18 11:54:34,078 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-18 11:54:34,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 11:54:34,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-18 11:54:34,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:54:34,272 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:54:34,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 11:54:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:54:34,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057869007] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 11:54:34,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 11:54:34,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 36 [2022-03-18 11:54:34,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411353860] [2022-03-18 11:54:34,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 11:54:34,708 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-18 11:54:34,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:54:34,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-18 11:54:34,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=907, Unknown=0, NotChecked=0, Total=1260 [2022-03-18 11:54:34,709 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 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-18 11:54:43,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:54:43,176 INFO L93 Difference]: Finished difference Result 93 states and 126 transitions. [2022-03-18 11:54:43,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-18 11:54:43,176 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 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 41 [2022-03-18 11:54:43,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:54:43,178 INFO L225 Difference]: With dead ends: 93 [2022-03-18 11:54:43,178 INFO L226 Difference]: Without dead ends: 77 [2022-03-18 11:54:43,179 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=876, Invalid=2430, Unknown=0, NotChecked=0, Total=3306 [2022-03-18 11:54:43,180 INFO L912 BasicCegarLoop]: 11 mSDtfsCounter, 50 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-18 11:54:43,180 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 98 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-18 11:54:43,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-03-18 11:54:43,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 58. [2022-03-18 11:54:43,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 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-18 11:54:43,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2022-03-18 11:54:43,187 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 41 [2022-03-18 11:54:43,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:54:43,187 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2022-03-18 11:54:43,188 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 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-18 11:54:43,188 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-03-18 11:54:43,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-03-18 11:54:43,188 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:54:43,188 INFO L500 BasicCegarLoop]: trace histogram [23, 13, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:54:43,207 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-18 11:54:43,399 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-18 11:54:43,399 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:54:43,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:54:43,400 INFO L85 PathProgramCache]: Analyzing trace with hash -841578903, now seen corresponding path program 5 times [2022-03-18 11:54:43,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:54:43,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263201255] [2022-03-18 11:54:43,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:54:43,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:54:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:54:43,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:54:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:54:43,620 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 266 proven. 182 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-03-18 11:54:43,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:54:43,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263201255] [2022-03-18 11:54:43,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263201255] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:54:43,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938176223] [2022-03-18 11:54:43,620 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-18 11:54:43,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:54:43,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:54:43,622 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-18 11:54:43,623 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-18 11:54:44,469 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-03-18 11:54:44,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 11:54:44,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 38 conjunts are in the unsatisfiable core [2022-03-18 11:54:44,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:54:44,709 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 198 proven. 306 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-03-18 11:54:44,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 11:54:45,559 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 198 proven. 306 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-03-18 11:54:45,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938176223] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 11:54:45,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 11:54:45,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 21] total 41 [2022-03-18 11:54:45,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911999285] [2022-03-18 11:54:45,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 11:54:45,560 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-18 11:54:45,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:54:45,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-18 11:54:45,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=1185, Unknown=0, NotChecked=0, Total=1640 [2022-03-18 11:54:45,561 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 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-18 11:55:26,559 WARN L232 SmtUtils]: Spent 6.80s on a formula simplification. DAG size of input: 135 DAG size of output: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 11:55:26,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:55:26,597 INFO L93 Difference]: Finished difference Result 126 states and 168 transitions. [2022-03-18 11:55:26,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-18 11:55:26,597 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 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 57 [2022-03-18 11:55:26,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:55:26,598 INFO L225 Difference]: With dead ends: 126 [2022-03-18 11:55:26,598 INFO L226 Difference]: Without dead ends: 98 [2022-03-18 11:55:26,600 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 41.3s TimeCoverageRelationStatistics Valid=1475, Invalid=3927, Unknown=0, NotChecked=0, Total=5402 [2022-03-18 11:55:26,600 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 72 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-18 11:55:26,600 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 109 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-18 11:55:26,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-03-18 11:55:26,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-03-18 11:55:26,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 93 states have (on average 1.1290322580645162) internal successors, (105), 93 states have internal predecessors, (105), 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-18 11:55:26,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2022-03-18 11:55:26,618 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 57 [2022-03-18 11:55:26,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:55:26,619 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2022-03-18 11:55:26,619 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 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-18 11:55:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2022-03-18 11:55:26,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-03-18 11:55:26,623 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:55:26,623 INFO L500 BasicCegarLoop]: trace histogram [43, 33, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:55:26,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-18 11:55:26,824 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:55:26,824 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:55:26,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:55:26,825 INFO L85 PathProgramCache]: Analyzing trace with hash -535638483, now seen corresponding path program 6 times [2022-03-18 11:55:26,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:55:26,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392377409] [2022-03-18 11:55:26,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:55:26,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:55:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:55:27,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:55:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:55:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 646 proven. 1122 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-03-18 11:55:27,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:55:27,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392377409] [2022-03-18 11:55:27,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392377409] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:55:27,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551713662] [2022-03-18 11:55:27,455 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-18 11:55:27,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:55:27,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:55:27,456 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 11:55:27,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-18 11:55:30,211 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2022-03-18 11:55:30,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 11:55:30,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-18 11:55:30,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:55:30,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 693 proven. 100 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2022-03-18 11:55:30,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 11:55:32,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 693 proven. 100 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2022-03-18 11:55:32,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551713662] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 11:55:32,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 11:55:32,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13, 17] total 63 [2022-03-18 11:55:32,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859327533] [2022-03-18 11:55:32,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 11:55:32,619 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-18 11:55:32,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:55:32,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-18 11:55:32,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=956, Invalid=2950, Unknown=0, NotChecked=0, Total=3906 [2022-03-18 11:55:32,621 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand has 63 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 61 states have internal predecessors, (127), 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-18 11:56:45,300 WARN L232 SmtUtils]: Spent 11.42s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 11:56:45,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:56:45,343 INFO L93 Difference]: Finished difference Result 204 states and 275 transitions. [2022-03-18 11:56:45,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-03-18 11:56:45,343 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 61 states have internal predecessors, (127), 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 97 [2022-03-18 11:56:45,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:56:45,344 INFO L225 Difference]: With dead ends: 204 [2022-03-18 11:56:45,344 INFO L226 Difference]: Without dead ends: 173 [2022-03-18 11:56:45,349 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1959 ImplicationChecksByTransitivity, 72.6s TimeCoverageRelationStatistics Valid=2929, Invalid=12323, Unknown=0, NotChecked=0, Total=15252 [2022-03-18 11:56:45,349 INFO L912 BasicCegarLoop]: 9 mSDtfsCounter, 272 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 2049 mSolverCounterSat, 640 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 2689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 640 IncrementalHoareTripleChecker+Valid, 2049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-18 11:56:45,349 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 81 Invalid, 2689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [640 Valid, 2049 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-18 11:56:45,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-03-18 11:56:45,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 148. [2022-03-18 11:56:45,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.1048951048951048) internal successors, (158), 143 states have internal predecessors, (158), 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-18 11:56:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2022-03-18 11:56:45,376 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 97 [2022-03-18 11:56:45,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:56:45,376 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2022-03-18 11:56:45,376 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 61 states have internal predecessors, (127), 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-18 11:56:45,376 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2022-03-18 11:56:45,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-03-18 11:56:45,377 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:56:45,377 INFO L500 BasicCegarLoop]: trace histogram [57, 35, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:56:45,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-18 11:56:45,579 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:56:45,580 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:56:45,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:56:45,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1923461227, now seen corresponding path program 7 times [2022-03-18 11:56:45,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:56:45,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194271862] [2022-03-18 11:56:45,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:56:45,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:56:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:56:46,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:56:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:56:46,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1548 proven. 1260 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2022-03-18 11:56:46,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:56:46,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194271862] [2022-03-18 11:56:46,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194271862] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:56:46,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299022478] [2022-03-18 11:56:46,278 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-18 11:56:46,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:56:46,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:56:46,279 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 11:56:46,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-18 11:56:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:56:46,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 114 conjunts are in the unsatisfiable core [2022-03-18 11:56:46,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:56:47,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 168 proven. 3080 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 11:56:47,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 11:56:53,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 168 proven. 3080 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 11:56:53,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299022478] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 11:56:53,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 11:56:53,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 58, 59] total 117 [2022-03-18 11:56:53,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643732673] [2022-03-18 11:56:53,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 11:56:53,304 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2022-03-18 11:56:53,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:56:53,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2022-03-18 11:56:53,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3517, Invalid=10055, Unknown=0, NotChecked=0, Total=13572 [2022-03-18 11:56:53,328 INFO L87 Difference]: Start difference. First operand 148 states and 162 transitions. Second operand has 117 states, 117 states have (on average 2.034188034188034) internal successors, (238), 116 states have internal predecessors, (238), 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-18 11:56:57,478 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse0 268435455)) (< .cse0 65521))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse1 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse1 65521) (not (< .cse1 268435455)))) (let ((.cse2 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse2 65521) (not (< .cse2 268435455)))) (let ((.cse3 (mod (+ 2 c_main_~x~0) 4294967296))) (or (not (< .cse3 268435455)) (< .cse3 65521))) (let ((.cse4 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse4 268435455)) (< .cse4 65521))) (let ((.cse5 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (< .cse5 268435455)) (< .cse5 65521))) (let ((.cse6 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse6 268435455)) (< .cse6 65521))) (let ((.cse7 (mod (+ 32 c_main_~x~0) 4294967296))) (or (< .cse7 65521) (not (< .cse7 268435455)))) (let ((.cse8 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse8 65521) (not (< .cse8 268435455)))) (< (mod c_main_~x~0 4294967296) 65521) (let ((.cse9 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (< .cse9 268435455)) (< .cse9 65521))) (let ((.cse10 (mod (+ 41 c_main_~x~0) 4294967296))) (or (< .cse10 65521) (not (< .cse10 268435455)))) (let ((.cse11 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse11 65521) (not (< .cse11 268435455)))) (let ((.cse12 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (< .cse12 268435455)) (< .cse12 65521))) (let ((.cse13 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< .cse13 65521) (not (< .cse13 268435455)))) (let ((.cse14 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (< .cse14 268435455)) (< .cse14 65521))) (let ((.cse15 (mod (+ 26 c_main_~x~0) 4294967296))) (or (< .cse15 65521) (not (< .cse15 268435455)))) (let ((.cse16 (mod (+ 51 c_main_~x~0) 4294967296))) (or (< .cse16 65521) (not (< .cse16 268435455)))) (let ((.cse17 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse17 65521) (not (< .cse17 268435455)))) (let ((.cse18 (mod (+ 18 c_main_~x~0) 4294967296))) (or (< .cse18 65521) (not (< .cse18 268435455)))) (let ((.cse19 (mod (+ 70 c_main_~x~0) 4294967296))) (or (not (< .cse19 268435455)) (< .cse19 65521))) (let ((.cse20 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse20 65521) (not (< .cse20 268435455)))) (let ((.cse21 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse21 65521) (not (< .cse21 268435455)))) (let ((.cse22 (mod (+ 64 c_main_~x~0) 4294967296))) (or (not (< .cse22 268435455)) (< .cse22 65521))) (let ((.cse23 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse23 268435455)) (< .cse23 65521))) (let ((.cse24 (mod (+ 43 c_main_~x~0) 4294967296))) (or (< .cse24 65521) (not (< .cse24 268435455)))) (let ((.cse25 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse25 65521) (not (< .cse25 268435455)))) (let ((.cse26 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse26 65521) (not (< .cse26 268435455)))) (let ((.cse27 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse27 268435455)) (< .cse27 65521))) (let ((.cse28 (mod (+ 22 c_main_~x~0) 4294967296))) (or (< .cse28 65521) (not (< .cse28 268435455)))) (let ((.cse29 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (< .cse29 268435455)) (< .cse29 65521))) (let ((.cse30 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse30 65521) (not (< .cse30 268435455)))) (let ((.cse31 (mod (+ 48 c_main_~x~0) 4294967296))) (or (not (< .cse31 268435455)) (< .cse31 65521))) (let ((.cse32 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (< .cse32 268435455)) (< .cse32 65521))) (let ((.cse33 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse33 268435455)) (< .cse33 65521))) (let ((.cse34 (mod (+ 52 c_main_~x~0) 4294967296))) (or (not (< .cse34 268435455)) (< .cse34 65521))) (let ((.cse35 (mod (+ 56 c_main_~x~0) 4294967296))) (or (< .cse35 65521) (not (< .cse35 268435455)))) (let ((.cse36 (mod (+ 73 c_main_~x~0) 4294967296))) (or (not (< .cse36 268435455)) (< .cse36 65521))) (let ((.cse37 (mod (+ c_main_~x~0 54) 4294967296))) (or (not (< .cse37 268435455)) (< .cse37 65521))) (let ((.cse38 (mod (+ 65 c_main_~x~0) 4294967296))) (or (< .cse38 65521) (not (< .cse38 268435455)))) (let ((.cse39 (mod (+ 57 c_main_~x~0) 4294967296))) (or (not (< .cse39 268435455)) (< .cse39 65521))) (let ((.cse40 (mod (+ 14 c_main_~x~0) 4294967296))) (or (< .cse40 65521) (not (< .cse40 268435455)))) (let ((.cse41 (mod (+ c_main_~x~0 75) 4294967296))) (or (< .cse41 65521) (not (< .cse41 268435455)))) (let ((.cse42 (mod (+ 10 c_main_~x~0) 4294967296))) (or (not (< .cse42 268435455)) (< .cse42 65521))) (let ((.cse43 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse43 65521) (not (< .cse43 268435455)))) (let ((.cse44 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (< .cse44 268435455)) (< .cse44 65521))) (let ((.cse45 (mod (+ 67 c_main_~x~0) 4294967296))) (or (< .cse45 65521) (not (< .cse45 268435455)))) (let ((.cse46 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse46 65521) (not (< .cse46 268435455)))) (let ((.cse47 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse47 65521) (not (< .cse47 268435455)))) (let ((.cse48 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse48 65521) (not (< .cse48 268435455)))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (let ((.cse49 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse49 268435455)) (< .cse49 65521))) (let ((.cse50 (mod (+ 53 c_main_~x~0) 4294967296))) (or (< .cse50 65521) (not (< .cse50 268435455)))) (let ((.cse51 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse51 268435455)) (< .cse51 65521))) (let ((.cse52 (mod (+ 8 c_main_~x~0) 4294967296))) (or (not (< .cse52 268435455)) (< .cse52 65521))) (let ((.cse53 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse53 268435455)) (< .cse53 65521))) (let ((.cse54 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse54 65521) (not (< .cse54 268435455))))) is different from false [2022-03-18 11:56:59,492 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse0 268435455)) (< .cse0 65521))) (let ((.cse1 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse1 65521) (not (< .cse1 268435455)))) (let ((.cse2 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse2 65521) (not (< .cse2 268435455)))) (let ((.cse3 (mod (+ 2 c_main_~x~0) 4294967296))) (or (not (< .cse3 268435455)) (< .cse3 65521))) (let ((.cse4 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse4 268435455)) (< .cse4 65521))) (let ((.cse5 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (< .cse5 268435455)) (< .cse5 65521))) (let ((.cse6 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse6 268435455)) (< .cse6 65521))) (let ((.cse7 (mod (+ 32 c_main_~x~0) 4294967296))) (or (< .cse7 65521) (not (< .cse7 268435455)))) (let ((.cse8 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse8 65521) (not (< .cse8 268435455)))) (< (mod c_main_~x~0 4294967296) 65521) (let ((.cse9 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (< .cse9 268435455)) (< .cse9 65521))) (let ((.cse10 (mod (+ 41 c_main_~x~0) 4294967296))) (or (< .cse10 65521) (not (< .cse10 268435455)))) (let ((.cse11 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse11 65521) (not (< .cse11 268435455)))) (let ((.cse12 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (< .cse12 268435455)) (< .cse12 65521))) (let ((.cse13 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< .cse13 65521) (not (< .cse13 268435455)))) (let ((.cse14 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (< .cse14 268435455)) (< .cse14 65521))) (let ((.cse15 (mod (+ 26 c_main_~x~0) 4294967296))) (or (< .cse15 65521) (not (< .cse15 268435455)))) (let ((.cse16 (mod (+ 51 c_main_~x~0) 4294967296))) (or (< .cse16 65521) (not (< .cse16 268435455)))) (let ((.cse17 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse17 65521) (not (< .cse17 268435455)))) (let ((.cse18 (mod (+ 18 c_main_~x~0) 4294967296))) (or (< .cse18 65521) (not (< .cse18 268435455)))) (let ((.cse19 (mod (+ 70 c_main_~x~0) 4294967296))) (or (not (< .cse19 268435455)) (< .cse19 65521))) (let ((.cse20 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse20 65521) (not (< .cse20 268435455)))) (let ((.cse21 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse21 65521) (not (< .cse21 268435455)))) (let ((.cse22 (mod (+ 64 c_main_~x~0) 4294967296))) (or (not (< .cse22 268435455)) (< .cse22 65521))) (let ((.cse23 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse23 268435455)) (< .cse23 65521))) (let ((.cse24 (mod (+ 43 c_main_~x~0) 4294967296))) (or (< .cse24 65521) (not (< .cse24 268435455)))) (let ((.cse25 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse25 65521) (not (< .cse25 268435455)))) (let ((.cse26 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse26 65521) (not (< .cse26 268435455)))) (let ((.cse27 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse27 268435455)) (< .cse27 65521))) (let ((.cse28 (mod (+ 22 c_main_~x~0) 4294967296))) (or (< .cse28 65521) (not (< .cse28 268435455)))) (let ((.cse29 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (< .cse29 268435455)) (< .cse29 65521))) (let ((.cse30 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse30 65521) (not (< .cse30 268435455)))) (let ((.cse31 (mod (+ 48 c_main_~x~0) 4294967296))) (or (not (< .cse31 268435455)) (< .cse31 65521))) (let ((.cse32 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (< .cse32 268435455)) (< .cse32 65521))) (let ((.cse33 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse33 268435455)) (< .cse33 65521))) (let ((.cse34 (mod (+ 52 c_main_~x~0) 4294967296))) (or (not (< .cse34 268435455)) (< .cse34 65521))) (let ((.cse35 (mod (+ 56 c_main_~x~0) 4294967296))) (or (< .cse35 65521) (not (< .cse35 268435455)))) (let ((.cse36 (mod (+ 73 c_main_~x~0) 4294967296))) (or (not (< .cse36 268435455)) (< .cse36 65521))) (let ((.cse37 (mod (+ c_main_~x~0 54) 4294967296))) (or (not (< .cse37 268435455)) (< .cse37 65521))) (let ((.cse38 (mod (+ 65 c_main_~x~0) 4294967296))) (or (< .cse38 65521) (not (< .cse38 268435455)))) (let ((.cse39 (mod (+ 57 c_main_~x~0) 4294967296))) (or (not (< .cse39 268435455)) (< .cse39 65521))) (let ((.cse40 (mod (+ 14 c_main_~x~0) 4294967296))) (or (< .cse40 65521) (not (< .cse40 268435455)))) (let ((.cse41 (mod (+ c_main_~x~0 75) 4294967296))) (or (< .cse41 65521) (not (< .cse41 268435455)))) (let ((.cse42 (mod (+ 10 c_main_~x~0) 4294967296))) (or (not (< .cse42 268435455)) (< .cse42 65521))) (let ((.cse43 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse43 65521) (not (< .cse43 268435455)))) (let ((.cse44 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (< .cse44 268435455)) (< .cse44 65521))) (let ((.cse45 (mod (+ 67 c_main_~x~0) 4294967296))) (or (< .cse45 65521) (not (< .cse45 268435455)))) (let ((.cse46 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse46 65521) (not (< .cse46 268435455)))) (let ((.cse47 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse47 65521) (not (< .cse47 268435455)))) (let ((.cse48 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse48 65521) (not (< .cse48 268435455)))) (let ((.cse49 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse49 268435455)) (< .cse49 65521))) (let ((.cse50 (mod (+ 53 c_main_~x~0) 4294967296))) (or (< .cse50 65521) (not (< .cse50 268435455)))) (let ((.cse51 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse51 268435455)) (< .cse51 65521))) (let ((.cse52 (mod (+ 8 c_main_~x~0) 4294967296))) (or (not (< .cse52 268435455)) (< .cse52 65521))) (let ((.cse53 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse53 268435455)) (< .cse53 65521))) (let ((.cse54 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse54 65521) (not (< .cse54 268435455))))) is different from false [2022-03-18 11:58:53,664 WARN L232 SmtUtils]: Spent 31.54s on a formula simplification. DAG size of input: 250 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 12:01:12,563 WARN L232 SmtUtils]: Spent 50.11s on a formula simplification. DAG size of input: 256 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 12:03:14,059 WARN L232 SmtUtils]: Spent 49.69s on a formula simplification. DAG size of input: 384 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 12:05:26,833 WARN L232 SmtUtils]: Spent 43.91s on a formula simplification. DAG size of input: 270 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 12:08:04,689 WARN L232 SmtUtils]: Spent 1.40m on a formula simplification. DAG size of input: 377 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 12:08:06,757 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse0 268435455)) (< .cse0 65521))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse1 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse1 65521) (not (< .cse1 268435455)))) (let ((.cse2 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse2 65521) (not (< .cse2 268435455)))) (let ((.cse3 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse3 268435455)) (< .cse3 65521))) (let ((.cse4 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (< .cse4 268435455)) (< .cse4 65521))) (let ((.cse5 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse5 268435455)) (< .cse5 65521))) (let ((.cse6 (mod (+ 41 c_main_~x~0) 4294967296))) (or (< .cse6 65521) (not (< .cse6 268435455)))) (let ((.cse7 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse7 65521) (not (< .cse7 268435455)))) (let ((.cse8 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< .cse8 65521) (not (< .cse8 268435455)))) (let ((.cse9 (mod (+ 51 c_main_~x~0) 4294967296))) (or (< .cse9 65521) (not (< .cse9 268435455)))) (let ((.cse10 (mod (+ 70 c_main_~x~0) 4294967296))) (or (not (< .cse10 268435455)) (< .cse10 65521))) (let ((.cse11 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse11 65521) (not (< .cse11 268435455)))) (let ((.cse12 (mod (+ 64 c_main_~x~0) 4294967296))) (or (not (< .cse12 268435455)) (< .cse12 65521))) (let ((.cse13 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse13 268435455)) (< .cse13 65521))) (let ((.cse14 (mod (+ 43 c_main_~x~0) 4294967296))) (or (< .cse14 65521) (not (< .cse14 268435455)))) (let ((.cse15 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse15 65521) (not (< .cse15 268435455)))) (let ((.cse16 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse16 65521) (not (< .cse16 268435455)))) (let ((.cse17 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (< .cse17 268435455)) (< .cse17 65521))) (let ((.cse18 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse18 65521) (not (< .cse18 268435455)))) (let ((.cse19 (mod (+ 48 c_main_~x~0) 4294967296))) (or (not (< .cse19 268435455)) (< .cse19 65521))) (let ((.cse20 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (< .cse20 268435455)) (< .cse20 65521))) (let ((.cse21 (mod (+ 52 c_main_~x~0) 4294967296))) (or (not (< .cse21 268435455)) (< .cse21 65521))) (let ((.cse22 (mod (+ 56 c_main_~x~0) 4294967296))) (or (< .cse22 65521) (not (< .cse22 268435455)))) (let ((.cse23 (mod (+ 73 c_main_~x~0) 4294967296))) (or (not (< .cse23 268435455)) (< .cse23 65521))) (let ((.cse24 (mod (+ c_main_~x~0 54) 4294967296))) (or (not (< .cse24 268435455)) (< .cse24 65521))) (let ((.cse25 (mod (+ 65 c_main_~x~0) 4294967296))) (or (< .cse25 65521) (not (< .cse25 268435455)))) (let ((.cse26 (mod (+ 57 c_main_~x~0) 4294967296))) (or (not (< .cse26 268435455)) (< .cse26 65521))) (let ((.cse27 (mod (+ c_main_~x~0 75) 4294967296))) (or (< .cse27 65521) (not (< .cse27 268435455)))) (let ((.cse28 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (< .cse28 268435455)) (< .cse28 65521))) (let ((.cse29 (mod (+ 67 c_main_~x~0) 4294967296))) (or (< .cse29 65521) (not (< .cse29 268435455)))) (let ((.cse30 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse30 65521) (not (< .cse30 268435455)))) (let ((.cse31 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse31 65521) (not (< .cse31 268435455)))) (let ((.cse32 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse32 65521) (not (< .cse32 268435455)))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (let ((.cse33 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse33 268435455)) (< .cse33 65521))) (let ((.cse34 (mod (+ 53 c_main_~x~0) 4294967296))) (or (< .cse34 65521) (not (< .cse34 268435455)))) (let ((.cse35 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse35 268435455)) (< .cse35 65521))) (let ((.cse36 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse36 268435455)) (< .cse36 65521))) (let ((.cse37 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse37 65521) (not (< .cse37 268435455))))) is different from false