./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_fillercode_fillercodestructure_filler-pe-ci_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_fillercode_fillercodestructure_filler-pe-ci_file-50.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 dc7b01a2a7c989275ee332c4df25904527cd5d9a922607559c6a4e85b8c49683 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:37:37,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:37:37,396 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 01:37:37,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:37:37,399 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:37:37,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:37:37,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:37:37,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:37:37,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:37:37,417 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:37:37,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:37:37,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:37:37,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:37:37,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:37:37,418 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:37:37,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:37:37,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:37:37,419 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:37:37,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 01:37:37,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:37:37,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:37:37,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:37:37,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:37:37,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:37:37,422 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:37:37,422 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:37:37,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:37:37,423 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:37:37,423 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:37:37,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:37:37,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:37:37,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:37:37,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:37:37,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:37:37,425 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:37:37,425 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:37:37,425 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 01:37:37,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 01:37:37,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:37:37,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:37:37,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:37:37,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:37:37,427 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 -> dc7b01a2a7c989275ee332c4df25904527cd5d9a922607559c6a4e85b8c49683 [2024-10-13 01:37:37,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:37:37,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:37:37,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:37:37,682 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:37:37,682 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:37:37,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-50.i [2024-10-13 01:37:38,982 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:37:39,149 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:37:39,150 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-50.i [2024-10-13 01:37:39,158 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/585c0a5e5/26309af28d434898a5645e8a1625ae9f/FLAG46f91aa79 [2024-10-13 01:37:39,538 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/585c0a5e5/26309af28d434898a5645e8a1625ae9f [2024-10-13 01:37:39,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:37:39,542 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:37:39,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:37:39,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:37:39,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:37:39,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:37:39" (1/1) ... [2024-10-13 01:37:39,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33cdd9ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:39, skipping insertion in model container [2024-10-13 01:37:39,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:37:39" (1/1) ... [2024-10-13 01:37:39,603 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:37:39,791 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_fillercode_fillercodestructure_filler-pe-ci_file-50.i[919,932] [2024-10-13 01:37:39,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:37:39,893 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:37:39,923 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_fillercode_fillercodestructure_filler-pe-ci_file-50.i[919,932] [2024-10-13 01:37:39,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:37:39,986 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:37:39,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:39 WrapperNode [2024-10-13 01:37:39,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:37:39,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:37:39,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:37:39,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:37:39,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:39" (1/1) ... [2024-10-13 01:37:40,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:39" (1/1) ... [2024-10-13 01:37:40,036 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2024-10-13 01:37:40,036 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:37:40,037 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:37:40,037 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:37:40,037 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:37:40,047 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:39" (1/1) ... [2024-10-13 01:37:40,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:39" (1/1) ... [2024-10-13 01:37:40,051 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:39" (1/1) ... [2024-10-13 01:37:40,091 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-13 01:37:40,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:39" (1/1) ... [2024-10-13 01:37:40,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:39" (1/1) ... [2024-10-13 01:37:40,110 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:39" (1/1) ... [2024-10-13 01:37:40,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:39" (1/1) ... [2024-10-13 01:37:40,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:39" (1/1) ... [2024-10-13 01:37:40,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:39" (1/1) ... [2024-10-13 01:37:40,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:37:40,136 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:37:40,137 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:37:40,137 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:37:40,138 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:39" (1/1) ... [2024-10-13 01:37:40,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:37:40,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:37:40,169 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-13 01:37:40,176 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-13 01:37:40,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:37:40,214 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:37:40,214 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:37:40,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 01:37:40,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:37:40,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:37:40,290 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:37:40,292 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:37:40,659 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-13 01:37:40,659 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:37:40,700 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:37:40,701 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:37:40,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:37:40 BoogieIcfgContainer [2024-10-13 01:37:40,701 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:37:40,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:37:40,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:37:40,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:37:40,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:37:39" (1/3) ... [2024-10-13 01:37:40,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386c20cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:37:40, skipping insertion in model container [2024-10-13 01:37:40,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:39" (2/3) ... [2024-10-13 01:37:40,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386c20cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:37:40, skipping insertion in model container [2024-10-13 01:37:40,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:37:40" (3/3) ... [2024-10-13 01:37:40,709 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-50.i [2024-10-13 01:37:40,723 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:37:40,723 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:37:40,784 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:37:40,791 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;@266068c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:37:40,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:37:40,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 59 states have internal predecessors, (85), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 01:37:40,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-13 01:37:40,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:40,815 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:40,815 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:40,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:40,820 INFO L85 PathProgramCache]: Analyzing trace with hash -638530657, now seen corresponding path program 1 times [2024-10-13 01:37:40,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:40,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667171160] [2024-10-13 01:37:40,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:40,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:37:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:37:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:37:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:37:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:37:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:37:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:37:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:37:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:37:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:37:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:37:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:37:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:37:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:37:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:37:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:37:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:37:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:37:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:37:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:37:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:37:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:37:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 01:37:41,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:41,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667171160] [2024-10-13 01:37:41,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667171160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:41,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:41,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:37:41,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68697231] [2024-10-13 01:37:41,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:41,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:37:41,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:41,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:37:41,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:37:41,253 INFO L87 Difference]: Start difference. First operand has 85 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 59 states have internal predecessors, (85), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 01:37:41,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:41,315 INFO L93 Difference]: Finished difference Result 167 states and 288 transitions. [2024-10-13 01:37:41,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:37:41,318 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2024-10-13 01:37:41,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:41,331 INFO L225 Difference]: With dead ends: 167 [2024-10-13 01:37:41,334 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 01:37:41,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-13 01:37:41,343 INFO L432 NwaCegarLoop]: 124 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, 124 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-13 01:37:41,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:37:41,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 01:37:41,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-13 01:37:41,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 01:37:41,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 127 transitions. [2024-10-13 01:37:41,405 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 127 transitions. Word has length 161 [2024-10-13 01:37:41,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:41,405 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 127 transitions. [2024-10-13 01:37:41,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 01:37:41,406 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 127 transitions. [2024-10-13 01:37:41,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-13 01:37:41,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:41,409 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:41,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 01:37:41,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:41,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:41,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1078743205, now seen corresponding path program 1 times [2024-10-13 01:37:41,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:41,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112358864] [2024-10-13 01:37:41,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:41,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:37:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:37:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:37:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:37:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:37:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:37:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:37:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:37:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:37:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:37:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:37:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:37:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:37:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:37:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:37:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:37:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:37:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:37:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:37:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:37:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:37:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:37:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:41,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 01:37:41,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:41,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112358864] [2024-10-13 01:37:41,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112358864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:41,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:41,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:37:41,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484608109] [2024-10-13 01:37:41,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:41,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:37:41,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:41,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:37:41,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:37:41,720 INFO L87 Difference]: Start difference. First operand 83 states and 127 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:37:41,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:41,761 INFO L93 Difference]: Finished difference Result 166 states and 255 transitions. [2024-10-13 01:37:41,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:37:41,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-13 01:37:41,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:41,765 INFO L225 Difference]: With dead ends: 166 [2024-10-13 01:37:41,765 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 01:37:41,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-13 01:37:41,769 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:41,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 240 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:37:41,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 01:37:41,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-13 01:37:41,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 58 states have internal predecessors, (80), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 01:37:41,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 128 transitions. [2024-10-13 01:37:41,784 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 128 transitions. Word has length 161 [2024-10-13 01:37:41,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:41,787 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 128 transitions. [2024-10-13 01:37:41,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:37:41,789 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 128 transitions. [2024-10-13 01:37:41,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-13 01:37:41,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:41,793 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:41,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 01:37:41,793 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:41,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:41,794 INFO L85 PathProgramCache]: Analyzing trace with hash 908908487, now seen corresponding path program 1 times [2024-10-13 01:37:41,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:41,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055633163] [2024-10-13 01:37:41,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:41,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:37:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:37:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:37:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:37:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:37:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:37:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:37:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:37:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:37:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:37:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:37:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:37:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:37:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:37:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:37:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:37:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:37:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:37:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:37:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:37:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:37:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:37:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 01:37:42,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:42,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055633163] [2024-10-13 01:37:42,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055633163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:42,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:42,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:37:42,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991438570] [2024-10-13 01:37:42,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:42,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:37:42,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:42,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:37:42,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:37:42,134 INFO L87 Difference]: Start difference. First operand 84 states and 128 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:37:42,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:42,309 INFO L93 Difference]: Finished difference Result 249 states and 380 transitions. [2024-10-13 01:37:42,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:37:42,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-10-13 01:37:42,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:42,312 INFO L225 Difference]: With dead ends: 249 [2024-10-13 01:37:42,312 INFO L226 Difference]: Without dead ends: 166 [2024-10-13 01:37:42,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-13 01:37:42,313 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 120 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:42,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 297 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:37:42,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-13 01:37:42,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 88. [2024-10-13 01:37:42,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 01:37:42,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 133 transitions. [2024-10-13 01:37:42,322 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 133 transitions. Word has length 162 [2024-10-13 01:37:42,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:42,322 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 133 transitions. [2024-10-13 01:37:42,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:37:42,323 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 133 transitions. [2024-10-13 01:37:42,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-13 01:37:42,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:42,324 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:42,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 01:37:42,325 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:42,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:42,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1085236219, now seen corresponding path program 1 times [2024-10-13 01:37:42,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:42,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013411755] [2024-10-13 01:37:42,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:42,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:37:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:37:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:37:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:37:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:37:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:37:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:37:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:37:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:37:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:37:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:37:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:37:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:37:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:37:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:37:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:37:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:37:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:37:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:37:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:37:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:37:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:37:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:42,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 01:37:42,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:42,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013411755] [2024-10-13 01:37:42,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013411755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:42,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:42,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:37:42,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953807144] [2024-10-13 01:37:42,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:42,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:37:42,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:42,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:37:42,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:37:42,874 INFO L87 Difference]: Start difference. First operand 88 states and 133 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:37:43,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:43,027 INFO L93 Difference]: Finished difference Result 227 states and 340 transitions. [2024-10-13 01:37:43,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:37:43,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-10-13 01:37:43,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:43,032 INFO L225 Difference]: With dead ends: 227 [2024-10-13 01:37:43,032 INFO L226 Difference]: Without dead ends: 140 [2024-10-13 01:37:43,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:37:43,034 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 63 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:43,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 353 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:37:43,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-13 01:37:43,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2024-10-13 01:37:43,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 104 states have internal predecessors, (143), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-13 01:37:43,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 205 transitions. [2024-10-13 01:37:43,058 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 205 transitions. Word has length 162 [2024-10-13 01:37:43,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:43,059 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 205 transitions. [2024-10-13 01:37:43,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:37:43,059 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 205 transitions. [2024-10-13 01:37:43,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-13 01:37:43,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:43,064 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:43,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 01:37:43,064 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:43,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:43,064 INFO L85 PathProgramCache]: Analyzing trace with hash -267587769, now seen corresponding path program 1 times [2024-10-13 01:37:43,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:43,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134741091] [2024-10-13 01:37:43,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:43,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:43,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:43,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:37:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:43,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:37:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:43,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:37:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:43,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:37:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:43,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:37:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:43,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:37:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:43,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:37:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:43,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:37:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:43,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:37:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:43,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:37:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:43,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:37:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:43,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:37:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:43,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:37:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:43,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:37:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:43,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:37:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:43,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:43,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:37:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:43,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:37:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:43,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:37:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:43,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:37:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:43,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:37:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:43,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:37:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:43,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:37:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:43,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 01:37:43,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:43,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134741091] [2024-10-13 01:37:43,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134741091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:43,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:43,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 01:37:43,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432430396] [2024-10-13 01:37:43,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:43,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 01:37:43,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:43,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 01:37:43,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 01:37:43,617 INFO L87 Difference]: Start difference. First operand 137 states and 205 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:37:44,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:44,317 INFO L93 Difference]: Finished difference Result 631 states and 939 transitions. [2024-10-13 01:37:44,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 01:37:44,317 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-10-13 01:37:44,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:44,322 INFO L225 Difference]: With dead ends: 631 [2024-10-13 01:37:44,322 INFO L226 Difference]: Without dead ends: 495 [2024-10-13 01:37:44,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-13 01:37:44,324 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 386 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:44,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 570 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 01:37:44,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-10-13 01:37:44,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 309. [2024-10-13 01:37:44,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 232 states have (on average 1.3836206896551724) internal successors, (321), 236 states have internal predecessors, (321), 70 states have call successors, (70), 6 states have call predecessors, (70), 6 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 01:37:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 461 transitions. [2024-10-13 01:37:44,371 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 461 transitions. Word has length 162 [2024-10-13 01:37:44,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:44,371 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 461 transitions. [2024-10-13 01:37:44,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:37:44,372 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 461 transitions. [2024-10-13 01:37:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-13 01:37:44,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:44,374 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:44,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 01:37:44,374 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:44,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:44,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1945411655, now seen corresponding path program 1 times [2024-10-13 01:37:44,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:44,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863022097] [2024-10-13 01:37:44,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:44,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:37:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:37:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:37:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:37:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:37:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:37:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:37:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:37:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:37:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:37:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:37:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:37:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:37:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:37:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:37:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:37:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:37:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:37:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:37:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:37:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:37:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:37:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 01:37:44,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:44,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863022097] [2024-10-13 01:37:44,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863022097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:44,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:44,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:37:44,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803043112] [2024-10-13 01:37:44,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:44,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:37:44,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:44,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:37:44,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:37:44,510 INFO L87 Difference]: Start difference. First operand 309 states and 461 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:37:44,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:44,646 INFO L93 Difference]: Finished difference Result 584 states and 874 transitions. [2024-10-13 01:37:44,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:37:44,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-10-13 01:37:44,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:44,649 INFO L225 Difference]: With dead ends: 584 [2024-10-13 01:37:44,649 INFO L226 Difference]: Without dead ends: 309 [2024-10-13 01:37:44,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-13 01:37:44,655 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 120 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:44,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 182 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:37:44,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-13 01:37:44,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 303. [2024-10-13 01:37:44,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 226 states have (on average 1.3716814159292035) internal successors, (310), 230 states have internal predecessors, (310), 70 states have call successors, (70), 6 states have call predecessors, (70), 6 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 01:37:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 450 transitions. [2024-10-13 01:37:44,716 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 450 transitions. Word has length 162 [2024-10-13 01:37:44,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:44,716 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 450 transitions. [2024-10-13 01:37:44,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:37:44,717 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 450 transitions. [2024-10-13 01:37:44,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-13 01:37:44,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:44,718 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:44,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 01:37:44,718 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:44,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:44,719 INFO L85 PathProgramCache]: Analyzing trace with hash -48733051, now seen corresponding path program 1 times [2024-10-13 01:37:44,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:44,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442366174] [2024-10-13 01:37:44,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:44,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:37:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:37:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:37:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:37:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:37:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:37:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:37:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:37:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:37:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:37:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:44,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:37:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:45,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:37:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:45,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:37:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:45,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:37:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:45,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:37:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:45,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:45,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:37:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:45,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:37:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:45,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:37:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:45,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:37:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:45,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:37:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:45,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:37:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:45,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:37:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:45,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-13 01:37:45,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:45,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442366174] [2024-10-13 01:37:45,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442366174] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:37:45,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548292791] [2024-10-13 01:37:45,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:45,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:37:45,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:37:45,040 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-13 01:37:45,044 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-13 01:37:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:45,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 01:37:45,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:37:45,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 503 proven. 90 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2024-10-13 01:37:45,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:37:45,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 42 proven. 93 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-10-13 01:37:45,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548292791] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:37:45,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 01:37:45,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2024-10-13 01:37:45,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914484171] [2024-10-13 01:37:45,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 01:37:45,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 01:37:45,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:45,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 01:37:45,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2024-10-13 01:37:45,878 INFO L87 Difference]: Start difference. First operand 303 states and 450 transitions. Second operand has 16 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 7 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (58), 6 states have call predecessors, (58), 7 states have call successors, (58) [2024-10-13 01:37:46,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:46,105 INFO L93 Difference]: Finished difference Result 602 states and 876 transitions. [2024-10-13 01:37:46,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 01:37:46,106 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 7 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (58), 6 states have call predecessors, (58), 7 states have call successors, (58) Word has length 162 [2024-10-13 01:37:46,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:46,108 INFO L225 Difference]: With dead ends: 602 [2024-10-13 01:37:46,108 INFO L226 Difference]: Without dead ends: 333 [2024-10-13 01:37:46,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=330, Unknown=0, NotChecked=0, Total=506 [2024-10-13 01:37:46,110 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 205 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:46,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 203 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:37:46,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-13 01:37:46,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 327. [2024-10-13 01:37:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 244 states have (on average 1.2991803278688525) internal successors, (317), 248 states have internal predecessors, (317), 70 states have call successors, (70), 12 states have call predecessors, (70), 12 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 01:37:46,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 457 transitions. [2024-10-13 01:37:46,144 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 457 transitions. Word has length 162 [2024-10-13 01:37:46,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:46,145 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 457 transitions. [2024-10-13 01:37:46,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 7 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (58), 6 states have call predecessors, (58), 7 states have call successors, (58) [2024-10-13 01:37:46,145 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 457 transitions. [2024-10-13 01:37:46,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 01:37:46,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:46,146 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:46,160 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-13 01:37:46,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:37:46,348 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:46,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:46,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1971985016, now seen corresponding path program 1 times [2024-10-13 01:37:46,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:46,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331956321] [2024-10-13 01:37:46,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:46,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:47,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:47,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:37:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:47,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:37:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:47,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:37:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:47,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:37:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:47,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:37:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:47,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:37:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:47,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:37:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:47,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:37:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:47,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:37:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:47,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:37:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:47,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:37:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:47,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:37:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:47,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:37:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:47,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:37:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:47,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:37:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:47,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:47,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:37:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:47,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:37:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:47,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:37:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:47,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:37:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:47,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:37:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:47,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:37:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:47,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:37:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:47,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 01:37:47,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:47,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331956321] [2024-10-13 01:37:47,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331956321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:47,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:47,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 01:37:47,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359667424] [2024-10-13 01:37:47,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:47,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 01:37:47,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:47,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 01:37:47,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-13 01:37:47,300 INFO L87 Difference]: Start difference. First operand 327 states and 457 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:37:48,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:48,127 INFO L93 Difference]: Finished difference Result 756 states and 1045 transitions. [2024-10-13 01:37:48,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 01:37:48,127 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 163 [2024-10-13 01:37:48,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:48,129 INFO L225 Difference]: With dead ends: 756 [2024-10-13 01:37:48,129 INFO L226 Difference]: Without dead ends: 471 [2024-10-13 01:37:48,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-10-13 01:37:48,136 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 468 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:48,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 1056 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 01:37:48,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-10-13 01:37:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 457. [2024-10-13 01:37:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 333 states have (on average 1.2702702702702702) internal successors, (423), 339 states have internal predecessors, (423), 101 states have call successors, (101), 22 states have call predecessors, (101), 22 states have return successors, (101), 95 states have call predecessors, (101), 101 states have call successors, (101) [2024-10-13 01:37:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 625 transitions. [2024-10-13 01:37:48,190 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 625 transitions. Word has length 163 [2024-10-13 01:37:48,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:48,191 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 625 transitions. [2024-10-13 01:37:48,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:37:48,191 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 625 transitions. [2024-10-13 01:37:48,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 01:37:48,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:48,192 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:48,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 01:37:48,193 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:48,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:48,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1578958006, now seen corresponding path program 1 times [2024-10-13 01:37:48,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:48,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188493879] [2024-10-13 01:37:48,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:48,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:48,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:48,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:37:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:48,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:37:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:48,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:37:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:48,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:37:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:48,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:37:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:48,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:37:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:48,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:37:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:48,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:37:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:48,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:37:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:48,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:37:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:48,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:37:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:48,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:37:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:48,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:37:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:48,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:37:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:48,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:37:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:48,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:48,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:37:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:48,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:37:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:48,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:37:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:48,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:37:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:48,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:37:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:48,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:37:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:48,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:37:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-13 01:37:48,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:48,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188493879] [2024-10-13 01:37:48,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188493879] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:37:48,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714524075] [2024-10-13 01:37:48,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:48,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:37:48,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:37:48,944 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-13 01:37:48,945 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-13 01:37:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:49,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-13 01:37:49,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:37:49,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 510 proven. 144 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-13 01:37:49,721 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:37:50,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 42 proven. 93 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-10-13 01:37:50,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714524075] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:37:50,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 01:37:50,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 11] total 30 [2024-10-13 01:37:50,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576309971] [2024-10-13 01:37:50,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 01:37:50,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-13 01:37:50,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:50,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-13 01:37:50,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2024-10-13 01:37:50,358 INFO L87 Difference]: Start difference. First operand 457 states and 625 transitions. Second operand has 30 states, 28 states have (on average 4.357142857142857) internal successors, (122), 28 states have internal predecessors, (122), 9 states have call successors, (61), 4 states have call predecessors, (61), 8 states have return successors, (62), 8 states have call predecessors, (62), 9 states have call successors, (62) [2024-10-13 01:37:53,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:53,445 INFO L93 Difference]: Finished difference Result 1079 states and 1416 transitions. [2024-10-13 01:37:53,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-10-13 01:37:53,446 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 4.357142857142857) internal successors, (122), 28 states have internal predecessors, (122), 9 states have call successors, (61), 4 states have call predecessors, (61), 8 states have return successors, (62), 8 states have call predecessors, (62), 9 states have call successors, (62) Word has length 163 [2024-10-13 01:37:53,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:53,449 INFO L225 Difference]: With dead ends: 1079 [2024-10-13 01:37:53,449 INFO L226 Difference]: Without dead ends: 668 [2024-10-13 01:37:53,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2890 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2165, Invalid=7537, Unknown=0, NotChecked=0, Total=9702 [2024-10-13 01:37:53,452 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 1226 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:53,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 653 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 01:37:53,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-10-13 01:37:53,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 301. [2024-10-13 01:37:53,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 214 states have (on average 1.2102803738317758) internal successors, (259), 216 states have internal predecessors, (259), 64 states have call successors, (64), 22 states have call predecessors, (64), 22 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-13 01:37:53,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 387 transitions. [2024-10-13 01:37:53,492 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 387 transitions. Word has length 163 [2024-10-13 01:37:53,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:53,492 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 387 transitions. [2024-10-13 01:37:53,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 4.357142857142857) internal successors, (122), 28 states have internal predecessors, (122), 9 states have call successors, (61), 4 states have call predecessors, (61), 8 states have return successors, (62), 8 states have call predecessors, (62), 9 states have call successors, (62) [2024-10-13 01:37:53,492 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 387 transitions. [2024-10-13 01:37:53,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-13 01:37:53,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:53,494 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:53,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 01:37:53,694 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,SelfDestructingSolverStorable8 [2024-10-13 01:37:53,695 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:53,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:53,695 INFO L85 PathProgramCache]: Analyzing trace with hash 154281984, now seen corresponding path program 1 times [2024-10-13 01:37:53,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:53,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186934938] [2024-10-13 01:37:53,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:53,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:37:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:37:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:37:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:37:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:37:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:37:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:37:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:37:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:37:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:37:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:37:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:37:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:37:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:37:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:37:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:37:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:37:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:37:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:37:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:37:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:37:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:37:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-13 01:37:55,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:55,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186934938] [2024-10-13 01:37:55,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186934938] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:37:55,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198275159] [2024-10-13 01:37:55,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:55,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:37:55,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:37:55,500 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:37:55,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 01:37:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 01:37:55,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:37:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 503 proven. 90 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2024-10-13 01:37:56,164 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:37:58,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198275159] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:37:58,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 01:37:58,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2024-10-13 01:37:58,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625165215] [2024-10-13 01:37:58,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 01:37:58,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 01:37:58,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:58,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 01:37:58,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=403, Unknown=7, NotChecked=0, Total=506 [2024-10-13 01:37:58,572 INFO L87 Difference]: Start difference. First operand 301 states and 387 transitions. Second operand has 18 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 5 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 4 states have call predecessors, (41), 5 states have call successors, (41) [2024-10-13 01:38:00,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:00,290 INFO L93 Difference]: Finished difference Result 619 states and 791 transitions. [2024-10-13 01:38:00,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-13 01:38:00,291 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 5 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 4 states have call predecessors, (41), 5 states have call successors, (41) Word has length 164 [2024-10-13 01:38:00,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:00,292 INFO L225 Difference]: With dead ends: 619 [2024-10-13 01:38:00,293 INFO L226 Difference]: Without dead ends: 319 [2024-10-13 01:38:00,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=493, Invalid=1756, Unknown=7, NotChecked=0, Total=2256 [2024-10-13 01:38:00,294 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 342 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:00,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 423 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 01:38:00,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-13 01:38:00,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 301. [2024-10-13 01:38:00,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 214 states have (on average 1.1962616822429906) internal successors, (256), 216 states have internal predecessors, (256), 64 states have call successors, (64), 22 states have call predecessors, (64), 22 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-13 01:38:00,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 384 transitions. [2024-10-13 01:38:00,342 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 384 transitions. Word has length 164 [2024-10-13 01:38:00,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:00,342 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 384 transitions. [2024-10-13 01:38:00,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 5 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 4 states have call predecessors, (41), 5 states have call successors, (41) [2024-10-13 01:38:00,342 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 384 transitions. [2024-10-13 01:38:00,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-13 01:38:00,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:00,343 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:00,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 01:38:00,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:38:00,545 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:00,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:00,546 INFO L85 PathProgramCache]: Analyzing trace with hash -64572734, now seen corresponding path program 1 times [2024-10-13 01:38:00,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:00,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138471404] [2024-10-13 01:38:00,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:00,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:00,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:00,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:00,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:00,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:00,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:00,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:38:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:00,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:38:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:00,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:38:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:00,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:38:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:00,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:38:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:00,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:38:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:00,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:38:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:00,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:38:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:01,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:38:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:01,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:38:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:01,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:38:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:01,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:38:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:01,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:38:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:01,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:38:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:01,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:38:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:01,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:38:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:01,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:38:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:01,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:38:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:01,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:38:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:01,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 81 proven. 51 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-10-13 01:38:01,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:01,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138471404] [2024-10-13 01:38:01,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138471404] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:38:01,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479656257] [2024-10-13 01:38:01,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:01,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:38:01,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:38:01,049 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:38:01,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 01:38:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:01,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 01:38:01,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:38:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 615 proven. 51 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2024-10-13 01:38:01,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:38:01,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 81 proven. 54 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-10-13 01:38:01,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479656257] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:38:01,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 01:38:01,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 17 [2024-10-13 01:38:01,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982488086] [2024-10-13 01:38:01,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 01:38:01,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 01:38:01,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:01,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 01:38:01,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-10-13 01:38:01,683 INFO L87 Difference]: Start difference. First operand 301 states and 384 transitions. Second operand has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 17 states have internal predecessors, (98), 3 states have call successors, (34), 3 states have call predecessors, (34), 7 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2024-10-13 01:38:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:02,055 INFO L93 Difference]: Finished difference Result 642 states and 802 transitions. [2024-10-13 01:38:02,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 01:38:02,056 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 17 states have internal predecessors, (98), 3 states have call successors, (34), 3 states have call predecessors, (34), 7 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) Word has length 164 [2024-10-13 01:38:02,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:02,059 INFO L225 Difference]: With dead ends: 642 [2024-10-13 01:38:02,059 INFO L226 Difference]: Without dead ends: 342 [2024-10-13 01:38:02,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 368 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=251, Invalid=619, Unknown=0, NotChecked=0, Total=870 [2024-10-13 01:38:02,061 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 98 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:02,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 399 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:38:02,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-13 01:38:02,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 308. [2024-10-13 01:38:02,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 221 states have (on average 1.16289592760181) internal successors, (257), 223 states have internal predecessors, (257), 60 states have call successors, (60), 26 states have call predecessors, (60), 26 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 01:38:02,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 377 transitions. [2024-10-13 01:38:02,113 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 377 transitions. Word has length 164 [2024-10-13 01:38:02,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:02,114 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 377 transitions. [2024-10-13 01:38:02,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 17 states have internal predecessors, (98), 3 states have call successors, (34), 3 states have call predecessors, (34), 7 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2024-10-13 01:38:02,114 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 377 transitions. [2024-10-13 01:38:02,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-13 01:38:02,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:02,115 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:02,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 01:38:02,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:38:02,316 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:02,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:02,317 INFO L85 PathProgramCache]: Analyzing trace with hash -638180180, now seen corresponding path program 1 times [2024-10-13 01:38:02,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:02,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652316460] [2024-10-13 01:38:02,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:02,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:38:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:38:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:38:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:38:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:38:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:38:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:38:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:38:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:38:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:38:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:38:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:38:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:38:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:38:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:38:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:38:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:38:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:38:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:38:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 01:38:02,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:02,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652316460] [2024-10-13 01:38:02,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652316460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:02,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:02,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:38:02,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411998862] [2024-10-13 01:38:02,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:02,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:38:02,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:02,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:38:02,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:38:02,434 INFO L87 Difference]: Start difference. First operand 308 states and 377 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:38:02,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:02,498 INFO L93 Difference]: Finished difference Result 621 states and 762 transitions. [2024-10-13 01:38:02,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:38:02,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2024-10-13 01:38:02,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:02,500 INFO L225 Difference]: With dead ends: 621 [2024-10-13 01:38:02,500 INFO L226 Difference]: Without dead ends: 314 [2024-10-13 01:38:02,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:38:02,501 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:02,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 334 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:38:02,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-10-13 01:38:02,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2024-10-13 01:38:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 227 states have (on average 1.158590308370044) internal successors, (263), 229 states have internal predecessors, (263), 60 states have call successors, (60), 26 states have call predecessors, (60), 26 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 01:38:02,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 383 transitions. [2024-10-13 01:38:02,549 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 383 transitions. Word has length 165 [2024-10-13 01:38:02,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:02,549 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 383 transitions. [2024-10-13 01:38:02,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:38:02,549 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 383 transitions. [2024-10-13 01:38:02,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 01:38:02,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:02,550 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:02,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 01:38:02,551 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:02,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:02,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1681460374, now seen corresponding path program 1 times [2024-10-13 01:38:02,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:02,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702764146] [2024-10-13 01:38:02,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:02,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:38:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:38:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:38:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:38:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:38:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:38:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:38:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:38:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:38:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:38:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:38:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:38:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:38:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:38:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:38:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:38:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:38:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:38:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:38:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:02,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 01:38:02,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:02,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702764146] [2024-10-13 01:38:02,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702764146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:02,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:02,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 01:38:02,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729221332] [2024-10-13 01:38:02,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:02,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 01:38:02,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:02,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 01:38:02,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 01:38:02,902 INFO L87 Difference]: Start difference. First operand 314 states and 383 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:38:03,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:03,486 INFO L93 Difference]: Finished difference Result 931 states and 1116 transitions. [2024-10-13 01:38:03,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 01:38:03,487 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 166 [2024-10-13 01:38:03,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:03,493 INFO L225 Difference]: With dead ends: 931 [2024-10-13 01:38:03,493 INFO L226 Difference]: Without dead ends: 618 [2024-10-13 01:38:03,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-13 01:38:03,494 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 390 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:03,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 503 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 01:38:03,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-10-13 01:38:03,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 329. [2024-10-13 01:38:03,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 242 states have (on average 1.1735537190082646) internal successors, (284), 244 states have internal predecessors, (284), 60 states have call successors, (60), 26 states have call predecessors, (60), 26 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 01:38:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 404 transitions. [2024-10-13 01:38:03,567 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 404 transitions. Word has length 166 [2024-10-13 01:38:03,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:03,567 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 404 transitions. [2024-10-13 01:38:03,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:38:03,568 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 404 transitions. [2024-10-13 01:38:03,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 01:38:03,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:03,570 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:03,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 01:38:03,570 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:03,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:03,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1798816232, now seen corresponding path program 1 times [2024-10-13 01:38:03,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:03,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022373067] [2024-10-13 01:38:03,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:03,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:03,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:03,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:03,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:03,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:03,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:03,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:38:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:03,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:38:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:03,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:38:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:03,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:38:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:03,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:38:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:03,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:38:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:03,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:38:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:03,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:38:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:03,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:38:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:03,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:38:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:03,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:38:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:03,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:38:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:03,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:38:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:03,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:38:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:03,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:38:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:03,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:38:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:03,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:38:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:03,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:38:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:03,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:38:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:03,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 01:38:03,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:03,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022373067] [2024-10-13 01:38:03,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022373067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:03,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:03,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:38:03,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441667850] [2024-10-13 01:38:03,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:03,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:38:03,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:03,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:38:03,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:38:03,737 INFO L87 Difference]: Start difference. First operand 329 states and 404 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:38:03,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:03,860 INFO L93 Difference]: Finished difference Result 697 states and 857 transitions. [2024-10-13 01:38:03,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 01:38:03,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 166 [2024-10-13 01:38:03,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:03,862 INFO L225 Difference]: With dead ends: 697 [2024-10-13 01:38:03,862 INFO L226 Difference]: Without dead ends: 369 [2024-10-13 01:38:03,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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-13 01:38:03,863 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 165 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:03,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 495 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:38:03,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-13 01:38:03,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 263. [2024-10-13 01:38:03,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 195 states have (on average 1.1692307692307693) internal successors, (228), 196 states have internal predecessors, (228), 48 states have call successors, (48), 19 states have call predecessors, (48), 19 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 01:38:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 324 transitions. [2024-10-13 01:38:03,905 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 324 transitions. Word has length 166 [2024-10-13 01:38:03,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:03,905 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 324 transitions. [2024-10-13 01:38:03,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:38:03,905 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 324 transitions. [2024-10-13 01:38:03,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 01:38:03,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:03,907 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:03,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 01:38:03,907 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:03,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:03,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1736776618, now seen corresponding path program 1 times [2024-10-13 01:38:03,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:03,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67362953] [2024-10-13 01:38:03,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:03,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:38:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:38:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:38:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:38:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:38:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:38:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:38:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:38:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:38:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:38:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:38:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:38:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:38:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:38:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:38:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:38:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:38:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:38:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:38:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:10,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 01:38:10,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:10,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67362953] [2024-10-13 01:38:10,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67362953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:10,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:10,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-13 01:38:10,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817521770] [2024-10-13 01:38:10,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:10,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 01:38:10,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:10,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 01:38:10,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-10-13 01:38:10,594 INFO L87 Difference]: Start difference. First operand 263 states and 324 transitions. Second operand has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:38:14,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:14,839 INFO L93 Difference]: Finished difference Result 335 states and 411 transitions. [2024-10-13 01:38:14,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 01:38:14,840 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 166 [2024-10-13 01:38:14,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:14,842 INFO L225 Difference]: With dead ends: 335 [2024-10-13 01:38:14,842 INFO L226 Difference]: Without dead ends: 333 [2024-10-13 01:38:14,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2024-10-13 01:38:14,842 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 367 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:14,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 998 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 01:38:14,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-13 01:38:14,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 284. [2024-10-13 01:38:14,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 216 states have (on average 1.1851851851851851) internal successors, (256), 217 states have internal predecessors, (256), 48 states have call successors, (48), 19 states have call predecessors, (48), 19 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 01:38:14,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 352 transitions. [2024-10-13 01:38:14,912 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 352 transitions. Word has length 166 [2024-10-13 01:38:14,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:14,913 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 352 transitions. [2024-10-13 01:38:14,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:38:14,913 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 352 transitions. [2024-10-13 01:38:14,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 01:38:14,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:14,914 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:14,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 01:38:14,914 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:14,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:14,914 INFO L85 PathProgramCache]: Analyzing trace with hash 257368088, now seen corresponding path program 1 times [2024-10-13 01:38:14,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:14,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555481970] [2024-10-13 01:38:14,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:14,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:19,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:19,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:19,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:19,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:19,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:19,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:38:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:19,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:38:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:19,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:38:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:19,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:38:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:19,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:38:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:19,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:38:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:19,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:38:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:19,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:38:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:19,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:38:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:19,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:38:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:19,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:38:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:19,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:38:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:19,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:38:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:19,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:38:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:19,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:38:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:19,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:38:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:19,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:38:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:19,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:38:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:19,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:38:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:19,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 01:38:19,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:19,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555481970] [2024-10-13 01:38:19,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555481970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:19,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:19,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-13 01:38:19,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691736569] [2024-10-13 01:38:19,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:19,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 01:38:19,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:19,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 01:38:19,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-10-13 01:38:19,435 INFO L87 Difference]: Start difference. First operand 284 states and 352 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:38:26,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:26,289 INFO L93 Difference]: Finished difference Result 579 states and 711 transitions. [2024-10-13 01:38:26,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 01:38:26,289 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 166 [2024-10-13 01:38:26,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:26,292 INFO L225 Difference]: With dead ends: 579 [2024-10-13 01:38:26,292 INFO L226 Difference]: Without dead ends: 577 [2024-10-13 01:38:26,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=321, Invalid=735, Unknown=0, NotChecked=0, Total=1056 [2024-10-13 01:38:26,293 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 565 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:26,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 903 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 01:38:26,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-10-13 01:38:26,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 498. [2024-10-13 01:38:26,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 363 states have (on average 1.162534435261708) internal successors, (422), 365 states have internal predecessors, (422), 96 states have call successors, (96), 38 states have call predecessors, (96), 38 states have return successors, (96), 94 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-13 01:38:26,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 614 transitions. [2024-10-13 01:38:26,395 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 614 transitions. Word has length 166 [2024-10-13 01:38:26,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:26,395 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 614 transitions. [2024-10-13 01:38:26,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:38:26,396 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 614 transitions. [2024-10-13 01:38:26,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-13 01:38:26,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:26,396 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:26,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 01:38:26,397 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:26,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:26,397 INFO L85 PathProgramCache]: Analyzing trace with hash 901582083, now seen corresponding path program 1 times [2024-10-13 01:38:26,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:26,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760476209] [2024-10-13 01:38:26,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:26,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:38:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:38:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:38:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:38:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:38:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:38:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:38:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:38:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:38:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:38:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:38:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:38:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:38:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:38:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:38:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:38:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:38:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:38:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:38:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 01:38:26,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:26,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760476209] [2024-10-13 01:38:26,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760476209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:26,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:26,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 01:38:26,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438258379] [2024-10-13 01:38:26,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:26,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 01:38:26,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:26,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 01:38:26,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 01:38:26,687 INFO L87 Difference]: Start difference. First operand 498 states and 614 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:38:27,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:27,476 INFO L93 Difference]: Finished difference Result 982 states and 1191 transitions. [2024-10-13 01:38:27,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 01:38:27,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 167 [2024-10-13 01:38:27,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:27,480 INFO L225 Difference]: With dead ends: 982 [2024-10-13 01:38:27,480 INFO L226 Difference]: Without dead ends: 699 [2024-10-13 01:38:27,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-13 01:38:27,481 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 279 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:27,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 555 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 01:38:27,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-10-13 01:38:27,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 492. [2024-10-13 01:38:27,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 367 states have (on average 1.1634877384196185) internal successors, (427), 369 states have internal predecessors, (427), 84 states have call successors, (84), 40 states have call predecessors, (84), 40 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 01:38:27,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 595 transitions. [2024-10-13 01:38:27,586 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 595 transitions. Word has length 167 [2024-10-13 01:38:27,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:27,587 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 595 transitions. [2024-10-13 01:38:27,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:38:27,587 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 595 transitions. [2024-10-13 01:38:27,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-13 01:38:27,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:27,588 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:27,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 01:38:27,588 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:27,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:27,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1226374089, now seen corresponding path program 1 times [2024-10-13 01:38:27,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:27,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339463040] [2024-10-13 01:38:27,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:27,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 01:38:27,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [571779132] [2024-10-13 01:38:27,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:27,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:38:27,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:38:27,640 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:38:27,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 01:38:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:38:27,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 01:38:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:38:28,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 01:38:28,002 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 01:38:28,003 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 01:38:28,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 01:38:28,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-13 01:38:28,208 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:28,297 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 01:38:28,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:38:28 BoogieIcfgContainer [2024-10-13 01:38:28,301 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 01:38:28,302 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 01:38:28,302 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 01:38:28,302 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 01:38:28,302 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:37:40" (3/4) ... [2024-10-13 01:38:28,304 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 01:38:28,305 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 01:38:28,306 INFO L158 Benchmark]: Toolchain (without parser) took 48764.47ms. Allocated memory was 167.8MB in the beginning and 778.0MB in the end (delta: 610.3MB). Free memory was 95.2MB in the beginning and 544.7MB in the end (delta: -449.4MB). Peak memory consumption was 163.2MB. Max. memory is 16.1GB. [2024-10-13 01:38:28,307 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:38:28,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.84ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 135.6MB in the end (delta: -40.5MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2024-10-13 01:38:28,307 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.79ms. Allocated memory is still 167.8MB. Free memory was 135.6MB in the beginning and 130.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 01:38:28,308 INFO L158 Benchmark]: Boogie Preprocessor took 98.77ms. Allocated memory is still 167.8MB. Free memory was 130.5MB in the beginning and 123.1MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 01:38:28,308 INFO L158 Benchmark]: RCFGBuilder took 564.96ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 91.7MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-13 01:38:28,308 INFO L158 Benchmark]: TraceAbstraction took 47597.65ms. Allocated memory was 167.8MB in the beginning and 778.0MB in the end (delta: 610.3MB). Free memory was 90.6MB in the beginning and 544.7MB in the end (delta: -454.0MB). Peak memory consumption was 157.3MB. Max. memory is 16.1GB. [2024-10-13 01:38:28,308 INFO L158 Benchmark]: Witness Printer took 3.93ms. Allocated memory is still 778.0MB. Free memory is still 544.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:38:28,310 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 167.8MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.84ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 135.6MB in the end (delta: -40.5MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.79ms. Allocated memory is still 167.8MB. Free memory was 135.6MB in the beginning and 130.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.77ms. Allocated memory is still 167.8MB. Free memory was 130.5MB in the beginning and 123.1MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 564.96ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 91.7MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 47597.65ms. Allocated memory was 167.8MB in the beginning and 778.0MB in the end (delta: 610.3MB). Free memory was 90.6MB in the beginning and 544.7MB in the end (delta: -454.0MB). Peak memory consumption was 157.3MB. Max. memory is 16.1GB. * Witness Printer took 3.93ms. Allocated memory is still 778.0MB. Free memory is still 544.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of bitwiseAnd at line 117, overapproximation of someUnaryDOUBLEoperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryArithmeticFLOAToperation at line 57, overapproximation of someUnaryFLOAToperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_7 = 0; [L24] unsigned char var_1_8 = 1; [L25] signed short int var_1_9 = -2; [L26] float var_1_13 = 999.4; [L27] float var_1_14 = 100.425; [L28] float var_1_15 = 3.375; [L29] float var_1_16 = 15.9; [L30] signed short int var_1_17 = -10; [L31] signed short int var_1_18 = 18060; [L32] unsigned char var_1_20 = 0; [L33] unsigned long int var_1_21 = 4; [L34] unsigned char var_1_23 = 0; [L35] unsigned char var_1_24 = 0; [L36] unsigned char var_1_25 = 100; [L37] unsigned char var_1_26 = 32; [L38] unsigned char var_1_27 = 10; [L39] unsigned char var_1_28 = 1; [L40] unsigned short int var_1_29 = 256; [L41] unsigned char var_1_30 = 1; [L42] unsigned char var_1_31 = 4; [L43] double var_1_33 = 31.625; [L44] double var_1_36 = 15.75; [L45] double var_1_37 = 15.375; [L46] unsigned short int var_1_38 = 16; [L47] unsigned char var_1_39 = 0; [L48] double var_1_44 = 128.5; [L49] float var_1_45 = 1.85; [L50] double var_1_46 = 1.5; [L51] double var_1_47 = 99999999999.4; [L52] unsigned char var_1_49 = 128; [L173] isInitial = 1 [L174] FCALL initially() [L175] COND TRUE 1 [L176] FCALL updateLastVariables() [L177] CALL updateVariables() [L126] var_1_7 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L127] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L128] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L128] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L129] var_1_8 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L130] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L131] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L131] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L132] var_1_14 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L133] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L134] var_1_15 = __VERIFIER_nondet_float() [L135] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L135] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L136] var_1_16 = __VERIFIER_nondet_float() [L137] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L137] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L138] var_1_18 = __VERIFIER_nondet_short() [L139] CALL assume_abort_if_not(var_1_18 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L139] RET assume_abort_if_not(var_1_18 >= 16382) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L140] CALL assume_abort_if_not(var_1_18 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L140] RET assume_abort_if_not(var_1_18 <= 32766) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L141] var_1_21 = __VERIFIER_nondet_ulong() [L142] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L142] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L143] CALL assume_abort_if_not(var_1_21 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L143] RET assume_abort_if_not(var_1_21 <= 4294967295) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L144] CALL assume_abort_if_not(var_1_21 != 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L144] RET assume_abort_if_not(var_1_21 != 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L145] var_1_23 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L146] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L147] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L147] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L148] var_1_24 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L149] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L150] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L150] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L151] var_1_26 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L152] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L153] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L153] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L154] var_1_27 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L155] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L156] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L156] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L157] var_1_36 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L158] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L159] var_1_37 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L160] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L161] var_1_46 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_46 >= 0.0F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 9223372.036854776000e+12F && var_1_46 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L162] RET assume_abort_if_not((var_1_46 >= 0.0F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 9223372.036854776000e+12F && var_1_46 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L163] var_1_47 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_47 >= 0.0F && var_1_47 <= -1.0e-20F) || (var_1_47 <= 9223372.036854776000e+12F && var_1_47 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L164] RET assume_abort_if_not((var_1_47 >= 0.0F && var_1_47 <= -1.0e-20F) || (var_1_47 <= 9223372.036854776000e+12F && var_1_47 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L177] RET updateVariables() [L178] CALL step() [L56] COND TRUE \read(var_1_8) [L57] var_1_13 = (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L59] COND TRUE \read(var_1_8) [L60] var_1_25 = (var_1_26 + var_1_27) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L62] var_1_29 = var_1_27 [L63] var_1_30 = var_1_8 VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L64] COND FALSE !((var_1_29 > var_1_25) && var_1_30) [L67] var_1_9 = ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L69] var_1_17 = ((var_1_18 - 25) - var_1_25) [L70] signed long int stepLocal_2 = var_1_25 + var_1_17; VAL [isInitial=1, stepLocal_2=32741, var_1_13=2, var_1_16=0, var_1_17=32614, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L71] COND TRUE ((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < stepLocal_2 [L72] var_1_20 = (var_1_23 || var_1_24) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=32614, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L76] signed short int stepLocal_3 = var_1_9; VAL [isInitial=1, stepLocal_3=127, var_1_13=2, var_1_16=0, var_1_17=32614, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L77] COND FALSE !((~ var_1_29) > stepLocal_3) [L80] var_1_28 = (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=32614, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L82] signed long int stepLocal_1 = (((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25)); [L83] unsigned char stepLocal_0 = var_1_25; VAL [isInitial=1, stepLocal_0=127, stepLocal_1=127, var_1_13=2, var_1_16=0, var_1_17=32614, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L84] COND FALSE !(stepLocal_1 <= (var_1_25 - var_1_25)) [L93] var_1_1 = 0 VAL [isInitial=1, stepLocal_0=127, var_1_13=2, var_1_16=0, var_1_17=32614, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L95] var_1_31 = var_1_26 VAL [isInitial=1, stepLocal_0=127, var_1_13=2, var_1_16=0, var_1_17=32614, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L96] COND FALSE !(! var_1_7) VAL [isInitial=1, stepLocal_0=127, var_1_13=2, var_1_16=0, var_1_17=32614, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L99] var_1_38 = ((((var_1_27) > (var_1_27)) ? (var_1_27) : (var_1_27))) VAL [isInitial=1, stepLocal_0=127, var_1_13=2, var_1_16=0, var_1_17=32614, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_38=127, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L100] EXPR var_1_18 & (var_1_29 + 2u) VAL [isInitial=1, stepLocal_0=127, var_1_13=2, var_1_16=0, var_1_17=32614, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_38=127, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L100] EXPR 16u >> var_1_26 VAL [isInitial=1, stepLocal_0=127, var_1_13=2, var_1_16=0, var_1_17=32614, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_38=127, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L100] COND TRUE (var_1_18 & (var_1_29 + 2u)) < (16u >> var_1_26) [L101] var_1_39 = ((var_1_7 && (var_1_7 && var_1_8)) && (! var_1_23)) VAL [isInitial=1, stepLocal_0=127, var_1_13=2, var_1_16=0, var_1_17=32614, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_38=127, var_1_39=1, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L103] COND FALSE !(var_1_36 <= var_1_16) [L108] var_1_44 = var_1_36 VAL [isInitial=1, stepLocal_0=127, var_1_13=2, var_1_16=0, var_1_17=32614, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=3, var_1_38=127, var_1_39=1, var_1_44=3, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L110] COND FALSE !((var_1_14 * (var_1_46 - var_1_47)) < var_1_14) [L115] var_1_45 = (((((((((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) < (var_1_37)) ? (((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) : (var_1_37))) < 0 ) ? -((((((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) < (var_1_37)) ? (((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) : (var_1_37))) : ((((((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) < (var_1_37)) ? (((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) : (var_1_37))))) VAL [isInitial=1, stepLocal_0=127, var_1_13=2, var_1_14=0, var_1_16=0, var_1_17=32614, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=3, var_1_37=0, var_1_38=127, var_1_39=1, var_1_44=3, var_1_45=4, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L117] var_1_20 || (var_1_26 >= (var_1_18 & var_1_27)) VAL [isInitial=1, stepLocal_0=127, var_1_13=2, var_1_14=0, var_1_16=0, var_1_17=32614, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=3, var_1_37=0, var_1_38=127, var_1_39=1, var_1_44=3, var_1_45=4, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L117] EXPR var_1_18 & var_1_27 VAL [isInitial=1, stepLocal_0=127, var_1_13=2, var_1_14=0, var_1_16=0, var_1_17=32614, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=3, var_1_37=0, var_1_38=127, var_1_39=1, var_1_44=3, var_1_45=4, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L117] var_1_20 || (var_1_26 >= (var_1_18 & var_1_27)) VAL [isInitial=1, stepLocal_0=127, var_1_13=2, var_1_14=0, var_1_16=0, var_1_17=32614, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=3, var_1_37=0, var_1_38=127, var_1_39=1, var_1_44=3, var_1_45=4, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L117] COND FALSE !(var_1_20 || (var_1_26 >= (var_1_18 & var_1_27))) [L178] RET step() [L179] CALL, EXPR property() [L169-L170] return (((((((((((((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25))) <= (var_1_25 - var_1_25)) ? ((var_1_25 < var_1_25) ? (var_1_20 ? (var_1_1 == ((unsigned char) var_1_7)) : (var_1_1 == ((unsigned char) var_1_8))) : 1) : (var_1_1 == ((unsigned char) 0))) && (((var_1_29 > var_1_25) && var_1_30) ? (var_1_9 == ((signed short int) var_1_25)) : (var_1_9 == ((signed short int) ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))))))) && (var_1_8 ? (var_1_13 == ((float) (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))))) : 1)) && (var_1_17 == ((signed short int) ((var_1_18 - 25) - var_1_25)))) && ((((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < (var_1_25 + var_1_17)) ? (var_1_20 == ((unsigned char) (var_1_23 || var_1_24))) : (var_1_20 == ((unsigned char) var_1_7)))) && (var_1_8 ? (var_1_25 == ((unsigned char) (var_1_26 + var_1_27))) : 1)) && (((~ var_1_29) > var_1_9) ? (var_1_28 == ((unsigned char) (! var_1_7))) : (var_1_28 == ((unsigned char) (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))))))) && (var_1_29 == ((unsigned short int) var_1_27))) && (var_1_30 == ((unsigned char) var_1_8)) ; [L179] RET, EXPR property() [L179] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_16=0, var_1_17=32614, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=3, var_1_37=0, var_1_38=127, var_1_39=1, var_1_44=3, var_1_45=4, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L19] reach_error() VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_16=0, var_1_17=32614, var_1_18=32766, var_1_1=0, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=3, var_1_37=0, var_1_38=127, var_1_39=1, var_1_44=3, var_1_45=4, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.4s, OverallIterations: 18, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4822 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4794 mSDsluCounter, 8288 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5905 mSDsCounter, 958 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5744 IncrementalHoareTripleChecker+Invalid, 6702 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 958 mSolverCounterUnsat, 2383 mSDtfsCounter, 5744 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2342 GetRequests, 2040 SyntacticMatches, 2 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3925 ImplicationChecksByTransitivity, 16.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=498occurred in iteration=16, InterpolantAutomatonStates: 236, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 1442 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 23.1s InterpolantComputationTime, 3769 NumberOfCodeBlocks, 3769 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3900 ConstructedInterpolants, 0 QuantifiedInterpolants, 21900 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1535 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 24 InterpolantComputations, 13 PerfectInterpolantSequences, 25686/26496 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-13 01:38:28,534 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-10-13 01:38:28,564 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 137 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_fillercode_fillercodestructure_filler-pe-ci_file-50.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 dc7b01a2a7c989275ee332c4df25904527cd5d9a922607559c6a4e85b8c49683 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:38:30,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:38:30,599 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 01:38:30,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:38:30,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:38:30,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:38:30,634 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:38:30,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:38:30,635 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:38:30,636 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:38:30,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:38:30,637 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:38:30,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:38:30,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:38:30,639 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:38:30,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:38:30,639 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:38:30,639 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:38:30,640 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:38:30,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:38:30,640 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:38:30,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:38:30,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:38:30,641 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 01:38:30,641 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 01:38:30,641 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:38:30,642 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 01:38:30,642 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:38:30,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:38:30,642 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:38:30,642 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:38:30,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:38:30,643 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:38:30,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:38:30,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:38:30,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:38:30,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:38:30,644 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:38:30,644 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 01:38:30,644 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 01:38:30,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:38:30,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:38:30,645 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:38:30,645 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:38:30,645 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 01:38:30,645 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 -> dc7b01a2a7c989275ee332c4df25904527cd5d9a922607559c6a4e85b8c49683 [2024-10-13 01:38:30,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:38:30,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:38:30,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:38:30,937 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:38:30,937 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:38:30,938 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-50.i [2024-10-13 01:38:32,436 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:38:32,586 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:38:32,587 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-50.i [2024-10-13 01:38:32,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8f55e59c/7d6821683692451daea9b140f2a96cbc/FLAG26670ba24 [2024-10-13 01:38:32,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8f55e59c/7d6821683692451daea9b140f2a96cbc [2024-10-13 01:38:32,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:38:32,611 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:38:32,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:38:32,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:38:32,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:38:32,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:38:32" (1/1) ... [2024-10-13 01:38:32,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19acc981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:32, skipping insertion in model container [2024-10-13 01:38:32,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:38:32" (1/1) ... [2024-10-13 01:38:32,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:38:32,780 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_fillercode_fillercodestructure_filler-pe-ci_file-50.i[919,932] [2024-10-13 01:38:32,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:38:32,870 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:38:32,881 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_fillercode_fillercodestructure_filler-pe-ci_file-50.i[919,932] [2024-10-13 01:38:32,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:38:32,980 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:38:32,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:32 WrapperNode [2024-10-13 01:38:32,980 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:38:32,981 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:38:32,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:38:32,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:38:32,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:32" (1/1) ... [2024-10-13 01:38:33,013 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:32" (1/1) ... [2024-10-13 01:38:33,052 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2024-10-13 01:38:33,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:38:33,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:38:33,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:38:33,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:38:33,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:32" (1/1) ... [2024-10-13 01:38:33,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:32" (1/1) ... [2024-10-13 01:38:33,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:32" (1/1) ... [2024-10-13 01:38:33,096 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-13 01:38:33,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:32" (1/1) ... [2024-10-13 01:38:33,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:32" (1/1) ... [2024-10-13 01:38:33,109 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:32" (1/1) ... [2024-10-13 01:38:33,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:32" (1/1) ... [2024-10-13 01:38:33,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:32" (1/1) ... [2024-10-13 01:38:33,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:32" (1/1) ... [2024-10-13 01:38:33,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:38:33,132 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:38:33,132 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:38:33,132 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:38:33,133 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:32" (1/1) ... [2024-10-13 01:38:33,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:38:33,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:38:33,166 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-13 01:38:33,171 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-13 01:38:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:38:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 01:38:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:38:33,210 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:38:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:38:33,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:38:33,278 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:38:33,280 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:38:43,963 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 01:38:43,963 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:38:44,045 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:38:44,046 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:38:44,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:38:44 BoogieIcfgContainer [2024-10-13 01:38:44,046 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:38:44,048 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:38:44,048 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:38:44,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:38:44,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:38:32" (1/3) ... [2024-10-13 01:38:44,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d3ab2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:38:44, skipping insertion in model container [2024-10-13 01:38:44,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:32" (2/3) ... [2024-10-13 01:38:44,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d3ab2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:38:44, skipping insertion in model container [2024-10-13 01:38:44,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:38:44" (3/3) ... [2024-10-13 01:38:44,055 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-50.i [2024-10-13 01:38:44,069 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:38:44,070 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:38:44,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:38:44,140 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;@395460b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:38:44,140 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:38:44,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 01:38:44,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 01:38:44,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:44,161 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:44,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:44,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:44,167 INFO L85 PathProgramCache]: Analyzing trace with hash 943222629, now seen corresponding path program 1 times [2024-10-13 01:38:44,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:38:44,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443148654] [2024-10-13 01:38:44,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:44,182 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-13 01:38:44,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:38:44,188 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-13 01:38:44,198 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-13 01:38:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:44,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 01:38:44,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:38:44,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-10-13 01:38:44,840 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:38:44,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:38:44,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443148654] [2024-10-13 01:38:44,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443148654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:44,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:44,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:38:44,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089403858] [2024-10-13 01:38:44,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:44,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:38:44,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:38:44,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:38:44,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:38:44,877 INFO L87 Difference]: Start difference. First operand has 74 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 01:38:45,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:45,103 INFO L93 Difference]: Finished difference Result 145 states and 254 transitions. [2024-10-13 01:38:45,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:38:45,114 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2024-10-13 01:38:45,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:45,120 INFO L225 Difference]: With dead ends: 145 [2024-10-13 01:38:45,120 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 01:38:45,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 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-13 01:38:45,126 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 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.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:45,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:38:45,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 01:38:45,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-13 01:38:45,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 01:38:45,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 110 transitions. [2024-10-13 01:38:45,165 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 110 transitions. Word has length 157 [2024-10-13 01:38:45,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:45,165 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 110 transitions. [2024-10-13 01:38:45,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 01:38:45,166 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 110 transitions. [2024-10-13 01:38:45,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 01:38:45,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:45,169 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:45,188 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-13 01:38:45,370 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-13 01:38:45,370 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:45,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:45,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1013280479, now seen corresponding path program 1 times [2024-10-13 01:38:45,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:38:45,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659042813] [2024-10-13 01:38:45,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:45,373 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-13 01:38:45,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:38:45,376 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-13 01:38:45,377 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-13 01:38:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:45,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 01:38:45,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:38:46,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 01:38:46,088 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:38:46,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:38:46,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659042813] [2024-10-13 01:38:46,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659042813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:46,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:46,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:38:46,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712629129] [2024-10-13 01:38:46,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:46,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:38:46,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:38:46,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:38:46,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:38:46,094 INFO L87 Difference]: Start difference. First operand 72 states and 110 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:38:46,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:46,506 INFO L93 Difference]: Finished difference Result 191 states and 293 transitions. [2024-10-13 01:38:46,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:38:46,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-10-13 01:38:46,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:46,509 INFO L225 Difference]: With dead ends: 191 [2024-10-13 01:38:46,509 INFO L226 Difference]: Without dead ends: 120 [2024-10-13 01:38:46,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:38:46,510 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 104 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:46,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 421 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 01:38:46,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-13 01:38:46,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 72. [2024-10-13 01:38:46,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 01:38:46,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 109 transitions. [2024-10-13 01:38:46,521 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 109 transitions. Word has length 157 [2024-10-13 01:38:46,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:46,523 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 109 transitions. [2024-10-13 01:38:46,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 01:38:46,523 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 109 transitions. [2024-10-13 01:38:46,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 01:38:46,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:46,530 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:46,550 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 (3)] Ended with exit code 0 [2024-10-13 01:38:46,731 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-13 01:38:46,731 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:46,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:46,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1600086493, now seen corresponding path program 1 times [2024-10-13 01:38:46,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:38:46,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024708068] [2024-10-13 01:38:46,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:46,733 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-13 01:38:46,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:38:46,735 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-13 01:38:46,736 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-13 01:38:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:47,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 01:38:47,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:38:50,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 48 proven. 132 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 01:38:50,879 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:38:52,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-13 01:38:52,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:38:52,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024708068] [2024-10-13 01:38:52,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024708068] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:38:52,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 01:38:52,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-10-13 01:38:52,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813188925] [2024-10-13 01:38:52,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 01:38:52,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 01:38:52,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:38:52,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 01:38:52,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-13 01:38:52,011 INFO L87 Difference]: Start difference. First operand 72 states and 109 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 3 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (48), 2 states have call predecessors, (48), 3 states have call successors, (48) [2024-10-13 01:38:57,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:57,508 INFO L93 Difference]: Finished difference Result 310 states and 449 transitions. [2024-10-13 01:38:57,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-13 01:38:57,509 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 3 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (48), 2 states have call predecessors, (48), 3 states have call successors, (48) Word has length 157 [2024-10-13 01:38:57,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:57,512 INFO L225 Difference]: With dead ends: 310 [2024-10-13 01:38:57,512 INFO L226 Difference]: Without dead ends: 239 [2024-10-13 01:38:57,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 305 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=296, Invalid=760, Unknown=0, NotChecked=0, Total=1056 [2024-10-13 01:38:57,514 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 321 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:57,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 653 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-13 01:38:57,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-13 01:38:57,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 95. [2024-10-13 01:38:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 01:38:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 136 transitions. [2024-10-13 01:38:57,531 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 136 transitions. Word has length 157 [2024-10-13 01:38:57,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:57,535 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 136 transitions. [2024-10-13 01:38:57,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 3 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (48), 2 states have call predecessors, (48), 3 states have call successors, (48) [2024-10-13 01:38:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 136 transitions. [2024-10-13 01:38:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 01:38:57,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:57,538 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:57,558 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 (4)] Ended with exit code 0 [2024-10-13 01:38:57,742 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 [2024-10-13 01:38:57,743 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:57,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:57,744 INFO L85 PathProgramCache]: Analyzing trace with hash -320222815, now seen corresponding path program 1 times [2024-10-13 01:38:57,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:38:57,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352621880] [2024-10-13 01:38:57,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:57,745 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-13 01:38:57,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:38:57,747 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:38:57,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 01:38:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:58,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 01:38:58,247 INFO L278 TraceCheckSpWp]: Computing forward predicates...