./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.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 9fafab56630000a79d8eb06cf156a630d9ee1a5dd58dfc1d8991b95956e4dffd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:08:55,326 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:08:55,411 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:08:55,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:08:55,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:08:55,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:08:55,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:08:55,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:08:55,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:08:55,450 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:08:55,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:08:55,451 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:08:55,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:08:55,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:08:55,453 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:08:55,453 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:08:55,453 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:08:55,454 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:08:55,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:08:55,454 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:08:55,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:08:55,455 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:08:55,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:08:55,456 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:08:55,456 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:08:55,456 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:08:55,457 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:08:55,457 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:08:55,457 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:08:55,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:08:55,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:08:55,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:08:55,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:08:55,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:08:55,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:08:55,459 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:08:55,459 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:08:55,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:08:55,460 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:08:55,460 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:08:55,460 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:08:55,461 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:08:55,461 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 -> 9fafab56630000a79d8eb06cf156a630d9ee1a5dd58dfc1d8991b95956e4dffd [2024-10-24 11:08:55,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:08:55,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:08:55,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:08:55,722 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:08:55,722 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:08:55,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i [2024-10-24 11:08:57,082 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:08:57,265 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:08:57,265 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i [2024-10-24 11:08:57,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2e9b6575/2b089b8a6a814f62a7f0a37c3531afd3/FLAG69166467c [2024-10-24 11:08:57,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2e9b6575/2b089b8a6a814f62a7f0a37c3531afd3 [2024-10-24 11:08:57,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:08:57,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:08:57,294 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:08:57,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:08:57,300 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:08:57,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:08:57" (1/1) ... [2024-10-24 11:08:57,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a6c50b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:57, skipping insertion in model container [2024-10-24 11:08:57,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:08:57" (1/1) ... [2024-10-24 11:08:57,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:08:57,497 WARN L248 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_variablewrapping_normal_file-70.i[913,926] [2024-10-24 11:08:57,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:08:57,579 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:08:57,606 WARN L248 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_variablewrapping_normal_file-70.i[913,926] [2024-10-24 11:08:57,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:08:57,700 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:08:57,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:57 WrapperNode [2024-10-24 11:08:57,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:08:57,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:08:57,703 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:08:57,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:08:57,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:57" (1/1) ... [2024-10-24 11:08:57,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:57" (1/1) ... [2024-10-24 11:08:57,765 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2024-10-24 11:08:57,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:08:57,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:08:57,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:08:57,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:08:57,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:57" (1/1) ... [2024-10-24 11:08:57,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:57" (1/1) ... [2024-10-24 11:08:57,785 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:57" (1/1) ... [2024-10-24 11:08:57,805 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 11:08:57,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:57" (1/1) ... [2024-10-24 11:08:57,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:57" (1/1) ... [2024-10-24 11:08:57,818 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:57" (1/1) ... [2024-10-24 11:08:57,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:57" (1/1) ... [2024-10-24 11:08:57,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:57" (1/1) ... [2024-10-24 11:08:57,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:57" (1/1) ... [2024-10-24 11:08:57,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:08:57,847 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:08:57,847 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:08:57,847 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:08:57,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:57" (1/1) ... [2024-10-24 11:08:57,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:08:57,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:08:57,882 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-10-24 11:08:57,888 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-10-24 11:08:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:08:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:08:57,933 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:08:57,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:08:57,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:08:57,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:08:58,022 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:08:58,024 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:08:58,315 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 11:08:58,315 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:08:58,342 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:08:58,342 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:08:58,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:08:58 BoogieIcfgContainer [2024-10-24 11:08:58,343 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:08:58,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:08:58,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:08:58,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:08:58,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:08:57" (1/3) ... [2024-10-24 11:08:58,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72dc6b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:08:58, skipping insertion in model container [2024-10-24 11:08:58,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:57" (2/3) ... [2024-10-24 11:08:58,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72dc6b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:08:58, skipping insertion in model container [2024-10-24 11:08:58,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:08:58" (3/3) ... [2024-10-24 11:08:58,350 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-70.i [2024-10-24 11:08:58,369 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:08:58,370 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:08:58,441 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:08:58,451 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;@4c253385, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:08:58,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:08:58,456 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:08:58,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 11:08:58,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:08:58,467 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:08:58,468 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:08:58,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:08:58,474 INFO L85 PathProgramCache]: Analyzing trace with hash 593086923, now seen corresponding path program 1 times [2024-10-24 11:08:58,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:08:58,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874445501] [2024-10-24 11:08:58,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:08:58,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:08:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:58,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:08:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:58,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:08:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:58,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:08:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:58,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:08:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:58,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:08:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:58,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:08:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:58,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 11:08:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:58,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 11:08:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:58,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 11:08:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:58,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:08:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:58,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:08:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:58,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 11:08:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:08:58,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:08:58,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874445501] [2024-10-24 11:08:58,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874445501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:08:58,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:08:58,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:08:58,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737374588] [2024-10-24 11:08:58,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:08:58,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:08:58,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:08:58,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:08:58,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:08:58,805 INFO L87 Difference]: Start difference. First operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:08:58,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:08:58,837 INFO L93 Difference]: Finished difference Result 105 states and 168 transitions. [2024-10-24 11:08:58,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:08:58,840 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2024-10-24 11:08:58,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:08:58,847 INFO L225 Difference]: With dead ends: 105 [2024-10-24 11:08:58,847 INFO L226 Difference]: Without dead ends: 52 [2024-10-24 11:08:58,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-10-24 11:08:58,853 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:08:58,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:08:58,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-24 11:08:58,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-24 11:08:58,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:08:58,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2024-10-24 11:08:58,890 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 83 [2024-10-24 11:08:58,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:08:58,890 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2024-10-24 11:08:58,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:08:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2024-10-24 11:08:58,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 11:08:58,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:08:58,897 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:08:58,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:08:58,898 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:08:58,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:08:58,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1413809453, now seen corresponding path program 1 times [2024-10-24 11:08:58,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:08:58,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603892785] [2024-10-24 11:08:58,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:08:58,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:08:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:59,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:08:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:59,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:08:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:59,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:08:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:59,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:08:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:59,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:08:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:59,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:08:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:59,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 11:08:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:59,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 11:08:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:59,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 11:08:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:59,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:08:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:59,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:08:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:59,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 11:08:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:08:59,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:08:59,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603892785] [2024-10-24 11:08:59,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603892785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:08:59,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:08:59,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:08:59,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936338645] [2024-10-24 11:08:59,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:08:59,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:08:59,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:08:59,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:08:59,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:08:59,216 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:08:59,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:08:59,286 INFO L93 Difference]: Finished difference Result 103 states and 147 transitions. [2024-10-24 11:08:59,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:08:59,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2024-10-24 11:08:59,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:08:59,289 INFO L225 Difference]: With dead ends: 103 [2024-10-24 11:08:59,291 INFO L226 Difference]: Without dead ends: 52 [2024-10-24 11:08:59,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:08:59,293 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:08:59,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:08:59,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-24 11:08:59,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-24 11:08:59,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:08:59,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 73 transitions. [2024-10-24 11:08:59,309 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 73 transitions. Word has length 83 [2024-10-24 11:08:59,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:08:59,311 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 73 transitions. [2024-10-24 11:08:59,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:08:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 73 transitions. [2024-10-24 11:08:59,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 11:08:59,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:08:59,316 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:08:59,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:08:59,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:08:59,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:08:59,317 INFO L85 PathProgramCache]: Analyzing trace with hash 382866458, now seen corresponding path program 1 times [2024-10-24 11:08:59,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:08:59,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922340370] [2024-10-24 11:08:59,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:08:59,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:08:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:09:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:09:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:09:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:09:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:09:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:09:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 11:09:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 11:09:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 11:09:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:09:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:09:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 11:09:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,240 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:09:00,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:09:00,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922340370] [2024-10-24 11:09:00,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922340370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:09:00,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:09:00,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:09:00,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825839169] [2024-10-24 11:09:00,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:09:00,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:09:00,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:09:00,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:09:00,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:09:00,244 INFO L87 Difference]: Start difference. First operand 52 states and 73 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:09:00,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:09:00,514 INFO L93 Difference]: Finished difference Result 175 states and 239 transitions. [2024-10-24 11:09:00,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:09:00,517 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2024-10-24 11:09:00,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:09:00,520 INFO L225 Difference]: With dead ends: 175 [2024-10-24 11:09:00,520 INFO L226 Difference]: Without dead ends: 124 [2024-10-24 11:09:00,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:09:00,524 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 118 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:09:00,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 230 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:09:00,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-24 11:09:00,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 89. [2024-10-24 11:09:00,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 73 states have internal predecessors, (95), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:09:00,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2024-10-24 11:09:00,549 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 85 [2024-10-24 11:09:00,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:09:00,550 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2024-10-24 11:09:00,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:09:00,550 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2024-10-24 11:09:00,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 11:09:00,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:00,553 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:09:00,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:09:00,553 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:00,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:00,554 INFO L85 PathProgramCache]: Analyzing trace with hash -426480168, now seen corresponding path program 1 times [2024-10-24 11:09:00,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:09:00,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340518161] [2024-10-24 11:09:00,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:00,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:09:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:09:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:09:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:09:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:09:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:09:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:09:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 11:09:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 11:09:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 11:09:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:09:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:09:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 11:09:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:09:00,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:09:00,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340518161] [2024-10-24 11:09:00,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340518161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:09:00,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:09:00,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:09:00,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470552831] [2024-10-24 11:09:00,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:09:00,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:09:00,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:09:00,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:09:00,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:09:00,693 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:09:00,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:09:00,746 INFO L93 Difference]: Finished difference Result 177 states and 245 transitions. [2024-10-24 11:09:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:09:00,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2024-10-24 11:09:00,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:09:00,752 INFO L225 Difference]: With dead ends: 177 [2024-10-24 11:09:00,752 INFO L226 Difference]: Without dead ends: 89 [2024-10-24 11:09:00,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:09:00,757 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:09:00,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:09:00,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-24 11:09:00,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-24 11:09:00,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 73 states have internal predecessors, (93), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:09:00,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2024-10-24 11:09:00,775 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 85 [2024-10-24 11:09:00,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:09:00,776 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2024-10-24 11:09:00,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:09:00,777 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2024-10-24 11:09:00,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 11:09:00,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:00,781 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:09:00,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:09:00,781 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:00,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:00,782 INFO L85 PathProgramCache]: Analyzing trace with hash -369221866, now seen corresponding path program 1 times [2024-10-24 11:09:00,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:09:00,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047970168] [2024-10-24 11:09:00,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:00,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:09:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:01,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:09:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:01,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:09:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:01,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:09:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:01,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:09:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:01,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:09:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:01,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:09:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:01,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 11:09:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:01,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 11:09:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:01,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 11:09:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:01,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:09:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:01,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:09:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:01,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 11:09:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:09:01,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:09:01,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047970168] [2024-10-24 11:09:01,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047970168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:09:01,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:09:01,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:09:01,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031027911] [2024-10-24 11:09:01,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:09:01,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:09:01,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:09:01,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:09:01,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:09:01,938 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:09:02,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:09:02,155 INFO L93 Difference]: Finished difference Result 200 states and 268 transitions. [2024-10-24 11:09:02,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:09:02,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2024-10-24 11:09:02,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:09:02,157 INFO L225 Difference]: With dead ends: 200 [2024-10-24 11:09:02,157 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 11:09:02,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:09:02,159 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 70 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:09:02,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 141 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:09:02,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 11:09:02,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2024-10-24 11:09:02,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 80 states have internal predecessors, (101), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:09:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2024-10-24 11:09:02,174 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 129 transitions. Word has length 85 [2024-10-24 11:09:02,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:09:02,175 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 129 transitions. [2024-10-24 11:09:02,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:09:02,175 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 129 transitions. [2024-10-24 11:09:02,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 11:09:02,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:02,176 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:09:02,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:09:02,177 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:02,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:02,180 INFO L85 PathProgramCache]: Analyzing trace with hash -570992490, now seen corresponding path program 1 times [2024-10-24 11:09:02,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:09:02,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032262303] [2024-10-24 11:09:02,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:02,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:09:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:06,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:09:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:06,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:09:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:06,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:09:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:06,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:09:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:06,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:09:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:06,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:09:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:06,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 11:09:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:06,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 11:09:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:06,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 11:09:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:06,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:09:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:06,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:09:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:06,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 11:09:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:09:06,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:09:06,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032262303] [2024-10-24 11:09:06,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032262303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:09:06,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:09:06,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:09:06,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084204886] [2024-10-24 11:09:06,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:09:06,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:09:06,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:09:06,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:09:06,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:09:06,581 INFO L87 Difference]: Start difference. First operand 96 states and 129 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:09:07,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:09:07,918 INFO L93 Difference]: Finished difference Result 231 states and 306 transitions. [2024-10-24 11:09:07,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:09:07,919 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2024-10-24 11:09:07,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:09:07,920 INFO L225 Difference]: With dead ends: 231 [2024-10-24 11:09:07,920 INFO L226 Difference]: Without dead ends: 136 [2024-10-24 11:09:07,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:09:07,922 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 99 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:09:07,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 377 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:09:07,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-24 11:09:07,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 98. [2024-10-24 11:09:07,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 82 states have internal predecessors, (104), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:09:07,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2024-10-24 11:09:07,933 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 132 transitions. Word has length 85 [2024-10-24 11:09:07,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:09:07,933 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 132 transitions. [2024-10-24 11:09:07,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:09:07,934 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2024-10-24 11:09:07,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 11:09:07,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:07,935 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:09:07,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:09:07,935 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:07,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:07,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1380339116, now seen corresponding path program 1 times [2024-10-24 11:09:07,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:09:07,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381374983] [2024-10-24 11:09:07,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:07,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:09:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:08,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:09:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:08,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:09:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:08,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:09:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:08,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:09:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:08,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:09:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:08,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:09:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:08,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 11:09:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:08,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 11:09:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:08,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 11:09:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:08,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:09:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:08,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:09:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:08,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 11:09:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:08,771 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:09:08,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:09:08,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381374983] [2024-10-24 11:09:08,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381374983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:09:08,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:09:08,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:09:08,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184372875] [2024-10-24 11:09:08,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:09:08,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:09:08,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:09:08,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:09:08,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:09:08,773 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:09:08,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:09:08,972 INFO L93 Difference]: Finished difference Result 212 states and 283 transitions. [2024-10-24 11:09:08,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:09:08,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2024-10-24 11:09:08,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:09:08,975 INFO L225 Difference]: With dead ends: 212 [2024-10-24 11:09:08,976 INFO L226 Difference]: Without dead ends: 115 [2024-10-24 11:09:08,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:09:08,977 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 22 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:09:08,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 216 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:09:08,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-24 11:09:08,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 89. [2024-10-24 11:09:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 73 states have internal predecessors, (92), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:09:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2024-10-24 11:09:09,002 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 85 [2024-10-24 11:09:09,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:09:09,003 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2024-10-24 11:09:09,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:09:09,003 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2024-10-24 11:09:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 11:09:09,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:09,004 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:09:09,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:09:09,005 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:09,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:09,008 INFO L85 PathProgramCache]: Analyzing trace with hash -839738918, now seen corresponding path program 1 times [2024-10-24 11:09:09,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:09:09,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251476741] [2024-10-24 11:09:09,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:09,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:09:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:09:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:09:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:09:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:09:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:09:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:09:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 11:09:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 11:09:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 11:09:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:09:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:09:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 11:09:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,067 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:09:09,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:09:09,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251476741] [2024-10-24 11:09:09,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251476741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:09:09,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:09:09,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:09:09,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221379342] [2024-10-24 11:09:09,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:09:09,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:09:09,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:09:09,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:09:09,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:09:09,070 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:09:09,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:09:09,099 INFO L93 Difference]: Finished difference Result 180 states and 241 transitions. [2024-10-24 11:09:09,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:09:09,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2024-10-24 11:09:09,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:09:09,101 INFO L225 Difference]: With dead ends: 180 [2024-10-24 11:09:09,101 INFO L226 Difference]: Without dead ends: 92 [2024-10-24 11:09:09,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:09:09,102 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 32 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:09:09,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 155 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:09:09,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-24 11:09:09,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2024-10-24 11:09:09,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 73 states have internal predecessors, (91), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:09:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2024-10-24 11:09:09,115 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 85 [2024-10-24 11:09:09,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:09:09,116 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2024-10-24 11:09:09,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:09:09,116 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2024-10-24 11:09:09,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 11:09:09,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:09,117 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:09:09,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:09:09,117 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:09,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:09,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1850856168, now seen corresponding path program 1 times [2024-10-24 11:09:09,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:09:09,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530515263] [2024-10-24 11:09:09,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:09,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:09:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:09:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:09:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:09:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:09:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:09:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:09:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 11:09:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 11:09:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 11:09:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:09:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:09:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 11:09:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:09:09,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:09:09,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530515263] [2024-10-24 11:09:09,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530515263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:09:09,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:09:09,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:09:09,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519146959] [2024-10-24 11:09:09,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:09:09,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:09:09,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:09:09,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:09:09,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:09:09,242 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:09:09,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:09:09,276 INFO L93 Difference]: Finished difference Result 180 states and 239 transitions. [2024-10-24 11:09:09,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:09:09,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2024-10-24 11:09:09,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:09:09,278 INFO L225 Difference]: With dead ends: 180 [2024-10-24 11:09:09,278 INFO L226 Difference]: Without dead ends: 92 [2024-10-24 11:09:09,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:09:09,279 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 22 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:09:09,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 248 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:09:09,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-24 11:09:09,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2024-10-24 11:09:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.25) internal successors, (90), 73 states have internal predecessors, (90), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:09:09,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2024-10-24 11:09:09,287 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 85 [2024-10-24 11:09:09,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:09:09,287 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2024-10-24 11:09:09,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:09:09,288 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2024-10-24 11:09:09,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 11:09:09,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:09,289 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:09:09,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:09:09,290 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:09,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:09,290 INFO L85 PathProgramCache]: Analyzing trace with hash 2053835718, now seen corresponding path program 1 times [2024-10-24 11:09:09,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:09:09,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720371588] [2024-10-24 11:09:09,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:09,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:09:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:09:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:09:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:09:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:09:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:09:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:09:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 11:09:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 11:09:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 11:09:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:09:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:09:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 11:09:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,355 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:09:09,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:09:09,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720371588] [2024-10-24 11:09:09,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720371588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:09:09,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:09:09,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:09:09,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199025070] [2024-10-24 11:09:09,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:09:09,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:09:09,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:09:09,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:09:09,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:09:09,358 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:09:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:09:09,395 INFO L93 Difference]: Finished difference Result 177 states and 235 transitions. [2024-10-24 11:09:09,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:09:09,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2024-10-24 11:09:09,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:09:09,397 INFO L225 Difference]: With dead ends: 177 [2024-10-24 11:09:09,397 INFO L226 Difference]: Without dead ends: 89 [2024-10-24 11:09:09,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:09:09,398 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:09:09,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:09:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-24 11:09:09,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-24 11:09:09,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 73 states have internal predecessors, (88), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:09:09,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 116 transitions. [2024-10-24 11:09:09,410 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 116 transitions. Word has length 88 [2024-10-24 11:09:09,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:09:09,410 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 116 transitions. [2024-10-24 11:09:09,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:09:09,411 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 116 transitions. [2024-10-24 11:09:09,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-24 11:09:09,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:09,412 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:09:09,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:09:09,412 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:09,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:09,412 INFO L85 PathProgramCache]: Analyzing trace with hash -433548531, now seen corresponding path program 1 times [2024-10-24 11:09:09,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:09:09,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096046936] [2024-10-24 11:09:09,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:09,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:09:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:09:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:09:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:09:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:09:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:09:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:09:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 11:09:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 11:09:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 11:09:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:09:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:09:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 11:09:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,640 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-24 11:09:09,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:09:09,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096046936] [2024-10-24 11:09:09,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096046936] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:09:09,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763978981] [2024-10-24 11:09:09,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:09,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:09:09,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:09:09,643 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-10-24 11:09:09,644 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-10-24 11:09:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:09,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:09:09,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:09:09,989 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 24 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-10-24 11:09:09,989 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:09:10,207 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-24 11:09:10,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763978981] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:09:10,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 11:09:10,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2024-10-24 11:09:10,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899246016] [2024-10-24 11:09:10,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 11:09:10,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:09:10,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:09:10,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:09:10,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:09:10,210 INFO L87 Difference]: Start difference. First operand 89 states and 116 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-10-24 11:09:10,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:09:10,943 INFO L93 Difference]: Finished difference Result 271 states and 341 transitions. [2024-10-24 11:09:10,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-24 11:09:10,944 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 90 [2024-10-24 11:09:10,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:09:10,946 INFO L225 Difference]: With dead ends: 271 [2024-10-24 11:09:10,946 INFO L226 Difference]: Without dead ends: 183 [2024-10-24 11:09:10,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=277, Invalid=653, Unknown=0, NotChecked=0, Total=930 [2024-10-24 11:09:10,948 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 169 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:09:10,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 184 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:09:10,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-24 11:09:10,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 108. [2024-10-24 11:09:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.1666666666666667) internal successors, (105), 91 states have internal predecessors, (105), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:09:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 133 transitions. [2024-10-24 11:09:10,960 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 133 transitions. Word has length 90 [2024-10-24 11:09:10,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:09:10,961 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 133 transitions. [2024-10-24 11:09:10,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-10-24 11:09:10,961 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 133 transitions. [2024-10-24 11:09:10,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-24 11:09:10,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:10,962 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:09:10,979 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-10-24 11:09:11,163 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,SelfDestructingSolverStorable10 [2024-10-24 11:09:11,163 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:11,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:11,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1535686259, now seen corresponding path program 1 times [2024-10-24 11:09:11,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:09:11,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794953212] [2024-10-24 11:09:11,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:11,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:09:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:11,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:09:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:11,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:09:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:11,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:09:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:11,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:09:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:11,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:09:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:11,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:09:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:11,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 11:09:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:11,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 11:09:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:11,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 11:09:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:11,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:09:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:11,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:09:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:11,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 11:09:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:11,663 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-24 11:09:11,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:09:11,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794953212] [2024-10-24 11:09:11,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794953212] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:09:11,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369455397] [2024-10-24 11:09:11,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:11,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:09:11,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:09:11,667 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-10-24 11:09:11,669 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-10-24 11:09:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:11,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 11:09:11,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:09:11,962 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-24 11:09:11,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:09:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-24 11:09:12,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369455397] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:09:12,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 11:09:12,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2024-10-24 11:09:12,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245836789] [2024-10-24 11:09:12,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 11:09:12,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-24 11:09:12,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:09:12,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-24 11:09:12,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:09:12,227 INFO L87 Difference]: Start difference. First operand 108 states and 133 transitions. Second operand has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2024-10-24 11:09:13,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:09:13,055 INFO L93 Difference]: Finished difference Result 227 states and 275 transitions. [2024-10-24 11:09:13,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-24 11:09:13,056 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 90 [2024-10-24 11:09:13,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:09:13,057 INFO L225 Difference]: With dead ends: 227 [2024-10-24 11:09:13,057 INFO L226 Difference]: Without dead ends: 120 [2024-10-24 11:09:13,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=284, Invalid=1122, Unknown=0, NotChecked=0, Total=1406 [2024-10-24 11:09:13,059 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 219 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:09:13,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 195 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:09:13,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-24 11:09:13,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2024-10-24 11:09:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.118279569892473) internal successors, (104), 94 states have internal predecessors, (104), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:09:13,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 132 transitions. [2024-10-24 11:09:13,072 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 132 transitions. Word has length 90 [2024-10-24 11:09:13,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:09:13,072 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 132 transitions. [2024-10-24 11:09:13,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2024-10-24 11:09:13,073 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2024-10-24 11:09:13,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-24 11:09:13,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:13,073 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:09:13,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 11:09:13,274 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-10-24 11:09:13,275 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:13,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:13,275 INFO L85 PathProgramCache]: Analyzing trace with hash -2122492273, now seen corresponding path program 1 times [2024-10-24 11:09:13,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:09:13,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835315222] [2024-10-24 11:09:13,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:13,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:09:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:09:13,312 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:09:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:09:13,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:09:13,366 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:09:13,367 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:09:13,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 11:09:13,373 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:09:13,441 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:09:13,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:09:13 BoogieIcfgContainer [2024-10-24 11:09:13,444 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:09:13,444 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:09:13,444 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:09:13,444 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:09:13,445 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:08:58" (3/4) ... [2024-10-24 11:09:13,447 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:09:13,448 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:09:13,448 INFO L158 Benchmark]: Toolchain (without parser) took 16156.94ms. Allocated memory was 186.6MB in the beginning and 478.2MB in the end (delta: 291.5MB). Free memory was 123.8MB in the beginning and 426.6MB in the end (delta: -302.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:09:13,449 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 94.4MB. Free memory was 49.1MB in the beginning and 49.0MB in the end (delta: 75.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:09:13,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.59ms. Allocated memory is still 186.6MB. Free memory was 123.3MB in the beginning and 154.5MB in the end (delta: -31.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 11:09:13,449 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.85ms. Allocated memory is still 186.6MB. Free memory was 154.5MB in the beginning and 151.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:09:13,450 INFO L158 Benchmark]: Boogie Preprocessor took 75.31ms. Allocated memory is still 186.6MB. Free memory was 151.0MB in the beginning and 147.6MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:09:13,450 INFO L158 Benchmark]: RCFGBuilder took 496.17ms. Allocated memory is still 186.6MB. Free memory was 147.6MB in the beginning and 127.2MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 11:09:13,450 INFO L158 Benchmark]: TraceAbstraction took 15099.08ms. Allocated memory was 186.6MB in the beginning and 478.2MB in the end (delta: 291.5MB). Free memory was 126.6MB in the beginning and 426.6MB in the end (delta: -300.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:09:13,450 INFO L158 Benchmark]: Witness Printer took 3.65ms. Allocated memory is still 478.2MB. Free memory is still 426.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:09:13,452 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.15ms. Allocated memory is still 94.4MB. Free memory was 49.1MB in the beginning and 49.0MB in the end (delta: 75.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 407.59ms. Allocated memory is still 186.6MB. Free memory was 123.3MB in the beginning and 154.5MB in the end (delta: -31.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.85ms. Allocated memory is still 186.6MB. Free memory was 154.5MB in the beginning and 151.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.31ms. Allocated memory is still 186.6MB. Free memory was 151.0MB in the beginning and 147.6MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 496.17ms. Allocated memory is still 186.6MB. Free memory was 147.6MB in the beginning and 127.2MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 15099.08ms. Allocated memory was 186.6MB in the beginning and 478.2MB in the end (delta: 291.5MB). Free memory was 126.6MB in the beginning and 426.6MB in the end (delta: -300.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.65ms. Allocated memory is still 478.2MB. Free memory is still 426.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryArithmeticDOUBLEoperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_4 = 19138; [L25] signed char var_1_6 = 25; [L26] signed long int var_1_7 = -50; [L27] double var_1_8 = 8.3; [L28] double var_1_9 = 255.6; [L29] double var_1_10 = 10000000.375; [L30] double var_1_11 = 0.0; [L31] double var_1_12 = 255.375; [L32] unsigned char var_1_13 = 50; [L33] unsigned char var_1_14 = 2; [L34] signed char var_1_15 = 1; [L35] signed char var_1_16 = 5; [L89] isInitial = 1 [L90] FCALL initially() [L91] COND TRUE 1 [L92] FCALL updateLastVariables() [L93] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L63] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L63] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L64] var_1_4 = __VERIFIER_nondet_ushort() [L65] CALL assume_abort_if_not(var_1_4 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L65] RET assume_abort_if_not(var_1_4 >= 16383) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L66] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L66] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L67] var_1_9 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L68] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L69] var_1_10 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L70] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L71] var_1_11 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L72] RET assume_abort_if_not((var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L73] var_1_12 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L74] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L75] var_1_14 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L76] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L77] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L77] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L78] var_1_16 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L79] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L80] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L80] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L93] RET updateVariables() [L94] CALL step() [L39] var_1_13 = var_1_14 [L40] var_1_15 = var_1_16 VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L41] COND TRUE \read(var_1_2) [L42] var_1_1 = ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L44] COND FALSE !(var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L47] unsigned short int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L48] EXPR var_1_13 << var_1_13 VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L48] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L48] EXPR var_1_13 << var_1_13 VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L48] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L48] COND FALSE !(stepLocal_0 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) [L51] var_1_7 = (var_1_13 + (var_1_1 + var_1_4)) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988, var_1_8=83/10] [L53] unsigned char stepLocal_1 = var_1_13; VAL [isInitial=1, stepLocal_1=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988, var_1_8=83/10] [L54] COND FALSE !(var_1_13 < stepLocal_1) [L57] var_1_8 = ((var_1_11 - var_1_12) - var_1_9) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L94] RET step() [L95] CALL, EXPR property() [L85] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85] EXPR var_1_13 << var_1_13 VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85] EXPR var_1_13 << var_1_13 VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85-L86] return (((((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4)))))) && ((var_1_13 < var_1_13) ? (var_1_8 == ((double) (var_1_9 - var_1_10))) : (var_1_8 == ((double) ((var_1_11 - var_1_12) - var_1_9))))) && (var_1_13 == ((unsigned char) var_1_14))) && (var_1_15 == ((signed char) var_1_16)) ; [L95] RET, EXPR property() [L95] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L19] reach_error() VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.0s, OverallIterations: 13, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 759 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 751 mSDsluCounter, 2153 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1391 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1962 IncrementalHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 762 mSDtfsCounter, 1962 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 772 GetRequests, 671 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=12, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 204 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 1299 NumberOfCodeBlocks, 1299 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1373 ConstructedInterpolants, 0 QuantifiedInterpolants, 5601 SizeOfPredicates, 6 NumberOfNonLiveVariables, 435 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 4071/4224 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-10-24 11:09:13,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.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 9fafab56630000a79d8eb06cf156a630d9ee1a5dd58dfc1d8991b95956e4dffd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:09:15,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:09:15,851 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:09:15,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:09:15,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:09:15,890 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:09:15,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:09:15,891 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:09:15,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:09:15,892 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:09:15,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:09:15,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:09:15,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:09:15,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:09:15,894 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:09:15,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:09:15,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:09:15,895 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:09:15,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:09:15,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:09:15,896 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:09:15,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:09:15,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:09:15,897 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:09:15,897 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:09:15,898 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:09:15,898 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:09:15,898 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:09:15,899 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:09:15,899 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:09:15,899 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:09:15,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:09:15,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:09:15,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:09:15,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:09:15,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:09:15,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:09:15,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:09:15,907 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:09:15,907 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:09:15,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:09:15,908 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:09:15,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:09:15,909 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:09:15,909 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:09:15,909 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 -> 9fafab56630000a79d8eb06cf156a630d9ee1a5dd58dfc1d8991b95956e4dffd [2024-10-24 11:09:16,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:09:16,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:09:16,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:09:16,292 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:09:16,294 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:09:16,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i [2024-10-24 11:09:17,934 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:09:18,154 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:09:18,156 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i [2024-10-24 11:09:18,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/125b8c149/5079ce2dccc24431b4cdbe56a0980573/FLAG60cde83c8 [2024-10-24 11:09:18,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/125b8c149/5079ce2dccc24431b4cdbe56a0980573 [2024-10-24 11:09:18,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:09:18,527 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:09:18,528 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:09:18,528 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:09:18,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:09:18,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:09:18" (1/1) ... [2024-10-24 11:09:18,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b032dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:18, skipping insertion in model container [2024-10-24 11:09:18,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:09:18" (1/1) ... [2024-10-24 11:09:18,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:09:18,765 WARN L248 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_variablewrapping_normal_file-70.i[913,926] [2024-10-24 11:09:18,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:09:18,841 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:09:18,853 WARN L248 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_variablewrapping_normal_file-70.i[913,926] [2024-10-24 11:09:18,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:09:18,913 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:09:18,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:18 WrapperNode [2024-10-24 11:09:18,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:09:18,915 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:09:18,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:09:18,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:09:18,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:18" (1/1) ... [2024-10-24 11:09:18,939 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:18" (1/1) ... [2024-10-24 11:09:18,973 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2024-10-24 11:09:18,973 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:09:18,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:09:18,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:09:18,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:09:18,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:18" (1/1) ... [2024-10-24 11:09:18,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:18" (1/1) ... [2024-10-24 11:09:18,996 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:18" (1/1) ... [2024-10-24 11:09:19,017 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-10-24 11:09:19,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:18" (1/1) ... [2024-10-24 11:09:19,018 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:18" (1/1) ... [2024-10-24 11:09:19,030 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:18" (1/1) ... [2024-10-24 11:09:19,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:18" (1/1) ... [2024-10-24 11:09:19,035 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:18" (1/1) ... [2024-10-24 11:09:19,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:18" (1/1) ... [2024-10-24 11:09:19,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:09:19,048 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:09:19,052 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:09:19,052 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:09:19,053 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:18" (1/1) ... [2024-10-24 11:09:19,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:09:19,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:09:19,092 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-10-24 11:09:19,098 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-10-24 11:09:19,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:09:19,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:09:19,144 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:09:19,144 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:09:19,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:09:19,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:09:19,243 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:09:19,246 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:09:20,582 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 11:09:20,582 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:09:20,634 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:09:20,634 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:09:20,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:09:20 BoogieIcfgContainer [2024-10-24 11:09:20,634 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:09:20,636 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:09:20,639 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:09:20,642 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:09:20,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:09:18" (1/3) ... [2024-10-24 11:09:20,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb69d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:09:20, skipping insertion in model container [2024-10-24 11:09:20,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:18" (2/3) ... [2024-10-24 11:09:20,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb69d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:09:20, skipping insertion in model container [2024-10-24 11:09:20,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:09:20" (3/3) ... [2024-10-24 11:09:20,645 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-70.i [2024-10-24 11:09:20,659 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:09:20,660 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:09:20,722 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:09:20,728 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;@402c3471, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:09:20,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:09:20,733 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:09:20,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 11:09:20,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:20,743 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:09:20,744 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:20,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:20,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1254920039, now seen corresponding path program 1 times [2024-10-24 11:09:20,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:09:20,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897532134] [2024-10-24 11:09:20,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:20,764 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-10-24 11:09:20,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:09:20,767 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-10-24 11:09:20,768 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-10-24 11:09:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:21,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:09:21,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:09:21,138 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-24 11:09:21,138 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:09:21,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:09:21,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897532134] [2024-10-24 11:09:21,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897532134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:09:21,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:09:21,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:09:21,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451534166] [2024-10-24 11:09:21,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:09:21,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:09:21,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:09:21,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:09:21,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:09:21,170 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:09:21,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:09:21,765 INFO L93 Difference]: Finished difference Result 75 states and 124 transitions. [2024-10-24 11:09:21,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:09:21,785 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2024-10-24 11:09:21,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:09:21,790 INFO L225 Difference]: With dead ends: 75 [2024-10-24 11:09:21,790 INFO L226 Difference]: Without dead ends: 37 [2024-10-24 11:09:21,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 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-10-24 11:09:21,796 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:09:21,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:09:21,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-24 11:09:21,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-24 11:09:21,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:09:21,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. [2024-10-24 11:09:21,833 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 52 transitions. Word has length 79 [2024-10-24 11:09:21,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:09:21,833 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 52 transitions. [2024-10-24 11:09:21,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:09:21,834 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. [2024-10-24 11:09:21,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 11:09:21,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:21,837 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:09:21,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 11:09:22,037 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-10-24 11:09:22,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:22,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:22,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1235641761, now seen corresponding path program 1 times [2024-10-24 11:09:22,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:09:22,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164483934] [2024-10-24 11:09:22,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:22,040 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-10-24 11:09:22,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:09:22,044 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-10-24 11:09:22,047 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-10-24 11:09:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:22,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 11:09:22,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:09:22,376 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:09:22,376 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:09:22,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:09:22,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164483934] [2024-10-24 11:09:22,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164483934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:09:22,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:09:22,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:09:22,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762141133] [2024-10-24 11:09:22,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:09:22,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:09:22,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:09:22,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:09:22,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:09:22,380 INFO L87 Difference]: Start difference. First operand 37 states and 52 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:09:24,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:09:24,003 INFO L93 Difference]: Finished difference Result 73 states and 103 transitions. [2024-10-24 11:09:24,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:09:24,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2024-10-24 11:09:24,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:09:24,019 INFO L225 Difference]: With dead ends: 73 [2024-10-24 11:09:24,019 INFO L226 Difference]: Without dead ends: 37 [2024-10-24 11:09:24,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:09:24,022 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:09:24,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 11:09:24,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-24 11:09:24,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-24 11:09:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:09:24,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2024-10-24 11:09:24,031 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 79 [2024-10-24 11:09:24,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:09:24,033 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2024-10-24 11:09:24,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:09:24,034 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2024-10-24 11:09:24,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 11:09:24,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:24,037 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:09:24,049 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-10-24 11:09:24,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-10-24 11:09:24,238 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:24,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:24,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1235701343, now seen corresponding path program 1 times [2024-10-24 11:09:24,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:09:24,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699553943] [2024-10-24 11:09:24,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:24,240 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-10-24 11:09:24,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:09:24,241 INFO L229 MonitoredProcess]: Starting monitored process 4 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-10-24 11:09:24,242 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 (4)] Waiting until timeout for monitored process [2024-10-24 11:09:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:24,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:09:24,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:09:25,125 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 98 proven. 48 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-24 11:09:25,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:09:25,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:09:25,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699553943] [2024-10-24 11:09:25,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699553943] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:09:25,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2007904283] [2024-10-24 11:09:25,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:25,315 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:09:25,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:09:25,319 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 11:09:25,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-24 11:09:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:26,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 11:09:26,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:09:26,591 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 98 proven. 48 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-24 11:09:26,591 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:09:26,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2007904283] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:09:26,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:09:26,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-10-24 11:09:26,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279973241] [2024-10-24 11:09:26,770 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:09:26,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:09:26,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:09:26,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:09:26,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:09:26,774 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 11:09:28,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:09:28,976 INFO L93 Difference]: Finished difference Result 103 states and 132 transitions. [2024-10-24 11:09:28,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 11:09:28,977 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 79 [2024-10-24 11:09:28,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:09:28,979 INFO L225 Difference]: With dead ends: 103 [2024-10-24 11:09:28,979 INFO L226 Difference]: Without dead ends: 67 [2024-10-24 11:09:28,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:09:28,980 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 72 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:09:28,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 88 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-24 11:09:28,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-24 11:09:28,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2024-10-24 11:09:28,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 41 states have (on average 1.146341463414634) internal successors, (47), 42 states have internal predecessors, (47), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:09:28,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2024-10-24 11:09:28,996 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 79 [2024-10-24 11:09:28,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:09:28,996 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2024-10-24 11:09:28,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 11:09:28,996 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2024-10-24 11:09:28,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 11:09:28,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:28,998 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:09:29,011 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 (4)] Forceful destruction successful, exit code 0 [2024-10-24 11:09:29,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-10-24 11:09:29,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 11:09:29,400 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:29,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:29,403 INFO L85 PathProgramCache]: Analyzing trace with hash 426354717, now seen corresponding path program 1 times [2024-10-24 11:09:29,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:09:29,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643006579] [2024-10-24 11:09:29,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:29,404 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-10-24 11:09:29,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:09:29,408 INFO L229 MonitoredProcess]: Starting monitored process 6 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-10-24 11:09:29,409 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 (6)] Waiting until timeout for monitored process [2024-10-24 11:09:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:29,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-24 11:09:29,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:10:15,197 WARN L286 SmtUtils]: Spent 16.23s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)