./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-97.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d5e4cb9ac1eb80d849fbfc0dc84b475939efb7668f397b899cd3f0a90b7f4ba1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:36:39,396 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:36:39,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 10:36:39,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:36:39,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:36:39,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:36:39,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:36:39,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:36:39,514 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:36:39,514 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:36:39,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:36:39,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:36:39,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:36:39,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:36:39,519 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:36:39,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:36:39,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:36:39,519 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:36:39,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 10:36:39,520 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:36:39,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:36:39,522 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:36:39,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:36:39,523 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:36:39,523 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:36:39,523 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:36:39,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:36:39,524 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:36:39,524 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:36:39,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:36:39,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:36:39,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:36:39,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:36:39,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:36:39,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:36:39,526 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:36:39,527 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 10:36:39,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 10:36:39,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:36:39,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:36:39,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:36:39,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:36:39,529 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d5e4cb9ac1eb80d849fbfc0dc84b475939efb7668f397b899cd3f0a90b7f4ba1 [2024-11-22 10:36:39,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:36:39,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:36:39,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:36:39,836 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:36:39,836 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:36:39,837 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-97.i [2024-11-22 10:36:41,337 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:36:41,558 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:36:41,559 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-97.i [2024-11-22 10:36:41,575 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90da14705/f25e86d69fec4f1ea79eb4dd6214ee20/FLAGdec9967ac [2024-11-22 10:36:41,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90da14705/f25e86d69fec4f1ea79eb4dd6214ee20 [2024-11-22 10:36:41,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:36:41,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:36:41,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:36:41,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:36:41,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:36:41,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:36:41" (1/1) ... [2024-11-22 10:36:41,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@835feee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:36:41, skipping insertion in model container [2024-11-22 10:36:41,621 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:36:41" (1/1) ... [2024-11-22 10:36:41,663 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:36:41,863 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-97.i[916,929] [2024-11-22 10:36:41,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:36:42,024 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:36:42,038 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-97.i[916,929] [2024-11-22 10:36:42,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:36:42,109 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:36:42,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:36:42 WrapperNode [2024-11-22 10:36:42,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:36:42,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:36:42,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:36:42,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:36:42,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:36:42" (1/1) ... [2024-11-22 10:36:42,133 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:36:42" (1/1) ... [2024-11-22 10:36:42,172 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2024-11-22 10:36:42,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:36:42,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:36:42,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:36:42,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:36:42,188 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:36:42" (1/1) ... [2024-11-22 10:36:42,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:36:42" (1/1) ... [2024-11-22 10:36:42,193 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:36:42" (1/1) ... [2024-11-22 10:36:42,229 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 10:36:42,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:36:42" (1/1) ... [2024-11-22 10:36:42,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:36:42" (1/1) ... [2024-11-22 10:36:42,243 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:36:42" (1/1) ... [2024-11-22 10:36:42,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:36:42" (1/1) ... [2024-11-22 10:36:42,255 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:36:42" (1/1) ... [2024-11-22 10:36:42,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:36:42" (1/1) ... [2024-11-22 10:36:42,275 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:36:42,276 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:36:42,277 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:36:42,280 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:36:42,281 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:36:42" (1/1) ... [2024-11-22 10:36:42,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:36:42,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:36:42,324 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 10:36:42,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 10:36:42,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:36:42,385 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:36:42,387 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:36:42,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 10:36:42,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:36:42,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:36:42,477 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:36:42,481 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:36:42,914 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-22 10:36:42,917 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:36:42,936 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:36:42,937 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:36:42,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:36:42 BoogieIcfgContainer [2024-11-22 10:36:42,938 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:36:42,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:36:42,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:36:42,945 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:36:42,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:36:41" (1/3) ... [2024-11-22 10:36:42,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@781b885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:36:42, skipping insertion in model container [2024-11-22 10:36:42,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:36:42" (2/3) ... [2024-11-22 10:36:42,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@781b885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:36:42, skipping insertion in model container [2024-11-22 10:36:42,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:36:42" (3/3) ... [2024-11-22 10:36:42,950 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-97.i [2024-11-22 10:36:42,972 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:36:42,972 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:36:43,048 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:36:43,055 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7219998c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:36:43,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:36:43,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-22 10:36:43,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-22 10:36:43,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:36:43,077 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:36:43,077 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:36:43,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:36:43,086 INFO L85 PathProgramCache]: Analyzing trace with hash -526305821, now seen corresponding path program 1 times [2024-11-22 10:36:43,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:36:43,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939196032] [2024-11-22 10:36:43,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:36:43,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:36:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:36:43,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2024-11-22 10:36:43,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:36:43,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939196032] [2024-11-22 10:36:43,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939196032] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:36:43,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814286148] [2024-11-22 10:36:43,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:36:43,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:36:43,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:36:43,510 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) [2024-11-22 10:36:43,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 10:36:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:36:43,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:36:43,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:36:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2024-11-22 10:36:43,759 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:36:43,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814286148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:36:43,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:36:43,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 10:36:43,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105813239] [2024-11-22 10:36:43,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:36:43,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:36:43,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:36:43,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:36:43,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:36:43,803 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-22 10:36:43,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:36:43,839 INFO L93 Difference]: Finished difference Result 155 states and 272 transitions. [2024-11-22 10:36:43,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:36:43,841 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 159 [2024-11-22 10:36:43,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:36:43,848 INFO L225 Difference]: With dead ends: 155 [2024-11-22 10:36:43,849 INFO L226 Difference]: Without dead ends: 77 [2024-11-22 10:36:43,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:36:43,855 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:36:43,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:36:43,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-22 10:36:43,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-22 10:36:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-22 10:36:43,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 120 transitions. [2024-11-22 10:36:43,922 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 120 transitions. Word has length 159 [2024-11-22 10:36:43,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:36:43,922 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 120 transitions. [2024-11-22 10:36:43,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-22 10:36:43,923 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 120 transitions. [2024-11-22 10:36:43,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-22 10:36:43,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:36:43,931 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:36:43,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 10:36:44,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 10:36:44,132 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:36:44,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:36:44,133 INFO L85 PathProgramCache]: Analyzing trace with hash -179999509, now seen corresponding path program 1 times [2024-11-22 10:36:44,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:36:44,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81609309] [2024-11-22 10:36:44,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:36:44,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:36:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:36:44,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-22 10:36:44,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:36:44,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81609309] [2024-11-22 10:36:44,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81609309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:36:44,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:36:44,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 10:36:44,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681568863] [2024-11-22 10:36:44,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:36:44,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 10:36:44,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:36:44,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 10:36:44,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:36:44,448 INFO L87 Difference]: Start difference. First operand 77 states and 120 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-22 10:36:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:36:44,549 INFO L93 Difference]: Finished difference Result 216 states and 338 transitions. [2024-11-22 10:36:44,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 10:36:44,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2024-11-22 10:36:44,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:36:44,557 INFO L225 Difference]: With dead ends: 216 [2024-11-22 10:36:44,557 INFO L226 Difference]: Without dead ends: 142 [2024-11-22 10:36:44,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:36:44,559 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 96 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:36:44,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 300 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:36:44,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-22 10:36:44,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 87. [2024-11-22 10:36:44,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 61 states have internal predecessors, (88), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-22 10:36:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 136 transitions. [2024-11-22 10:36:44,590 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 136 transitions. Word has length 159 [2024-11-22 10:36:44,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:36:44,592 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 136 transitions. [2024-11-22 10:36:44,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-22 10:36:44,593 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 136 transitions. [2024-11-22 10:36:44,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-22 10:36:44,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:36:44,597 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:36:44,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 10:36:44,598 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:36:44,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:36:44,598 INFO L85 PathProgramCache]: Analyzing trace with hash 69351161, now seen corresponding path program 1 times [2024-11-22 10:36:44,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:36:44,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213111815] [2024-11-22 10:36:44,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:36:44,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:36:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 10:36:44,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [95385766] [2024-11-22 10:36:44,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:36:44,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:36:44,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:36:44,956 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) [2024-11-22 10:36:44,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 10:36:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:36:45,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-22 10:36:45,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:36:46,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 528 proven. 105 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2024-11-22 10:36:46,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:36:50,817 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_z_6 Int)) (or (< v_z_6 (mod |c_ULTIMATE.start_step_~stepLocal_6~0#1| 256)) (< 65535 v_z_6) (< (mod (div v_z_6 (mod c_~var_1_7~0 4294967296)) 4294967296) v_z_6))) is different from false [2024-11-22 10:36:54,973 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_z_6 Int)) (or (< v_z_6 (mod c_~var_1_14~0 256)) (< 65535 v_z_6) (< (mod (div v_z_6 (mod c_~var_1_7~0 4294967296)) 4294967296) v_z_6))) is different from false [2024-11-22 10:36:55,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:36:55,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213111815] [2024-11-22 10:36:55,256 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 10:36:55,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95385766] [2024-11-22 10:36:55,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95385766] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:36:55,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:36:55,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-11-22 10:36:55,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704633386] [2024-11-22 10:36:55,257 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-22 10:36:55,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 10:36:55,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:36:55,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 10:36:55,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=105, Unknown=2, NotChecked=42, Total=182 [2024-11-22 10:36:55,264 INFO L87 Difference]: Start difference. First operand 87 states and 136 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-22 10:36:57,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:36:57,500 INFO L93 Difference]: Finished difference Result 326 states and 482 transitions. [2024-11-22 10:36:57,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-22 10:36:57,501 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 159 [2024-11-22 10:36:57,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:36:57,504 INFO L225 Difference]: With dead ends: 326 [2024-11-22 10:36:57,504 INFO L226 Difference]: Without dead ends: 242 [2024-11-22 10:36:57,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=292, Invalid=974, Unknown=2, NotChecked=138, Total=1406 [2024-11-22 10:36:57,507 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 290 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-22 10:36:57,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 402 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-22 10:36:57,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-22 10:36:57,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 143. [2024-11-22 10:36:57,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 112 states have (on average 1.4375) internal successors, (161), 113 states have internal predecessors, (161), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 10:36:57,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 213 transitions. [2024-11-22 10:36:57,534 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 213 transitions. Word has length 159 [2024-11-22 10:36:57,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:36:57,535 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 213 transitions. [2024-11-22 10:36:57,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-22 10:36:57,535 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2024-11-22 10:36:57,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 10:36:57,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:36:57,538 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:36:57,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 10:36:57,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-22 10:36:57,743 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:36:57,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:36:57,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1795679469, now seen corresponding path program 1 times [2024-11-22 10:36:57,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:36:57,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740989802] [2024-11-22 10:36:57,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:36:57,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:36:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:36:58,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-22 10:36:58,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:36:58,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740989802] [2024-11-22 10:36:58,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740989802] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:36:58,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378420199] [2024-11-22 10:36:58,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:36:58,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:36:58,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:36:58,504 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) [2024-11-22 10:36:58,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 10:36:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:36:58,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 10:36:58,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:36:58,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 365 proven. 12 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2024-11-22 10:36:58,938 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:36:59,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-22 10:36:59,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378420199] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 10:36:59,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 10:36:59,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 10 [2024-11-22 10:36:59,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751722829] [2024-11-22 10:36:59,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 10:36:59,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 10:36:59,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:36:59,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 10:36:59,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-22 10:36:59,433 INFO L87 Difference]: Start difference. First operand 143 states and 213 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-22 10:37:01,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:37:01,040 INFO L93 Difference]: Finished difference Result 446 states and 637 transitions. [2024-11-22 10:37:01,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-22 10:37:01,041 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 160 [2024-11-22 10:37:01,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:37:01,048 INFO L225 Difference]: With dead ends: 446 [2024-11-22 10:37:01,048 INFO L226 Difference]: Without dead ends: 306 [2024-11-22 10:37:01,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 316 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2024-11-22 10:37:01,051 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 249 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:37:01,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 480 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-22 10:37:01,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-22 10:37:01,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 219. [2024-11-22 10:37:01,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 163 states have (on average 1.343558282208589) internal successors, (219), 166 states have internal predecessors, (219), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-22 10:37:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 311 transitions. [2024-11-22 10:37:01,100 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 311 transitions. Word has length 160 [2024-11-22 10:37:01,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:37:01,101 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 311 transitions. [2024-11-22 10:37:01,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-22 10:37:01,101 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 311 transitions. [2024-11-22 10:37:01,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 10:37:01,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:37:01,106 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:37:01,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-22 10:37:01,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:37:01,308 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:37:01,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:37:01,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1546328799, now seen corresponding path program 1 times [2024-11-22 10:37:01,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:37:01,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836225014] [2024-11-22 10:37:01,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:37:01,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:37:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 10:37:01,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [849486467] [2024-11-22 10:37:01,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:37:01,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:37:01,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:37:01,532 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) [2024-11-22 10:37:01,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 10:37:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:37:02,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-22 10:37:02,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:37:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 528 proven. 105 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2024-11-22 10:37:03,664 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:38:15,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:38:15,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836225014] [2024-11-22 10:38:15,480 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 10:38:15,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849486467] [2024-11-22 10:38:15,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849486467] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:38:15,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:38:15,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-11-22 10:38:15,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734477320] [2024-11-22 10:38:15,481 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-22 10:38:15,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 10:38:15,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:38:15,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 10:38:15,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=181, Unknown=17, NotChecked=0, Total=240 [2024-11-22 10:38:15,483 INFO L87 Difference]: Start difference. First operand 219 states and 311 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24)