./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.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_operatoramount_amount25_file-87.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 e3da299f1752ee08576ff67ebc19be30d3a209c67fcfa6061ee76b74742c8873 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 23:59:01,168 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 23:59:01,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 23:59:01,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 23:59:01,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 23:59:01,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 23:59:01,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 23:59:01,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 23:59:01,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 23:59:01,243 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 23:59:01,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 23:59:01,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 23:59:01,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 23:59:01,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 23:59:01,245 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 23:59:01,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 23:59:01,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 23:59:01,246 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 23:59:01,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 23:59:01,247 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 23:59:01,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 23:59:01,248 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 23:59:01,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 23:59:01,248 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 23:59:01,251 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 23:59:01,251 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 23:59:01,252 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 23:59:01,252 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 23:59:01,252 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 23:59:01,253 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 23:59:01,253 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 23:59:01,254 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 23:59:01,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:59:01,254 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 23:59:01,255 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 23:59:01,255 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 23:59:01,255 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 23:59:01,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 23:59:01,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 23:59:01,256 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 23:59:01,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 23:59:01,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 23:59:01,257 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 -> e3da299f1752ee08576ff67ebc19be30d3a209c67fcfa6061ee76b74742c8873 [2024-11-18 23:59:01,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 23:59:01,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 23:59:01,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 23:59:01,570 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 23:59:01,570 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 23:59:01,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.i [2024-11-18 23:59:03,090 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 23:59:03,294 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 23:59:03,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.i [2024-11-18 23:59:03,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/039a55e55/254b37a345a848a2949f1f3d04a48295/FLAG7f517a285 [2024-11-18 23:59:03,320 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/039a55e55/254b37a345a848a2949f1f3d04a48295 [2024-11-18 23:59:03,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 23:59:03,325 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 23:59:03,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 23:59:03,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 23:59:03,333 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 23:59:03,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,335 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eebd69b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03, skipping insertion in model container [2024-11-18 23:59:03,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,364 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 23:59:03,550 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_operatoramount_amount25_file-87.i[915,928] [2024-11-18 23:59:03,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:59:03,631 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 23:59:03,644 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_operatoramount_amount25_file-87.i[915,928] [2024-11-18 23:59:03,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:59:03,692 INFO L204 MainTranslator]: Completed translation [2024-11-18 23:59:03,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03 WrapperNode [2024-11-18 23:59:03,693 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 23:59:03,695 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 23:59:03,695 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 23:59:03,695 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 23:59:03,702 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:59:03" (1/1) ... [2024-11-18 23:59:03,709 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:59:03" (1/1) ... [2024-11-18 23:59:03,736 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-11-18 23:59:03,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 23:59:03,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 23:59:03,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 23:59:03,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 23:59:03,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,755 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,778 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:59:03,782 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,789 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,796 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,798 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,800 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 23:59:03,803 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 23:59:03,803 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 23:59:03,803 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 23:59:03,804 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:59:03,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:59:03,854 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:59:03,862 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:59:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 23:59:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 23:59:03,916 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 23:59:03,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 23:59:03,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 23:59:03,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 23:59:03,998 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 23:59:04,005 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 23:59:04,296 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-18 23:59:04,297 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 23:59:04,319 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 23:59:04,320 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 23:59:04,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:59:04 BoogieIcfgContainer [2024-11-18 23:59:04,321 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 23:59:04,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 23:59:04,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 23:59:04,328 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 23:59:04,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:59:03" (1/3) ... [2024-11-18 23:59:04,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dfb4b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:59:04, skipping insertion in model container [2024-11-18 23:59:04,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03" (2/3) ... [2024-11-18 23:59:04,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dfb4b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:59:04, skipping insertion in model container [2024-11-18 23:59:04,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:59:04" (3/3) ... [2024-11-18 23:59:04,332 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-87.i [2024-11-18 23:59:04,350 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 23:59:04,350 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 23:59:04,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 23:59:04,419 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;@5c931107, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 23:59:04,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 23:59:04,425 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-18 23:59:04,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-18 23:59:04,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:59:04,436 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:04,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:59:04,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:59:04,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1294417200, now seen corresponding path program 1 times [2024-11-18 23:59:04,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:59:04,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207901556] [2024-11-18 23:59:04,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:59:04,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:59:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:59:04,720 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-18 23:59:04,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:59:04,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207901556] [2024-11-18 23:59:04,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207901556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:59:04,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304685633] [2024-11-18 23:59:04,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:59:04,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:59:04,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:59:04,723 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:59:04,724 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:59:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:59:04,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 23:59:04,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:59:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-18 23:59:04,900 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:59:04,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304685633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:59:04,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 23:59:04,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 23:59:04,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217717617] [2024-11-18 23:59:04,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:59:04,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 23:59:04,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:59:04,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 23:59:04,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:59:04,934 INFO L87 Difference]: Start difference. First operand has 57 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-18 23:59:04,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:59:04,956 INFO L93 Difference]: Finished difference Result 107 states and 174 transitions. [2024-11-18 23:59:04,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 23:59:04,959 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 96 [2024-11-18 23:59:04,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:59:04,968 INFO L225 Difference]: With dead ends: 107 [2024-11-18 23:59:04,968 INFO L226 Difference]: Without dead ends: 53 [2024-11-18 23:59:04,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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:59:04,975 INFO L432 NwaCegarLoop]: 76 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, 76 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:59:04,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:59:04,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-18 23:59:05,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-18 23:59:05,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-18 23:59:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2024-11-18 23:59:05,019 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 96 [2024-11-18 23:59:05,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:59:05,020 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2024-11-18 23:59:05,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-18 23:59:05,021 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2024-11-18 23:59:05,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-18 23:59:05,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:59:05,024 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:05,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 23:59:05,228 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:59:05,229 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:59:05,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:59:05,230 INFO L85 PathProgramCache]: Analyzing trace with hash 901292460, now seen corresponding path program 1 times [2024-11-18 23:59:05,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:59:05,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786492276] [2024-11-18 23:59:05,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:59:05,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:59:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:59:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-18 23:59:14,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:59:14,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786492276] [2024-11-18 23:59:14,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786492276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:59:14,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:59:14,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 23:59:14,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466504369] [2024-11-18 23:59:14,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:59:14,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 23:59:14,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:59:14,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 23:59:14,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-18 23:59:14,790 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 23:59:15,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:59:15,196 INFO L93 Difference]: Finished difference Result 141 states and 199 transitions. [2024-11-18 23:59:15,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 23:59:15,198 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 96 [2024-11-18 23:59:15,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:59:15,201 INFO L225 Difference]: With dead ends: 141 [2024-11-18 23:59:15,202 INFO L226 Difference]: Without dead ends: 91 [2024-11-18 23:59:15,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-18 23:59:15,204 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 128 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 23:59:15,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 298 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 23:59:15,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-18 23:59:15,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 61. [2024-11-18 23:59:15,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-18 23:59:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2024-11-18 23:59:15,220 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 96 [2024-11-18 23:59:15,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:59:15,223 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2024-11-18 23:59:15,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 23:59:15,224 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2024-11-18 23:59:15,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-18 23:59:15,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:59:15,225 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:15,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 23:59:15,226 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:59:15,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:59:15,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2032895895, now seen corresponding path program 1 times [2024-11-18 23:59:15,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:59:15,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536363961] [2024-11-18 23:59:15,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:59:15,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:59:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:59:17,339 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-18 23:59:17,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:59:17,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536363961] [2024-11-18 23:59:17,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536363961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:59:17,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:59:17,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 23:59:17,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612062155] [2024-11-18 23:59:17,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:59:17,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 23:59:17,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:59:17,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 23:59:17,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 23:59:17,342 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 23:59:17,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:59:17,469 INFO L93 Difference]: Finished difference Result 138 states and 198 transitions. [2024-11-18 23:59:17,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 23:59:17,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2024-11-18 23:59:17,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:59:17,475 INFO L225 Difference]: With dead ends: 138 [2024-11-18 23:59:17,475 INFO L226 Difference]: Without dead ends: 80 [2024-11-18 23:59:17,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-18 23:59:17,478 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 65 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 23:59:17,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 206 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 23:59:17,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-18 23:59:17,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2024-11-18 23:59:17,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-18 23:59:17,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2024-11-18 23:59:17,495 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 97 [2024-11-18 23:59:17,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:59:17,496 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2024-11-18 23:59:17,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 23:59:17,496 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2024-11-18 23:59:17,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-18 23:59:17,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:59:17,499 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:17,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 23:59:17,500 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:59:17,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:59:17,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1783426192, now seen corresponding path program 1 times [2024-11-18 23:59:17,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:59:17,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813439934] [2024-11-18 23:59:17,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:59:17,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:59:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:59:26,555 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-18 23:59:26,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:59:26,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813439934] [2024-11-18 23:59:26,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813439934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:59:26,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:59:26,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-18 23:59:26,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217242354] [2024-11-18 23:59:26,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:59:26,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 23:59:26,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:59:26,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 23:59:26,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-18 23:59:26,559 INFO L87 Difference]: Start difference. First operand 63 states and 91 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 23:59:27,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:59:27,319 INFO L93 Difference]: Finished difference Result 207 states and 291 transitions. [2024-11-18 23:59:27,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 23:59:27,320 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2024-11-18 23:59:27,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:59:27,322 INFO L225 Difference]: With dead ends: 207 [2024-11-18 23:59:27,322 INFO L226 Difference]: Without dead ends: 147 [2024-11-18 23:59:27,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-18 23:59:27,324 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 128 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 23:59:27,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 388 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 23:59:27,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-18 23:59:27,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 68. [2024-11-18 23:59:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-18 23:59:27,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 99 transitions. [2024-11-18 23:59:27,339 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 99 transitions. Word has length 97 [2024-11-18 23:59:27,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:59:27,339 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 99 transitions. [2024-11-18 23:59:27,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 23:59:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 99 transitions. [2024-11-18 23:59:27,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-18 23:59:27,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:59:27,341 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:27,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 23:59:27,342 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:59:27,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:59:27,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1525260754, now seen corresponding path program 1 times [2024-11-18 23:59:27,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:59:27,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597904915] [2024-11-18 23:59:27,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:59:27,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:59:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:59:27,641 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-18 23:59:27,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:59:27,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597904915] [2024-11-18 23:59:27,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597904915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:59:27,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:59:27,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 23:59:27,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137888714] [2024-11-18 23:59:27,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:59:27,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 23:59:27,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:59:27,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 23:59:27,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 23:59:27,645 INFO L87 Difference]: Start difference. First operand 68 states and 99 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 23:59:27,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:59:27,909 INFO L93 Difference]: Finished difference Result 197 states and 279 transitions. [2024-11-18 23:59:27,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 23:59:27,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2024-11-18 23:59:27,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:59:27,912 INFO L225 Difference]: With dead ends: 197 [2024-11-18 23:59:27,912 INFO L226 Difference]: Without dead ends: 132 [2024-11-18 23:59:27,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-18 23:59:27,915 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 70 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 23:59:27,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 357 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 23:59:27,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-18 23:59:27,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 112. [2024-11-18 23:59:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 94 states have internal predecessors, (129), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-18 23:59:27,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2024-11-18 23:59:27,943 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 97 [2024-11-18 23:59:27,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:59:27,943 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2024-11-18 23:59:27,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 23:59:27,944 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2024-11-18 23:59:27,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-18 23:59:27,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:59:27,946 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:27,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 23:59:27,947 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:59:27,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:59:27,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1231677426, now seen corresponding path program 1 times [2024-11-18 23:59:27,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:59:27,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169369578] [2024-11-18 23:59:27,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:59:27,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:59:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:59:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-18 23:59:30,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:59:30,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169369578] [2024-11-18 23:59:30,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169369578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:59:30,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:59:30,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-18 23:59:30,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353317668] [2024-11-18 23:59:30,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:59:30,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 23:59:30,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:59:30,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 23:59:30,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-18 23:59:30,046 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 23:59:30,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:59:30,425 INFO L93 Difference]: Finished difference Result 321 states and 456 transitions. [2024-11-18 23:59:30,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 23:59:30,426 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2024-11-18 23:59:30,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:59:30,429 INFO L225 Difference]: With dead ends: 321 [2024-11-18 23:59:30,429 INFO L226 Difference]: Without dead ends: 212 [2024-11-18 23:59:30,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-18 23:59:30,431 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 143 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 23:59:30,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 343 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 23:59:30,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-18 23:59:30,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 178. [2024-11-18 23:59:30,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 141 states have (on average 1.3687943262411348) internal successors, (193), 143 states have internal predecessors, (193), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-18 23:59:30,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 257 transitions. [2024-11-18 23:59:30,473 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 257 transitions. Word has length 97 [2024-11-18 23:59:30,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:59:30,474 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 257 transitions. [2024-11-18 23:59:30,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 23:59:30,475 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 257 transitions. [2024-11-18 23:59:30,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-18 23:59:30,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:59:30,476 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:30,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 23:59:30,477 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:59:30,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:59:30,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1489842864, now seen corresponding path program 1 times [2024-11-18 23:59:30,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:59:30,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860104056] [2024-11-18 23:59:30,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:59:30,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:59:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:59:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-18 23:59:30,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:59:30,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860104056] [2024-11-18 23:59:30,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860104056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:59:30,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:59:30,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 23:59:30,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634866336] [2024-11-18 23:59:30,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:59:30,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 23:59:30,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:59:30,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 23:59:30,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 23:59:30,626 INFO L87 Difference]: Start difference. First operand 178 states and 257 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 23:59:30,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:59:30,721 INFO L93 Difference]: Finished difference Result 337 states and 487 transitions. [2024-11-18 23:59:30,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 23:59:30,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2024-11-18 23:59:30,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:59:30,723 INFO L225 Difference]: With dead ends: 337 [2024-11-18 23:59:30,723 INFO L226 Difference]: Without dead ends: 170 [2024-11-18 23:59:30,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 23:59:30,724 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 46 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 23:59:30,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 324 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 23:59:30,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-18 23:59:30,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2024-11-18 23:59:30,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 133 states have internal predecessors, (176), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-18 23:59:30,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 240 transitions. [2024-11-18 23:59:30,750 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 240 transitions. Word has length 97 [2024-11-18 23:59:30,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:59:30,751 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 240 transitions. [2024-11-18 23:59:30,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 23:59:30,754 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 240 transitions. [2024-11-18 23:59:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-18 23:59:30,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:59:30,755 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:30,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 23:59:30,755 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:59:30,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:59:30,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1989795673, now seen corresponding path program 1 times [2024-11-18 23:59:30,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:59:30,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373872250] [2024-11-18 23:59:30,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:59:30,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:59:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:59:38,786 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-18 23:59:38,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:59:38,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373872250] [2024-11-18 23:59:38,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373872250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:59:38,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:59:38,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-18 23:59:38,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013556916] [2024-11-18 23:59:38,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:59:38,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-18 23:59:38,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:59:38,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-18 23:59:38,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-18 23:59:38,789 INFO L87 Difference]: Start difference. First operand 168 states and 240 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 23:59:42,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:59:42,951 INFO L93 Difference]: Finished difference Result 202 states and 278 transitions. [2024-11-18 23:59:42,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-18 23:59:42,952 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2024-11-18 23:59:42,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:59:42,954 INFO L225 Difference]: With dead ends: 202 [2024-11-18 23:59:42,954 INFO L226 Difference]: Without dead ends: 200 [2024-11-18 23:59:42,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-18 23:59:42,955 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 67 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-18 23:59:42,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 479 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-18 23:59:42,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-18 23:59:42,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 178. [2024-11-18 23:59:42,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 141 states have (on average 1.3404255319148937) internal successors, (189), 143 states have internal predecessors, (189), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-18 23:59:42,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 253 transitions. [2024-11-18 23:59:42,979 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 253 transitions. Word has length 98 [2024-11-18 23:59:42,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:59:42,979 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 253 transitions. [2024-11-18 23:59:42,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 23:59:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 253 transitions. [2024-11-18 23:59:42,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-18 23:59:42,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:59:42,981 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:42,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 23:59:42,982 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:59:42,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:59:42,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1538366225, now seen corresponding path program 1 times [2024-11-18 23:59:42,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:59:42,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600404812] [2024-11-18 23:59:42,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:59:42,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:59:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:59:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-18 23:59:48,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:59:48,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600404812] [2024-11-18 23:59:48,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600404812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:59:48,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:59:48,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 23:59:48,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751326147] [2024-11-18 23:59:48,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:59:48,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 23:59:48,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:59:48,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 23:59:48,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-18 23:59:48,618 INFO L87 Difference]: Start difference. First operand 178 states and 253 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 23:59:48,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:59:48,875 INFO L93 Difference]: Finished difference Result 325 states and 458 transitions. [2024-11-18 23:59:48,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 23:59:48,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2024-11-18 23:59:48,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:59:48,877 INFO L225 Difference]: With dead ends: 325 [2024-11-18 23:59:48,877 INFO L226 Difference]: Without dead ends: 206 [2024-11-18 23:59:48,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-18 23:59:48,878 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 49 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 23:59:48,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 290 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 23:59:48,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-18 23:59:48,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 168. [2024-11-18 23:59:48,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 131 states have (on average 1.3206106870229009) internal successors, (173), 133 states have internal predecessors, (173), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-18 23:59:48,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 237 transitions. [2024-11-18 23:59:48,904 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 237 transitions. Word has length 98 [2024-11-18 23:59:48,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:59:48,904 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 237 transitions. [2024-11-18 23:59:48,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 23:59:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 237 transitions. [2024-11-18 23:59:48,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-18 23:59:48,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:59:48,905 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:48,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 23:59:48,908 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:59:48,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:59:48,908 INFO L85 PathProgramCache]: Analyzing trace with hash -2125172239, now seen corresponding path program 1 times [2024-11-18 23:59:48,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:59:48,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241185155] [2024-11-18 23:59:48,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:59:48,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:59:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:59:51,343 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-18 23:59:51,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:59:51,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241185155] [2024-11-18 23:59:51,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241185155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:59:51,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:59:51,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 23:59:51,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414803477] [2024-11-18 23:59:51,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:59:51,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 23:59:51,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:59:51,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 23:59:51,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-18 23:59:51,345 INFO L87 Difference]: Start difference. First operand 168 states and 237 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 23:59:51,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:59:51,642 INFO L93 Difference]: Finished difference Result 289 states and 403 transitions. [2024-11-18 23:59:51,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 23:59:51,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2024-11-18 23:59:51,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:59:51,644 INFO L225 Difference]: With dead ends: 289 [2024-11-18 23:59:51,644 INFO L226 Difference]: Without dead ends: 180 [2024-11-18 23:59:51,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-18 23:59:51,645 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 49 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 23:59:51,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 367 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 23:59:51,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-18 23:59:51,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 168. [2024-11-18 23:59:51,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 131 states have (on average 1.3129770992366412) internal successors, (172), 133 states have internal predecessors, (172), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-18 23:59:51,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 236 transitions. [2024-11-18 23:59:51,669 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 236 transitions. Word has length 98 [2024-11-18 23:59:51,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:59:51,669 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 236 transitions. [2024-11-18 23:59:51,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 23:59:51,670 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 236 transitions. [2024-11-18 23:59:51,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-18 23:59:51,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:59:51,671 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:51,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 23:59:51,671 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:59:51,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:59:51,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1284103269, now seen corresponding path program 1 times [2024-11-18 23:59:51,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:59:51,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307575002] [2024-11-18 23:59:51,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:59:51,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:59:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:59:55,672 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-18 23:59:55,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:59:55,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307575002] [2024-11-18 23:59:55,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307575002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:59:55,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:59:55,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-18 23:59:55,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945706939] [2024-11-18 23:59:55,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:59:55,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 23:59:55,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:59:55,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 23:59:55,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-18 23:59:55,674 INFO L87 Difference]: Start difference. First operand 168 states and 236 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 23:59:57,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:59:57,352 INFO L93 Difference]: Finished difference Result 251 states and 342 transitions. [2024-11-18 23:59:57,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 23:59:57,352 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2024-11-18 23:59:57,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:59:57,354 INFO L225 Difference]: With dead ends: 251 [2024-11-18 23:59:57,354 INFO L226 Difference]: Without dead ends: 249 [2024-11-18 23:59:57,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-18 23:59:57,357 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 32 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 23:59:57,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 405 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 23:59:57,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-18 23:59:57,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 241. [2024-11-18 23:59:57,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 191 states have (on average 1.2774869109947644) internal successors, (244), 196 states have internal predecessors, (244), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 37 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-18 23:59:57,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 328 transitions. [2024-11-18 23:59:57,400 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 328 transitions. Word has length 98 [2024-11-18 23:59:57,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:59:57,401 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 328 transitions. [2024-11-18 23:59:57,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 23:59:57,401 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 328 transitions. [2024-11-18 23:59:57,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-18 23:59:57,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:59:57,402 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:57,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 23:59:57,402 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:59:57,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:59:57,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1145620526, now seen corresponding path program 1 times [2024-11-18 23:59:57,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:59:57,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802912147] [2024-11-18 23:59:57,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:59:57,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:59:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 23:59:57,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [459239627] [2024-11-18 23:59:57,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:59:57,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:59:57,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:59:57,444 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:59:57,445 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:59:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 23:59:57,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 23:59:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 23:59:57,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 23:59:57,699 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 23:59:57,700 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 23:59:57,719 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:59:57,905 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,SelfDestructingSolverStorable11 [2024-11-18 23:59:57,910 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:59:57,991 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 23:59:57,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:59:57 BoogieIcfgContainer [2024-11-18 23:59:57,997 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 23:59:57,998 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 23:59:57,998 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 23:59:57,998 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 23:59:57,999 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:59:04" (3/4) ... [2024-11-18 23:59:58,001 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 23:59:58,002 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 23:59:58,002 INFO L158 Benchmark]: Toolchain (without parser) took 54677.58ms. Allocated memory was 172.0MB in the beginning and 851.4MB in the end (delta: 679.5MB). Free memory was 134.1MB in the beginning and 429.3MB in the end (delta: -295.2MB). Peak memory consumption was 385.1MB. Max. memory is 16.1GB. [2024-11-18 23:59:58,003 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:59:58,003 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.54ms. Allocated memory is still 172.0MB. Free memory was 133.4MB in the beginning and 119.5MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 23:59:58,003 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.77ms. Allocated memory is still 172.0MB. Free memory was 119.5MB in the beginning and 117.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 23:59:58,004 INFO L158 Benchmark]: Boogie Preprocessor took 64.49ms. Allocated memory is still 172.0MB. Free memory was 117.4MB in the beginning and 115.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 23:59:58,004 INFO L158 Benchmark]: RCFGBuilder took 517.93ms. Allocated memory is still 172.0MB. Free memory was 115.3MB in the beginning and 98.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-18 23:59:58,005 INFO L158 Benchmark]: TraceAbstraction took 53673.30ms. Allocated memory was 172.0MB in the beginning and 851.4MB in the end (delta: 679.5MB). Free memory was 97.7MB in the beginning and 429.3MB in the end (delta: -331.6MB). Peak memory consumption was 349.4MB. Max. memory is 16.1GB. [2024-11-18 23:59:58,005 INFO L158 Benchmark]: Witness Printer took 4.09ms. Allocated memory is still 851.4MB. Free memory is still 429.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:59:58,006 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.19ms. Allocated memory is still 113.2MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.54ms. Allocated memory is still 172.0MB. Free memory was 133.4MB in the beginning and 119.5MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.77ms. Allocated memory is still 172.0MB. Free memory was 119.5MB in the beginning and 117.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.49ms. Allocated memory is still 172.0MB. Free memory was 117.4MB in the beginning and 115.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 517.93ms. Allocated memory is still 172.0MB. Free memory was 115.3MB in the beginning and 98.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 53673.30ms. Allocated memory was 172.0MB in the beginning and 851.4MB in the end (delta: 679.5MB). Free memory was 97.7MB in the beginning and 429.3MB in the end (delta: -331.6MB). Peak memory consumption was 349.4MB. Max. memory is 16.1GB. * Witness Printer took 4.09ms. Allocated memory is still 851.4MB. Free memory is still 429.3MB. 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 someBinaryFLOATComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned long int var_1_3 = 3164414017; [L25] unsigned long int var_1_4 = 128; [L26] signed char var_1_5 = -128; [L27] signed char var_1_6 = 10; [L28] signed char var_1_7 = 50; [L29] float var_1_8 = 5.1; [L30] float var_1_9 = 63.75; [L31] signed char var_1_10 = 100; [L32] signed long int var_1_12 = 5; [L33] signed char last_1_var_1_10 = 100; VAL [isInitial=0, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=0, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] CALL updateLastVariables() [L90] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=0, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L100] RET updateLastVariables() [L101] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L70] var_1_3 = __VERIFIER_nondet_ulong() [L71] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L71] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L72] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L72] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L73] var_1_4 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L74] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L75] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L75] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L76] var_1_6 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_6 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L77] RET assume_abort_if_not(var_1_6 >= -126) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L78] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L78] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L79] var_1_7 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L80] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L81] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L81] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L82] var_1_9 = __VERIFIER_nondet_float() [L83] 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=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L83] 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=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L84] var_1_12 = __VERIFIER_nondet_long() [L85] CALL assume_abort_if_not(var_1_12 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=128, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=128, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L85] RET assume_abort_if_not(var_1_12 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=128, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L86] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=128, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=128, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L86] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=128, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L87] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=128, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=128, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L87] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=128, var_1_1=1, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L101] RET updateVariables() [L102] CALL step() [L37] COND TRUE \read(var_1_2) [L38] var_1_1 = ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=128, var_1_1=-2147483649, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L40] signed long int stepLocal_1 = -8; [L41] unsigned long int stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, stepLocal_1=-8, var_1_10=100, var_1_12=128, var_1_1=-2147483649, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L42] COND FALSE !(stepLocal_1 < var_1_4) [L49] var_1_5 = -2 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, var_1_10=100, var_1_12=128, var_1_1=-2147483649, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=51/10] [L51] unsigned long int stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, stepLocal_3=-2147483649, var_1_10=100, var_1_12=128, var_1_1=-2147483649, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=51/10] [L52] EXPR var_1_4 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, stepLocal_3=-2147483649, var_1_10=100, var_1_12=128, var_1_1=-2147483649, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=51/10] [L52] unsigned long int stepLocal_2 = var_1_4 >> var_1_3; [L53] COND TRUE var_1_6 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, stepLocal_3=-2147483649, var_1_10=100, var_1_12=128, var_1_1=-2147483649, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=51/10] [L54] COND TRUE var_1_6 != stepLocal_3 [L55] var_1_8 = var_1_9 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, var_1_10=100, var_1_12=128, var_1_1=-2147483649, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L58] COND FALSE !((var_1_1 + (var_1_6 / var_1_12)) < var_1_1) VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, var_1_10=100, var_1_12=128, var_1_1=-2147483649, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L102] RET step() [L103] CALL, EXPR property() [L93] EXPR ((var_1_2 ? (var_1_1 == ((unsigned long int) ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))))) : 1) && ((-8 < var_1_4) ? ((var_1_4 != var_1_1) ? (var_1_5 == ((signed char) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - var_1_7))) : (var_1_5 == ((signed char) var_1_6))) : (var_1_5 == ((signed char) -2)))) && ((var_1_6 >= (var_1_4 >> var_1_3)) ? ((var_1_6 != var_1_1) ? (var_1_8 == ((float) var_1_9)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=128, var_1_1=-2147483649, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L93] EXPR var_1_4 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=128, var_1_1=-2147483649, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L93] EXPR ((var_1_2 ? (var_1_1 == ((unsigned long int) ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))))) : 1) && ((-8 < var_1_4) ? ((var_1_4 != var_1_1) ? (var_1_5 == ((signed char) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - var_1_7))) : (var_1_5 == ((signed char) var_1_6))) : (var_1_5 == ((signed char) -2)))) && ((var_1_6 >= (var_1_4 >> var_1_3)) ? ((var_1_6 != var_1_1) ? (var_1_8 == ((float) var_1_9)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=128, var_1_1=-2147483649, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L93-L94] return (((var_1_2 ? (var_1_1 == ((unsigned long int) ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))))) : 1) && ((-8 < var_1_4) ? ((var_1_4 != var_1_1) ? (var_1_5 == ((signed char) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - var_1_7))) : (var_1_5 == ((signed char) var_1_6))) : (var_1_5 == ((signed char) -2)))) && ((var_1_6 >= (var_1_4 >> var_1_3)) ? ((var_1_6 != var_1_1) ? (var_1_8 == ((float) var_1_9)) : 1) : 1)) && (((var_1_1 + (var_1_6 / var_1_12)) < var_1_1) ? ((var_1_7 >= last_1_var_1_10) ? (var_1_10 == ((signed char) -32)) : (var_1_10 == ((signed char) var_1_7))) : 1) ; [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=128, var_1_1=-2147483649, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=128, var_1_1=-2147483649, var_1_2=1, var_1_3=-32212254721, var_1_4=-30064771072, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.5s, OverallIterations: 12, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 777 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 777 mSDsluCounter, 3533 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2679 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2051 IncrementalHoareTripleChecker+Invalid, 2066 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 854 mSDtfsCounter, 2051 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 138 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241occurred in iteration=11, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 262 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 43.0s InterpolantComputationTime, 1363 NumberOfCodeBlocks, 1363 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1153 ConstructedInterpolants, 0 QuantifiedInterpolants, 12424 SizeOfPredicates, 0 NumberOfNonLiveVariables, 223 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 4342/4368 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:59:58,126 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_operatoramount_amount25_file-87.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 e3da299f1752ee08576ff67ebc19be30d3a209c67fcfa6061ee76b74742c8873 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:00:00,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:00:00,278 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:00:00,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:00:00,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:00:00,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:00:00,326 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:00:00,327 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:00:00,327 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:00:00,329 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:00:00,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:00:00,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:00:00,332 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:00:00,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:00:00,332 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:00:00,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:00:00,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:00:00,333 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:00:00,334 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:00:00,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:00:00,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:00:00,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:00:00,337 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:00:00,338 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:00:00,338 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:00:00,341 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:00:00,341 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:00:00,341 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:00:00,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:00:00,342 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:00:00,342 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:00:00,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:00:00,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:00:00,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:00:00,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:00:00,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:00:00,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:00:00,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:00:00,344 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:00:00,346 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:00:00,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:00:00,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:00:00,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:00:00,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:00:00,347 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 -> e3da299f1752ee08576ff67ebc19be30d3a209c67fcfa6061ee76b74742c8873 [2024-11-19 00:00:00,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:00:00,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:00:00,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:00:00,702 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:00:00,703 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:00:00,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.i [2024-11-19 00:00:02,316 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:00:02,553 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:00:02,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.i [2024-11-19 00:00:02,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca0deed24/abc11d78be7541378298a87b4aa1c127/FLAG23465efe9 [2024-11-19 00:00:02,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca0deed24/abc11d78be7541378298a87b4aa1c127 [2024-11-19 00:00:02,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:00:02,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:00:02,596 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:00:02,597 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:00:02,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:00:02,604 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:00:02" (1/1) ... [2024-11-19 00:00:02,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22f9969a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:02, skipping insertion in model container [2024-11-19 00:00:02,605 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:00:02" (1/1) ... [2024-11-19 00:00:02,638 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:00:02,846 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_operatoramount_amount25_file-87.i[915,928] [2024-11-19 00:00:02,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:00:02,957 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:00:02,971 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_operatoramount_amount25_file-87.i[915,928] [2024-11-19 00:00:02,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:00:03,024 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:00:03,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:03 WrapperNode [2024-11-19 00:00:03,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:00:03,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:00:03,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:00:03,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:00:03,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:03" (1/1) ... [2024-11-19 00:00:03,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:03" (1/1) ... [2024-11-19 00:00:03,085 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2024-11-19 00:00:03,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:00:03,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:00:03,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:00:03,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:00:03,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:03" (1/1) ... [2024-11-19 00:00:03,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:03" (1/1) ... [2024-11-19 00:00:03,104 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:03" (1/1) ... [2024-11-19 00:00:03,122 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-19 00:00:03,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:03" (1/1) ... [2024-11-19 00:00:03,125 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:03" (1/1) ... [2024-11-19 00:00:03,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:03" (1/1) ... [2024-11-19 00:00:03,138 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:03" (1/1) ... [2024-11-19 00:00:03,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:03" (1/1) ... [2024-11-19 00:00:03,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:03" (1/1) ... [2024-11-19 00:00:03,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:00:03,145 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:00:03,146 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:00:03,146 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:00:03,147 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:03" (1/1) ... [2024-11-19 00:00:03,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:00:03,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:00:03,177 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-19 00:00:03,180 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-19 00:00:03,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:00:03,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:00:03,215 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:00:03,215 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:00:03,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:00:03,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:00:03,288 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:00:03,291 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:00:03,660 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-19 00:00:03,661 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:00:03,675 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:00:03,679 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:00:03,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:00:03 BoogieIcfgContainer [2024-11-19 00:00:03,679 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:00:03,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:00:03,682 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:00:03,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:00:03,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:00:02" (1/3) ... [2024-11-19 00:00:03,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69cbbc4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:00:03, skipping insertion in model container [2024-11-19 00:00:03,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:03" (2/3) ... [2024-11-19 00:00:03,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69cbbc4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:00:03, skipping insertion in model container [2024-11-19 00:00:03,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:00:03" (3/3) ... [2024-11-19 00:00:03,691 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-87.i [2024-11-19 00:00:03,712 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:00:03,713 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:00:03,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:00:03,816 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;@72babdf1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:00:03,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:00:03,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:00:03,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 00:00:03,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:00:03,832 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:00:03,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:00:03,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:00:03,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1462600844, now seen corresponding path program 1 times [2024-11-19 00:00:03,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:00:03,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074446749] [2024-11-19 00:00:03,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:00:03,856 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-19 00:00:03,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:00:03,862 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-19 00:00:03,863 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-19 00:00:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:00:04,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:00:04,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:00:04,113 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-19 00:00:04,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:00:04,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:00:04,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074446749] [2024-11-19 00:00:04,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074446749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:00:04,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:00:04,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:00:04,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202715289] [2024-11-19 00:00:04,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:00:04,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:00:04,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:00:04,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:00:04,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:00:04,154 INFO L87 Difference]: Start difference. First operand has 49 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:00:04,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:00:04,182 INFO L93 Difference]: Finished difference Result 91 states and 152 transitions. [2024-11-19 00:00:04,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:00:04,185 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2024-11-19 00:00:04,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:00:04,192 INFO L225 Difference]: With dead ends: 91 [2024-11-19 00:00:04,192 INFO L226 Difference]: Without dead ends: 45 [2024-11-19 00:00:04,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 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-19 00:00:04,199 INFO L432 NwaCegarLoop]: 65 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, 65 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-19 00:00:04,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:00:04,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-19 00:00:04,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-19 00:00:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:00:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2024-11-19 00:00:04,242 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 92 [2024-11-19 00:00:04,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:00:04,243 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. [2024-11-19 00:00:04,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:00:04,244 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2024-11-19 00:00:04,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 00:00:04,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:00:04,247 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:00:04,255 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-19 00:00:04,448 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-19 00:00:04,449 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:00:04,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:00:04,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1010599688, now seen corresponding path program 1 times [2024-11-19 00:00:04,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:00:04,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261087762] [2024-11-19 00:00:04,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:00:04,451 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-19 00:00:04,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:00:04,454 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-19 00:00:04,455 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-19 00:00:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:00:04,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:00:04,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:00:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 186 proven. 54 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-19 00:00:05,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:00:05,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:00:05,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261087762] [2024-11-19 00:00:05,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261087762] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:00:05,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [833468721] [2024-11-19 00:00:05,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:00:05,424 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:00:05,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:00:05,427 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:00:05,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-19 00:00:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:00:05,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 00:00:05,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:00:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 186 proven. 54 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-19 00:00:06,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:00:06,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [833468721] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:00:06,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:00:06,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2024-11-19 00:00:06,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955241560] [2024-11-19 00:00:06,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:00:06,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:00:06,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:00:06,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:00:06,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:00:06,289 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-19 00:00:06,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:00:06,869 INFO L93 Difference]: Finished difference Result 99 states and 137 transitions. [2024-11-19 00:00:06,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 00:00:06,879 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 92 [2024-11-19 00:00:06,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:00:06,882 INFO L225 Difference]: With dead ends: 99 [2024-11-19 00:00:06,883 INFO L226 Difference]: Without dead ends: 57 [2024-11-19 00:00:06,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:00:06,885 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 48 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:00:06,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 156 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:00:06,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-19 00:00:06,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2024-11-19 00:00:06,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:00:06,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 70 transitions. [2024-11-19 00:00:06,898 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 70 transitions. Word has length 92 [2024-11-19 00:00:06,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:00:06,899 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 70 transitions. [2024-11-19 00:00:06,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-19 00:00:06,900 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2024-11-19 00:00:06,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 00:00:06,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:00:06,902 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:00:06,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-19 00:00:07,110 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-19 00:00:07,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /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-19 00:00:07,304 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:00:07,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:00:07,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1972589641, now seen corresponding path program 1 times [2024-11-19 00:00:07,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:00:07,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559569614] [2024-11-19 00:00:07,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:00:07,306 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-19 00:00:07,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:00:07,317 INFO L229 MonitoredProcess]: Starting monitored process 5 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-19 00:00:07,318 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 (5)] Waiting until timeout for monitored process [2024-11-19 00:00:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:00:07,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 00:00:07,485 INFO L278 TraceCheckSpWp]: Computing forward predicates...