./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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_50-1loop_file-9.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 ebb38d1aa1a2498e8dd2ecd9a3521f2ac13c8472d6bd13f73b3a1fb427f0239d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 23:11:44,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 23:11:44,950 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 23:11:44,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 23:11:44,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 23:11:44,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 23:11:44,987 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 23:11:44,987 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 23:11:44,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 23:11:44,990 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 23:11:44,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 23:11:44,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 23:11:44,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 23:11:44,992 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 23:11:44,992 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 23:11:44,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 23:11:44,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 23:11:44,992 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 23:11:44,993 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 23:11:44,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 23:11:44,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 23:11:44,995 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 23:11:44,995 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 23:11:44,995 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 23:11:44,995 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 23:11:44,996 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 23:11:44,996 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 23:11:44,996 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 23:11:44,997 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 23:11:44,997 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 23:11:44,997 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 23:11:44,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 23:11:44,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:11:44,998 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 23:11:44,998 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 23:11:44,998 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 23:11:44,999 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 23:11:44,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 23:11:44,999 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 23:11:44,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 23:11:44,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 23:11:45,000 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 23:11:45,000 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 -> ebb38d1aa1a2498e8dd2ecd9a3521f2ac13c8472d6bd13f73b3a1fb427f0239d [2024-11-18 23:11:45,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 23:11:45,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 23:11:45,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 23:11:45,298 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 23:11:45,298 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 23:11:45,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i [2024-11-18 23:11:46,734 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 23:11:46,968 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 23:11:46,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i [2024-11-18 23:11:46,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c8ffec7f/8d1a736f1cbc440bb3826bececf92919/FLAG38b4f2d1d [2024-11-18 23:11:46,991 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c8ffec7f/8d1a736f1cbc440bb3826bececf92919 [2024-11-18 23:11:46,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 23:11:46,994 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 23:11:46,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 23:11:46,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 23:11:47,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 23:11:47,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:11:46" (1/1) ... [2024-11-18 23:11:47,002 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@701180cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:47, skipping insertion in model container [2024-11-18 23:11:47,002 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:11:46" (1/1) ... [2024-11-18 23:11:47,037 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 23:11:47,230 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_50-1loop_file-9.i[914,927] [2024-11-18 23:11:47,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:11:47,309 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 23:11:47,322 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_50-1loop_file-9.i[914,927] [2024-11-18 23:11:47,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:11:47,370 INFO L204 MainTranslator]: Completed translation [2024-11-18 23:11:47,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:47 WrapperNode [2024-11-18 23:11:47,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 23:11:47,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 23:11:47,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 23:11:47,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 23:11:47,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:47" (1/1) ... [2024-11-18 23:11:47,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:47" (1/1) ... [2024-11-18 23:11:47,432 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 181 [2024-11-18 23:11:47,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 23:11:47,433 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 23:11:47,433 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 23:11:47,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 23:11:47,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:47" (1/1) ... [2024-11-18 23:11:47,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:47" (1/1) ... [2024-11-18 23:11:47,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:47" (1/1) ... [2024-11-18 23:11:47,471 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-18 23:11:47,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:47" (1/1) ... [2024-11-18 23:11:47,472 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:47" (1/1) ... [2024-11-18 23:11:47,482 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:47" (1/1) ... [2024-11-18 23:11:47,486 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:47" (1/1) ... [2024-11-18 23:11:47,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:47" (1/1) ... [2024-11-18 23:11:47,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:47" (1/1) ... [2024-11-18 23:11:47,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 23:11:47,502 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 23:11:47,502 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 23:11:47,502 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 23:11:47,503 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:47" (1/1) ... [2024-11-18 23:11:47,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:11:47,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:11:47,541 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-18 23:11:47,545 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-18 23:11:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 23:11:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 23:11:47,595 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 23:11:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 23:11:47,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 23:11:47,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 23:11:47,696 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 23:11:47,702 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 23:11:48,047 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-18 23:11:48,047 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 23:11:48,063 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 23:11:48,064 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 23:11:48,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:11:48 BoogieIcfgContainer [2024-11-18 23:11:48,064 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 23:11:48,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 23:11:48,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 23:11:48,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 23:11:48,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:11:46" (1/3) ... [2024-11-18 23:11:48,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47be15ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:11:48, skipping insertion in model container [2024-11-18 23:11:48,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:47" (2/3) ... [2024-11-18 23:11:48,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47be15ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:11:48, skipping insertion in model container [2024-11-18 23:11:48,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:11:48" (3/3) ... [2024-11-18 23:11:48,075 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-9.i [2024-11-18 23:11:48,094 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 23:11:48,094 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 23:11:48,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 23:11:48,176 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;@28e724c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 23:11:48,176 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 23:11:48,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 58 states have internal predecessors, (80), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-18 23:11:48,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-18 23:11:48,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:11:48,196 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:11:48,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:11:48,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:11:48,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1790269358, now seen corresponding path program 1 times [2024-11-18 23:11:48,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:11:48,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680821199] [2024-11-18 23:11:48,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:11:48,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:11:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:11:48,572 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-18 23:11:48,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:11:48,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680821199] [2024-11-18 23:11:48,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680821199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:11:48,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985477227] [2024-11-18 23:11:48,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:11:48,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:11:48,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:11:48,576 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-18 23:11:48,577 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-18 23:11:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:11:48,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 23:11:48,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:11:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-18 23:11:48,794 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:11:48,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985477227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:11:48,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 23:11:48,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 23:11:48,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376618544] [2024-11-18 23:11:48,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:11:48,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 23:11:48,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:11:48,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 23:11:48,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:11:48,830 INFO L87 Difference]: Start difference. First operand has 75 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 58 states have internal predecessors, (80), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-18 23:11:48,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:11:48,865 INFO L93 Difference]: Finished difference Result 147 states and 232 transitions. [2024-11-18 23:11:48,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 23:11:48,868 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 108 [2024-11-18 23:11:48,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:11:48,875 INFO L225 Difference]: With dead ends: 147 [2024-11-18 23:11:48,875 INFO L226 Difference]: Without dead ends: 71 [2024-11-18 23:11:48,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 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-18 23:11:48,882 INFO L432 NwaCegarLoop]: 107 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, 107 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-18 23:11:48,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:11:48,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-18 23:11:48,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-18 23:11:48,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-18 23:11:48,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 103 transitions. [2024-11-18 23:11:48,919 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 103 transitions. Word has length 108 [2024-11-18 23:11:48,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:11:48,919 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 103 transitions. [2024-11-18 23:11:48,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-18 23:11:48,920 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 103 transitions. [2024-11-18 23:11:48,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-18 23:11:48,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:11:48,923 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:11:48,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-18 23:11:49,123 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-18 23:11:49,124 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:11:49,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:11:49,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1370819596, now seen corresponding path program 1 times [2024-11-18 23:11:49,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:11:49,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372517838] [2024-11-18 23:11:49,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:11:49,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:11:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:11:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-18 23:11:49,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:11:49,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372517838] [2024-11-18 23:11:49,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372517838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:11:49,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:11:49,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 23:11:49,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109713591] [2024-11-18 23:11:49,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:11:49,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 23:11:49,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:11:49,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 23:11:49,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 23:11:49,369 INFO L87 Difference]: Start difference. First operand 71 states and 103 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 23:11:49,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:11:49,399 INFO L93 Difference]: Finished difference Result 140 states and 205 transitions. [2024-11-18 23:11:49,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 23:11:49,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2024-11-18 23:11:49,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:11:49,403 INFO L225 Difference]: With dead ends: 140 [2024-11-18 23:11:49,405 INFO L226 Difference]: Without dead ends: 72 [2024-11-18 23:11:49,405 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-18 23:11:49,407 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 23:11:49,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:11:49,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-18 23:11:49,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-18 23:11:49,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-18 23:11:49,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 104 transitions. [2024-11-18 23:11:49,422 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 104 transitions. Word has length 108 [2024-11-18 23:11:49,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:11:49,424 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 104 transitions. [2024-11-18 23:11:49,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 23:11:49,425 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 104 transitions. [2024-11-18 23:11:49,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-18 23:11:49,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:11:49,427 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:11:49,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 23:11:49,427 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:11:49,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:11:49,428 INFO L85 PathProgramCache]: Analyzing trace with hash -391400944, now seen corresponding path program 1 times [2024-11-18 23:11:49,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:11:49,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078287191] [2024-11-18 23:11:49,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:11:49,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:11:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:11:53,456 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-18 23:11:53,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:11:53,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078287191] [2024-11-18 23:11:53,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078287191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:11:53,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409974121] [2024-11-18 23:11:53,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:11:53,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:11:53,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:11:53,461 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-18 23:11:53,463 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-18 23:11:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:11:53,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 23:11:53,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:11:53,971 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 174 proven. 42 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-18 23:11:53,971 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 23:11:54,235 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-18 23:11:54,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409974121] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 23:11:54,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 23:11:54,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 19 [2024-11-18 23:11:54,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695576133] [2024-11-18 23:11:54,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 23:11:54,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-18 23:11:54,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:11:54,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-18 23:11:54,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-11-18 23:11:54,244 INFO L87 Difference]: Start difference. First operand 72 states and 104 transitions. Second operand has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 19 states have internal predecessors, (89), 7 states have call successors, (44), 3 states have call predecessors, (44), 5 states have return successors, (45), 6 states have call predecessors, (45), 7 states have call successors, (45) [2024-11-18 23:11:56,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:11:56,288 INFO L93 Difference]: Finished difference Result 225 states and 321 transitions. [2024-11-18 23:11:56,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-18 23:11:56,290 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 19 states have internal predecessors, (89), 7 states have call successors, (44), 3 states have call predecessors, (44), 5 states have return successors, (45), 6 states have call predecessors, (45), 7 states have call successors, (45) Word has length 109 [2024-11-18 23:11:56,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:11:56,292 INFO L225 Difference]: With dead ends: 225 [2024-11-18 23:11:56,292 INFO L226 Difference]: Without dead ends: 156 [2024-11-18 23:11:56,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=156, Invalid=546, Unknown=0, NotChecked=0, Total=702 [2024-11-18 23:11:56,294 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 776 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-18 23:11:56,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 339 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-18 23:11:56,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-18 23:11:56,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 76. [2024-11-18 23:11:56,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 58 states have internal predecessors, (76), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-18 23:11:56,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 106 transitions. [2024-11-18 23:11:56,307 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 106 transitions. Word has length 109 [2024-11-18 23:11:56,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:11:56,307 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 106 transitions. [2024-11-18 23:11:56,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 19 states have internal predecessors, (89), 7 states have call successors, (44), 3 states have call predecessors, (44), 5 states have return successors, (45), 6 states have call predecessors, (45), 7 states have call successors, (45) [2024-11-18 23:11:56,308 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 106 transitions. [2024-11-18 23:11:56,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-18 23:11:56,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:11:56,310 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:11:56,326 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-18 23:11:56,513 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-18 23:11:56,514 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:11:56,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:11:56,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1412469298, now seen corresponding path program 1 times [2024-11-18 23:11:56,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:11:56,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647665510] [2024-11-18 23:11:56,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:11:56,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:11:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:11:58,192 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-18 23:11:58,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:11:58,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647665510] [2024-11-18 23:11:58,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647665510] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:11:58,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198584958] [2024-11-18 23:11:58,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:11:58,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:11:58,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:11:58,197 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-18 23:11:58,198 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-18 23:11:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:11:58,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-18 23:11:58,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:11:58,895 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 134 proven. 6 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-18 23:11:58,896 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 23:12:00,206 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-18 23:12:00,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198584958] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 23:12:00,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 23:12:00,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 11] total 22 [2024-11-18 23:12:00,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041333641] [2024-11-18 23:12:00,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:12:00,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 23:12:00,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:12:00,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 23:12:00,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2024-11-18 23:12:00,209 INFO L87 Difference]: Start difference. First operand 76 states and 106 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 23:12:02,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:12:02,054 INFO L93 Difference]: Finished difference Result 327 states and 456 transitions. [2024-11-18 23:12:02,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 23:12:02,055 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-18 23:12:02,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:12:02,057 INFO L225 Difference]: With dead ends: 327 [2024-11-18 23:12:02,058 INFO L226 Difference]: Without dead ends: 254 [2024-11-18 23:12:02,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2024-11-18 23:12:02,060 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 377 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-18 23:12:02,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 458 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-18 23:12:02,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-18 23:12:02,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 175. [2024-11-18 23:12:02,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 150 states have (on average 1.3933333333333333) internal successors, (209), 151 states have internal predecessors, (209), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-18 23:12:02,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 249 transitions. [2024-11-18 23:12:02,089 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 249 transitions. Word has length 109 [2024-11-18 23:12:02,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:12:02,090 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 249 transitions. [2024-11-18 23:12:02,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 23:12:02,090 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 249 transitions. [2024-11-18 23:12:02,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-18 23:12:02,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:12:02,092 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:12:02,110 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-18 23:12:02,293 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-18 23:12:02,294 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:12:02,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:12:02,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1761520731, now seen corresponding path program 1 times [2024-11-18 23:12:02,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:12:02,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271377560] [2024-11-18 23:12:02,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:12:02,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:12:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:12:03,945 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-18 23:12:03,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:12:03,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271377560] [2024-11-18 23:12:03,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271377560] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:12:03,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656966754] [2024-11-18 23:12:03,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:12:03,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:12:03,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:12:03,948 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-18 23:12:03,949 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-18 23:12:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:12:04,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-18 23:12:04,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:12:04,392 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-18 23:12:04,392 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:12:04,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656966754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:12:04,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 23:12:04,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2024-11-18 23:12:04,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726052675] [2024-11-18 23:12:04,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:12:04,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 23:12:04,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:12:04,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 23:12:04,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-18 23:12:04,394 INFO L87 Difference]: Start difference. First operand 175 states and 249 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 23:12:04,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:12:04,766 INFO L93 Difference]: Finished difference Result 425 states and 594 transitions. [2024-11-18 23:12:04,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 23:12:04,767 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-18 23:12:04,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:12:04,771 INFO L225 Difference]: With dead ends: 425 [2024-11-18 23:12:04,772 INFO L226 Difference]: Without dead ends: 253 [2024-11-18 23:12:04,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-11-18 23:12:04,776 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 154 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 23:12:04,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 574 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 23:12:04,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-18 23:12:04,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 203. [2024-11-18 23:12:04,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 178 states have (on average 1.404494382022472) internal successors, (250), 179 states have internal predecessors, (250), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-18 23:12:04,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 290 transitions. [2024-11-18 23:12:04,809 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 290 transitions. Word has length 109 [2024-11-18 23:12:04,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:12:04,812 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 290 transitions. [2024-11-18 23:12:04,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 23:12:04,813 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 290 transitions. [2024-11-18 23:12:04,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-18 23:12:04,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:12:04,815 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:12:04,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-18 23:12:05,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:12:05,016 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:12:05,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:12:05,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1193554256, now seen corresponding path program 1 times [2024-11-18 23:12:05,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:12:05,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976292744] [2024-11-18 23:12:05,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:12:05,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:12:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:12:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-18 23:12:06,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:12:06,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976292744] [2024-11-18 23:12:06,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976292744] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:12:06,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381372872] [2024-11-18 23:12:06,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:12:06,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:12:06,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:12:06,986 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) [2024-11-18 23:12:06,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 23:12:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:12:07,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-18 23:12:07,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:12:07,778 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 228 proven. 63 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2024-11-18 23:12:07,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 23:12:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2024-11-18 23:12:08,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381372872] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 23:12:08,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 23:12:08,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 12] total 32 [2024-11-18 23:12:08,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363590218] [2024-11-18 23:12:08,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 23:12:08,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-18 23:12:08,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:12:08,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-18 23:12:08,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2024-11-18 23:12:08,394 INFO L87 Difference]: Start difference. First operand 203 states and 290 transitions. Second operand has 32 states, 31 states have (on average 3.4516129032258065) internal successors, (107), 30 states have internal predecessors, (107), 9 states have call successors, (45), 5 states have call predecessors, (45), 9 states have return successors, (45), 9 states have call predecessors, (45), 9 states have call successors, (45) [2024-11-18 23:12:11,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:12:11,545 INFO L93 Difference]: Finished difference Result 669 states and 925 transitions. [2024-11-18 23:12:11,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-18 23:12:11,546 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.4516129032258065) internal successors, (107), 30 states have internal predecessors, (107), 9 states have call successors, (45), 5 states have call predecessors, (45), 9 states have return successors, (45), 9 states have call predecessors, (45), 9 states have call successors, (45) Word has length 109 [2024-11-18 23:12:11,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:12:11,549 INFO L225 Difference]: With dead ends: 669 [2024-11-18 23:12:11,549 INFO L226 Difference]: Without dead ends: 469 [2024-11-18 23:12:11,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1366 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=825, Invalid=3867, Unknown=0, NotChecked=0, Total=4692 [2024-11-18 23:12:11,552 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 983 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-18 23:12:11,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 1261 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-18 23:12:11,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-11-18 23:12:11,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 315. [2024-11-18 23:12:11,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 263 states have (on average 1.3536121673003803) internal successors, (356), 265 states have internal predecessors, (356), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-18 23:12:11,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 436 transitions. [2024-11-18 23:12:11,584 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 436 transitions. Word has length 109 [2024-11-18 23:12:11,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:12:11,584 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 436 transitions. [2024-11-18 23:12:11,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.4516129032258065) internal successors, (107), 30 states have internal predecessors, (107), 9 states have call successors, (45), 5 states have call predecessors, (45), 9 states have return successors, (45), 9 states have call predecessors, (45), 9 states have call successors, (45) [2024-11-18 23:12:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 436 transitions. [2024-11-18 23:12:11,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-18 23:12:11,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:12:11,586 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:12:11,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-18 23:12:11,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:12:11,791 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:12:11,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:12:11,791 INFO L85 PathProgramCache]: Analyzing trace with hash -989767472, now seen corresponding path program 1 times [2024-11-18 23:12:11,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:12:11,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034499078] [2024-11-18 23:12:11,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:12:11,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:12:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:12:12,781 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-18 23:12:12,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:12:12,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034499078] [2024-11-18 23:12:12,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034499078] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:12:12,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529656793] [2024-11-18 23:12:12,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:12:12,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:12:12,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:12:12,783 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) [2024-11-18 23:12:12,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-18 23:12:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:12:12,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-18 23:12:12,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:12:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 134 proven. 6 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-18 23:12:13,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 23:12:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-18 23:12:14,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529656793] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 23:12:14,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 23:12:14,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 11] total 22 [2024-11-18 23:12:14,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110567541] [2024-11-18 23:12:14,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:12:14,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 23:12:14,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:12:14,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 23:12:14,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2024-11-18 23:12:14,982 INFO L87 Difference]: Start difference. First operand 315 states and 436 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 23:12:15,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:12:15,745 INFO L93 Difference]: Finished difference Result 746 states and 1027 transitions. [2024-11-18 23:12:15,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 23:12:15,746 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-18 23:12:15,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:12:15,749 INFO L225 Difference]: With dead ends: 746 [2024-11-18 23:12:15,750 INFO L226 Difference]: Without dead ends: 434 [2024-11-18 23:12:15,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2024-11-18 23:12:15,751 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 256 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 23:12:15,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 686 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 23:12:15,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-18 23:12:15,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 339. [2024-11-18 23:12:15,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 287 states have (on average 1.362369337979094) internal successors, (391), 289 states have internal predecessors, (391), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-18 23:12:15,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 471 transitions. [2024-11-18 23:12:15,778 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 471 transitions. Word has length 109 [2024-11-18 23:12:15,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:12:15,778 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 471 transitions. [2024-11-18 23:12:15,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 23:12:15,779 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 471 transitions. [2024-11-18 23:12:15,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-18 23:12:15,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:12:15,780 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:12:15,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-18 23:12:15,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:12:15,981 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:12:15,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:12:15,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1338818905, now seen corresponding path program 1 times [2024-11-18 23:12:15,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:12:15,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030590930] [2024-11-18 23:12:15,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:12:15,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:12:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:12:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-18 23:12:16,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:12:16,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030590930] [2024-11-18 23:12:16,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030590930] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:12:16,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396220164] [2024-11-18 23:12:16,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:12:16,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:12:16,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:12:16,694 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) [2024-11-18 23:12:16,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-18 23:12:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:12:16,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-18 23:12:16,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:12:17,393 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 134 proven. 6 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-18 23:12:17,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 23:12:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-18 23:12:18,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396220164] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 23:12:18,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 23:12:18,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 11] total 21 [2024-11-18 23:12:18,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758024679] [2024-11-18 23:12:18,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:12:18,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 23:12:18,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:12:18,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 23:12:18,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2024-11-18 23:12:18,384 INFO L87 Difference]: Start difference. First operand 339 states and 471 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 23:12:19,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:12:19,193 INFO L93 Difference]: Finished difference Result 784 states and 1079 transitions. [2024-11-18 23:12:19,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 23:12:19,194 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-18 23:12:19,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:12:19,197 INFO L225 Difference]: With dead ends: 784 [2024-11-18 23:12:19,197 INFO L226 Difference]: Without dead ends: 448 [2024-11-18 23:12:19,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2024-11-18 23:12:19,199 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 235 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 23:12:19,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 695 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 23:12:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-18 23:12:19,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 363. [2024-11-18 23:12:19,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 311 states have (on average 1.369774919614148) internal successors, (426), 313 states have internal predecessors, (426), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-18 23:12:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 506 transitions. [2024-11-18 23:12:19,235 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 506 transitions. Word has length 109 [2024-11-18 23:12:19,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:12:19,236 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 506 transitions. [2024-11-18 23:12:19,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 23:12:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 506 transitions. [2024-11-18 23:12:19,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-18 23:12:19,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:12:19,238 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:12:19,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-18 23:12:19,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:12:19,439 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:12:19,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:12:19,440 INFO L85 PathProgramCache]: Analyzing trace with hash -721783991, now seen corresponding path program 1 times [2024-11-18 23:12:19,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:12:19,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77518078] [2024-11-18 23:12:19,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:12:19,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:12:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 23:12:19,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2000015412] [2024-11-18 23:12:19,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:12:19,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:12:19,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:12:19,488 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) [2024-11-18 23:12:19,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-18 23:12:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:12:19,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-18 23:12:19,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:12:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 182 proven. 30 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-18 23:12:20,017 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 23:12:20,203 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-18 23:12:20,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:12:20,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77518078] [2024-11-18 23:12:20,205 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-18 23:12:20,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000015412] [2024-11-18 23:12:20,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000015412] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 23:12:20,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 23:12:20,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-18 23:12:20,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555269518] [2024-11-18 23:12:20,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 23:12:20,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-18 23:12:20,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:12:20,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-18 23:12:20,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-18 23:12:20,207 INFO L87 Difference]: Start difference. First operand 363 states and 506 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-18 23:12:20,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:12:20,782 INFO L93 Difference]: Finished difference Result 972 states and 1304 transitions. [2024-11-18 23:12:20,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-18 23:12:20,783 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 111 [2024-11-18 23:12:20,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:12:20,786 INFO L225 Difference]: With dead ends: 972 [2024-11-18 23:12:20,786 INFO L226 Difference]: Without dead ends: 612 [2024-11-18 23:12:20,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-11-18 23:12:20,788 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 235 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 23:12:20,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 667 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 23:12:20,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-18 23:12:20,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 389. [2024-11-18 23:12:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 341 states have (on average 1.348973607038123) internal successors, (460), 343 states have internal predecessors, (460), 34 states have call successors, (34), 13 states have call predecessors, (34), 13 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-18 23:12:20,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 528 transitions. [2024-11-18 23:12:20,820 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 528 transitions. Word has length 111 [2024-11-18 23:12:20,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:12:20,821 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 528 transitions. [2024-11-18 23:12:20,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-18 23:12:20,821 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 528 transitions. [2024-11-18 23:12:20,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-18 23:12:20,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:12:20,823 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:12:20,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-18 23:12:21,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-18 23:12:21,023 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:12:21,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:12:21,024 INFO L85 PathProgramCache]: Analyzing trace with hash -850996736, now seen corresponding path program 1 times [2024-11-18 23:12:21,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:12:21,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17957677] [2024-11-18 23:12:21,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:12:21,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:12:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:12:21,612 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-18 23:12:21,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:12:21,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17957677] [2024-11-18 23:12:21,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17957677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:12:21,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:12:21,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-18 23:12:21,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615619948] [2024-11-18 23:12:21,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:12:21,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 23:12:21,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:12:21,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 23:12:21,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-18 23:12:21,614 INFO L87 Difference]: Start difference. First operand 389 states and 528 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 23:12:22,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:12:22,046 INFO L93 Difference]: Finished difference Result 1304 states and 1705 transitions. [2024-11-18 23:12:22,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 23:12:22,047 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-18 23:12:22,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:12:22,052 INFO L225 Difference]: With dead ends: 1304 [2024-11-18 23:12:22,053 INFO L226 Difference]: Without dead ends: 918 [2024-11-18 23:12:22,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-18 23:12:22,055 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 223 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 23:12:22,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 504 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 23:12:22,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2024-11-18 23:12:22,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 589. [2024-11-18 23:12:22,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 505 states have (on average 1.3188118811881189) internal successors, (666), 510 states have internal predecessors, (666), 58 states have call successors, (58), 25 states have call predecessors, (58), 25 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-18 23:12:22,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 782 transitions. [2024-11-18 23:12:22,112 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 782 transitions. Word has length 111 [2024-11-18 23:12:22,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:12:22,113 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 782 transitions. [2024-11-18 23:12:22,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 23:12:22,113 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 782 transitions. [2024-11-18 23:12:22,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-18 23:12:22,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:12:22,114 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:12:22,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 23:12:22,115 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:12:22,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:12:22,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1336766946, now seen corresponding path program 1 times [2024-11-18 23:12:22,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:12:22,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31448012] [2024-11-18 23:12:22,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:12:22,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:12:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:12:22,167 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-18 23:12:22,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:12:22,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31448012] [2024-11-18 23:12:22,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31448012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:12:22,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:12:22,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 23:12:22,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107911518] [2024-11-18 23:12:22,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:12:22,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 23:12:22,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:12:22,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 23:12:22,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 23:12:22,170 INFO L87 Difference]: Start difference. First operand 589 states and 782 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 23:12:22,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:12:22,271 INFO L93 Difference]: Finished difference Result 1295 states and 1707 transitions. [2024-11-18 23:12:22,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 23:12:22,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-18 23:12:22,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:12:22,277 INFO L225 Difference]: With dead ends: 1295 [2024-11-18 23:12:22,277 INFO L226 Difference]: Without dead ends: 751 [2024-11-18 23:12:22,279 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-18 23:12:22,280 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 83 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 23:12:22,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 208 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:12:22,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2024-11-18 23:12:22,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 724. [2024-11-18 23:12:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 583 states have (on average 1.2641509433962264) internal successors, (737), 591 states have internal predecessors, (737), 99 states have call successors, (99), 41 states have call predecessors, (99), 41 states have return successors, (99), 91 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-18 23:12:22,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 935 transitions. [2024-11-18 23:12:22,389 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 935 transitions. Word has length 111 [2024-11-18 23:12:22,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:12:22,390 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 935 transitions. [2024-11-18 23:12:22,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 23:12:22,390 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 935 transitions. [2024-11-18 23:12:22,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-18 23:12:22,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:12:22,392 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:12:22,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 23:12:22,392 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:12:22,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:12:22,393 INFO L85 PathProgramCache]: Analyzing trace with hash -897246384, now seen corresponding path program 1 times [2024-11-18 23:12:22,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:12:22,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787742602] [2024-11-18 23:12:22,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:12:22,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:12:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:12:24,007 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-18 23:12:24,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:12:24,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787742602] [2024-11-18 23:12:24,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787742602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:12:24,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:12:24,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-18 23:12:24,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505571633] [2024-11-18 23:12:24,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:12:24,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-18 23:12:24,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:12:24,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-18 23:12:24,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-18 23:12:24,010 INFO L87 Difference]: Start difference. First operand 724 states and 935 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 23:12:25,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:12:25,458 INFO L93 Difference]: Finished difference Result 1599 states and 2082 transitions. [2024-11-18 23:12:25,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 23:12:25,459 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-11-18 23:12:25,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:12:25,465 INFO L225 Difference]: With dead ends: 1599 [2024-11-18 23:12:25,465 INFO L226 Difference]: Without dead ends: 920 [2024-11-18 23:12:25,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2024-11-18 23:12:25,468 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 344 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-18 23:12:25,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 683 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-18 23:12:25,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-11-18 23:12:25,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 825. [2024-11-18 23:12:25,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 684 states have (on average 1.2763157894736843) internal successors, (873), 692 states have internal predecessors, (873), 99 states have call successors, (99), 41 states have call predecessors, (99), 41 states have return successors, (99), 91 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-18 23:12:25,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1071 transitions. [2024-11-18 23:12:25,571 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1071 transitions. Word has length 112 [2024-11-18 23:12:25,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:12:25,572 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1071 transitions. [2024-11-18 23:12:25,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 23:12:25,572 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1071 transitions. [2024-11-18 23:12:25,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-18 23:12:25,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:12:25,573 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:12:25,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 23:12:25,574 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:12:25,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:12:25,574 INFO L85 PathProgramCache]: Analyzing trace with hash -595481104, now seen corresponding path program 1 times [2024-11-18 23:12:25,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:12:25,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403874809] [2024-11-18 23:12:25,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:12:25,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:12:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:12:25,874 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-18 23:12:25,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:12:25,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403874809] [2024-11-18 23:12:25,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403874809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:12:25,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:12:25,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 23:12:25,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142794633] [2024-11-18 23:12:25,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:12:25,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 23:12:25,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:12:25,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 23:12:25,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 23:12:25,876 INFO L87 Difference]: Start difference. First operand 825 states and 1071 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 23:12:26,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:12:26,418 INFO L93 Difference]: Finished difference Result 2029 states and 2599 transitions. [2024-11-18 23:12:26,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 23:12:26,418 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-11-18 23:12:26,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:12:26,424 INFO L225 Difference]: With dead ends: 2029 [2024-11-18 23:12:26,424 INFO L226 Difference]: Without dead ends: 1249 [2024-11-18 23:12:26,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-18 23:12:26,427 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 79 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 23:12:26,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 587 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 23:12:26,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2024-11-18 23:12:26,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 867. [2024-11-18 23:12:26,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 726 states have (on average 1.2741046831955922) internal successors, (925), 734 states have internal predecessors, (925), 99 states have call successors, (99), 41 states have call predecessors, (99), 41 states have return successors, (99), 91 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-18 23:12:26,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1123 transitions. [2024-11-18 23:12:26,520 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1123 transitions. Word has length 112 [2024-11-18 23:12:26,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:12:26,520 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1123 transitions. [2024-11-18 23:12:26,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 23:12:26,521 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1123 transitions. [2024-11-18 23:12:26,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-18 23:12:26,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:12:26,522 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:12:26,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-18 23:12:26,522 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:12:26,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:12:26,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2044800520, now seen corresponding path program 1 times [2024-11-18 23:12:26,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:12:26,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522649231] [2024-11-18 23:12:26,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:12:26,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:12:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:12:26,589 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-18 23:12:26,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:12:26,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522649231] [2024-11-18 23:12:26,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522649231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:12:26,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:12:26,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 23:12:26,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087991409] [2024-11-18 23:12:26,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:12:26,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 23:12:26,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:12:26,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 23:12:26,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 23:12:26,592 INFO L87 Difference]: Start difference. First operand 867 states and 1123 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 23:12:26,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:12:26,729 INFO L93 Difference]: Finished difference Result 1887 states and 2459 transitions. [2024-11-18 23:12:26,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 23:12:26,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-11-18 23:12:26,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:12:26,735 INFO L225 Difference]: With dead ends: 1887 [2024-11-18 23:12:26,735 INFO L226 Difference]: Without dead ends: 1065 [2024-11-18 23:12:26,737 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-18 23:12:26,738 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 28 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 23:12:26,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 170 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:12:26,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2024-11-18 23:12:26,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 887. [2024-11-18 23:12:26,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 746 states have (on average 1.274798927613941) internal successors, (951), 754 states have internal predecessors, (951), 99 states have call successors, (99), 41 states have call predecessors, (99), 41 states have return successors, (99), 91 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-18 23:12:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1149 transitions. [2024-11-18 23:12:26,836 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1149 transitions. Word has length 112 [2024-11-18 23:12:26,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:12:26,837 INFO L471 AbstractCegarLoop]: Abstraction has 887 states and 1149 transitions. [2024-11-18 23:12:26,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 23:12:26,837 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1149 transitions. [2024-11-18 23:12:26,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-18 23:12:26,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:12:26,839 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:12:26,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-18 23:12:26,839 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:12:26,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:12:26,840 INFO L85 PathProgramCache]: Analyzing trace with hash 338108489, now seen corresponding path program 1 times [2024-11-18 23:12:26,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:12:26,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643113566] [2024-11-18 23:12:26,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:12:26,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:12:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 23:12:26,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1418445967] [2024-11-18 23:12:26,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:12:26,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:12:26,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:12:26,893 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 23:12:26,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-18 23:12:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 23:12:27,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 23:12:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 23:12:27,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 23:12:27,545 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 23:12:27,549 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 23:12:27,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-18 23:12:27,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-18 23:12:27,754 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:12:27,846 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 23:12:27,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:12:27 BoogieIcfgContainer [2024-11-18 23:12:27,848 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 23:12:27,849 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 23:12:27,849 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 23:12:27,849 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 23:12:27,850 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:11:48" (3/4) ... [2024-11-18 23:12:27,854 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 23:12:27,855 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 23:12:27,856 INFO L158 Benchmark]: Toolchain (without parser) took 40861.68ms. Allocated memory was 155.2MB in the beginning and 325.1MB in the end (delta: 169.9MB). Free memory was 124.8MB in the beginning and 278.1MB in the end (delta: -153.2MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-11-18 23:12:27,856 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:12:27,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.25ms. Allocated memory is still 155.2MB. Free memory was 124.8MB in the beginning and 110.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 23:12:27,857 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.55ms. Allocated memory is still 155.2MB. Free memory was 110.2MB in the beginning and 107.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 23:12:27,857 INFO L158 Benchmark]: Boogie Preprocessor took 68.05ms. Allocated memory is still 155.2MB. Free memory was 107.0MB in the beginning and 103.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 23:12:27,858 INFO L158 Benchmark]: RCFGBuilder took 562.22ms. Allocated memory is still 155.2MB. Free memory was 102.8MB in the beginning and 80.8MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-18 23:12:27,858 INFO L158 Benchmark]: TraceAbstraction took 39781.63ms. Allocated memory was 155.2MB in the beginning and 325.1MB in the end (delta: 169.9MB). Free memory was 80.8MB in the beginning and 279.1MB in the end (delta: -198.3MB). Peak memory consumption was 155.8MB. Max. memory is 16.1GB. [2024-11-18 23:12:27,858 INFO L158 Benchmark]: Witness Printer took 6.54ms. Allocated memory is still 325.1MB. Free memory was 279.1MB in the beginning and 278.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:12:27,859 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.25ms. Allocated memory is still 155.2MB. Free memory was 124.8MB in the beginning and 110.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.55ms. Allocated memory is still 155.2MB. Free memory was 110.2MB in the beginning and 107.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.05ms. Allocated memory is still 155.2MB. Free memory was 107.0MB in the beginning and 103.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 562.22ms. Allocated memory is still 155.2MB. Free memory was 102.8MB in the beginning and 80.8MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 39781.63ms. Allocated memory was 155.2MB in the beginning and 325.1MB in the end (delta: 169.9MB). Free memory was 80.8MB in the beginning and 279.1MB in the end (delta: -198.3MB). Peak memory consumption was 155.8MB. Max. memory is 16.1GB. * Witness Printer took 6.54ms. Allocated memory is still 325.1MB. Free memory was 279.1MB in the beginning and 278.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of shiftLeft at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned char last_1_var_1_10 = 32; [L37] unsigned short int last_1_var_1_12 = 16; [L38] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L123] isInitial = 1 [L124] FCALL initially() [L125] int k_loop; [L126] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L126] COND TRUE k_loop < 1 [L127] CALL updateLastVariables() [L114] last_1_var_1_10 = var_1_10 [L115] last_1_var_1_12 = var_1_12 [L116] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L127] RET updateLastVariables() [L128] CALL updateVariables() [L89] var_1_3 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L92] var_1_5 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L96] var_1_6 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L97] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L99] var_1_7 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L100] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L102] var_1_8 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_9=9/5] [L103] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_9=9/5] [L104] var_1_9 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L105] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L106] var_1_11 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L107] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L108] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L108] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L109] var_1_15 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L110] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L111] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L111] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L128] RET updateVariables() [L129] CALL step() [L42] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L43] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L45] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=1, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L46] COND TRUE var_1_6 <= stepLocal_2 [L47] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L51] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L51] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L58] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L60] var_1_18 = var_1_3 [L61] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L62] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L63] COND FALSE !((- var_1_9) <= var_1_8) [L76] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L78] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L79] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L79] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L80] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L129] RET step() [L130] CALL, EXPR property() [L119] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L119] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L119] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L119-L120] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.6s, OverallIterations: 15, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3784 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3773 mSDsluCounter, 7138 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5568 mSDsCounter, 325 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5325 IncrementalHoareTripleChecker+Invalid, 5650 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 325 mSolverCounterUnsat, 1570 mSDtfsCounter, 5325 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1732 GetRequests, 1488 SyntacticMatches, 3 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2018 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=887occurred in iteration=14, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 1777 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 21.4s InterpolantComputationTime, 2636 NumberOfCodeBlocks, 2636 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2930 ConstructedInterpolants, 15 QuantifiedInterpolants, 13880 SizeOfPredicates, 57 NumberOfNonLiveVariables, 2165 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 27 InterpolantComputations, 11 PerfectInterpolantSequences, 10988/11340 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-18 23:12:27,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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_50-1loop_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 ebb38d1aa1a2498e8dd2ecd9a3521f2ac13c8472d6bd13f73b3a1fb427f0239d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 23:12:30,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 23:12:30,158 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 23:12:30,164 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 23:12:30,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 23:12:30,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 23:12:30,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 23:12:30,202 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 23:12:30,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 23:12:30,203 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 23:12:30,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 23:12:30,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 23:12:30,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 23:12:30,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 23:12:30,206 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 23:12:30,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 23:12:30,207 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 23:12:30,207 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 23:12:30,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 23:12:30,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 23:12:30,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 23:12:30,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 23:12:30,213 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 23:12:30,213 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 23:12:30,213 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 23:12:30,213 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 23:12:30,214 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 23:12:30,214 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 23:12:30,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 23:12:30,214 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 23:12:30,215 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 23:12:30,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 23:12:30,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 23:12:30,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 23:12:30,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:12:30,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 23:12:30,217 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 23:12:30,217 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 23:12:30,218 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 23:12:30,218 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 23:12:30,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 23:12:30,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 23:12:30,220 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 23:12:30,220 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 23:12:30,220 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 -> ebb38d1aa1a2498e8dd2ecd9a3521f2ac13c8472d6bd13f73b3a1fb427f0239d [2024-11-18 23:12:30,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 23:12:30,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 23:12:30,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 23:12:30,603 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 23:12:30,604 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 23:12:30,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i [2024-11-18 23:12:32,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 23:12:32,288 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 23:12:32,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i [2024-11-18 23:12:32,297 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af28bb010/c364f21d799249a4a2165e86d5e4919b/FLAG0f9c3bbc2 [2024-11-18 23:12:32,311 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af28bb010/c364f21d799249a4a2165e86d5e4919b [2024-11-18 23:12:32,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 23:12:32,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 23:12:32,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 23:12:32,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 23:12:32,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 23:12:32,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:12:32" (1/1) ... [2024-11-18 23:12:32,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c01984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:32, skipping insertion in model container [2024-11-18 23:12:32,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:12:32" (1/1) ... [2024-11-18 23:12:32,357 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 23:12:32,533 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_50-1loop_file-9.i[914,927] [2024-11-18 23:12:32,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:12:32,619 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 23:12:32,634 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_50-1loop_file-9.i[914,927] [2024-11-18 23:12:32,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:12:32,702 INFO L204 MainTranslator]: Completed translation [2024-11-18 23:12:32,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:32 WrapperNode [2024-11-18 23:12:32,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 23:12:32,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 23:12:32,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 23:12:32,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 23:12:32,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:32" (1/1) ... [2024-11-18 23:12:32,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:32" (1/1) ... [2024-11-18 23:12:32,763 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-11-18 23:12:32,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 23:12:32,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 23:12:32,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 23:12:32,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 23:12:32,777 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:32" (1/1) ... [2024-11-18 23:12:32,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:32" (1/1) ... [2024-11-18 23:12:32,784 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:32" (1/1) ... [2024-11-18 23:12:32,805 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-18 23:12:32,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:32" (1/1) ... [2024-11-18 23:12:32,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:32" (1/1) ... [2024-11-18 23:12:32,819 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:32" (1/1) ... [2024-11-18 23:12:32,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:32" (1/1) ... [2024-11-18 23:12:32,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:32" (1/1) ... [2024-11-18 23:12:32,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:32" (1/1) ... [2024-11-18 23:12:32,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 23:12:32,831 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 23:12:32,832 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 23:12:32,832 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 23:12:32,833 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:32" (1/1) ... [2024-11-18 23:12:32,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:12:32,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:12:32,868 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-18 23:12:32,871 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-18 23:12:32,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 23:12:32,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 23:12:32,910 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 23:12:32,911 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 23:12:32,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 23:12:32,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 23:12:32,986 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 23:12:32,989 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 23:12:33,393 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-18 23:12:33,393 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 23:12:33,406 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 23:12:33,407 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 23:12:33,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:12:33 BoogieIcfgContainer [2024-11-18 23:12:33,407 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 23:12:33,409 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 23:12:33,409 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 23:12:33,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 23:12:33,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:12:32" (1/3) ... [2024-11-18 23:12:33,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53fdbbfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:12:33, skipping insertion in model container [2024-11-18 23:12:33,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:32" (2/3) ... [2024-11-18 23:12:33,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53fdbbfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:12:33, skipping insertion in model container [2024-11-18 23:12:33,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:12:33" (3/3) ... [2024-11-18 23:12:33,417 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-9.i [2024-11-18 23:12:33,433 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 23:12:33,433 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 23:12:33,507 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 23:12:33,514 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;@7689d6f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 23:12:33,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 23:12:33,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-18 23:12:33,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-18 23:12:33,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:12:33,532 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:12:33,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:12:33,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:12:33,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1048997348, now seen corresponding path program 1 times [2024-11-18 23:12:33,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:12:33,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040671682] [2024-11-18 23:12:33,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:12:33,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 23:12:33,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:12:33,559 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 23:12:33,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-18 23:12:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:12:33,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 23:12:33,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:12:33,831 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-18 23:12:33,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:12:33,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 23:12:33,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040671682] [2024-11-18 23:12:33,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040671682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:12:33,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:12:33,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 23:12:33,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916014918] [2024-11-18 23:12:33,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:12:33,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 23:12:33,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 23:12:33,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 23:12:33,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:12:33,868 INFO L87 Difference]: Start difference. First operand has 56 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-18 23:12:33,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:12:33,899 INFO L93 Difference]: Finished difference Result 109 states and 178 transitions. [2024-11-18 23:12:33,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 23:12:33,901 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2024-11-18 23:12:33,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:12:33,911 INFO L225 Difference]: With dead ends: 109 [2024-11-18 23:12:33,911 INFO L226 Difference]: Without dead ends: 52 [2024-11-18 23:12:33,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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-18 23:12:33,917 INFO L432 NwaCegarLoop]: 79 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, 79 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-18 23:12:33,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:12:33,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-18 23:12:33,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-18 23:12:33,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-18 23:12:33,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2024-11-18 23:12:33,960 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 100 [2024-11-18 23:12:33,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:12:33,961 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2024-11-18 23:12:33,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-18 23:12:33,961 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2024-11-18 23:12:33,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-18 23:12:33,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:12:33,965 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:12:33,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-18 23:12:34,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 23:12:34,166 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:12:34,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:12:34,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1296811503, now seen corresponding path program 1 times [2024-11-18 23:12:34,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:12:34,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1869900502] [2024-11-18 23:12:34,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:12:34,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 23:12:34,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:12:34,170 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 23:12:34,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-18 23:12:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:12:34,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-18 23:12:34,381 INFO L278 TraceCheckSpWp]: Computing forward predicates...